From 8878878e35413535306a1f656660f71096795111 Mon Sep 17 00:00:00 2001
From: Valentyn Kolesnikov <javadev75@gmail.com>
Date: Tue, 19 Nov 2024 10:47:05 +0200
Subject: [PATCH] Updated spotless

---
 build.gradle.kts                              | 13 ++++--
 pom-central.xml                               |  2 +-
 .../kotlin/com_github_leetcode/Employee.kt    |  2 +-
 .../Solution.kt                               | 12 +++--
 .../Solution.kt                               |  2 +-
 .../Solution.kt                               |  2 +-
 .../s0023_merge_k_sorted_lists/Solution.kt    |  4 +-
 .../Solution.kt                               |  1 -
 .../s0040_combination_sum_ii/Solution.kt      |  3 +-
 .../g0001_0100/s0046_permutations/Solution.kt |  2 +-
 .../g0001_0100/s0048_rotate_image/Solution.kt |  2 +-
 .../s0049_group_anagrams/Solution.kt          |  2 +-
 .../g0001_0100/s0050_powx_n/Solution.kt       |  4 +-
 .../g0001_0100/s0052_n_queens_ii/Solution.kt  |  2 +-
 .../g0001_0100/s0079_word_search/Solution.kt  |  4 +-
 .../Solution.kt                               |  2 +-
 .../s0093_restore_ip_addresses/Solution.kt    |  2 +-
 .../s0097_interleaving_string/Solution.kt     |  2 +-
 .../Solution.kt                               |  4 +-
 .../g0001_0100/s0100_same_tree/Solution.kt    |  4 +-
 .../s0101_symmetric_tree/Solution.kt          |  8 +++-
 .../g0101_0200/s0112_path_sum/Solution.kt     |  4 +-
 .../g0101_0200/s0113_path_sum_ii/Solution.kt  |  2 +-
 .../g0101_0200/s0120_triangle/Solution.kt     |  2 +-
 .../Solution.kt                               |  2 +-
 .../s0126_word_ladder_ii/Solution.kt          |  4 +-
 .../Solution.kt                               |  2 +-
 .../g0101_0200/s0134_gas_station/Solution.kt  |  4 +-
 .../s0140_word_break_ii/Solution.kt           |  2 +-
 .../Solution.kt                               |  2 +-
 .../Solution.kt                               |  4 +-
 .../g0101_0200/s0155_min_stack/MinStack.kt    |  7 ++-
 .../Solution.kt                               |  2 +-
 .../s0210_course_schedule_ii/Solution.kt      |  2 +-
 .../Solution.kt                               |  8 +++-
 .../g0201_0300/s0258_add_digits/Solution.kt   |  4 +-
 .../Solution.kt                               | 13 ++++--
 .../Solution.kt                               |  2 +-
 .../g0201_0300/s0289_game_of_life/Solution.kt | 10 +++-
 .../Codec.kt                                  |  2 +-
 .../NumArray.kt                               |  4 +-
 .../s0319_bulb_switcher/Solution.kt           |  4 +-
 .../s0321_create_maximum_number/Solution.kt   |  4 +-
 .../s0336_palindrome_pairs/Solution.kt        | 17 ++++---
 .../Solution.kt                               |  2 +-
 .../s0354_russian_doll_envelopes/Solution.kt  |  6 ++-
 .../s0365_water_and_jug_problem/Solution.kt   |  4 +-
 .../g0301_0400/s0372_super_pow/Solution.kt    |  4 +-
 .../RandomizedCollection.kt                   |  8 ++--
 .../Solution.kt                               |  4 +-
 .../s0398_random_pick_index/Solution.kt       |  2 +-
 .../s0399_evaluate_division/Solution.kt       | 10 ++--
 .../g0301_0400/s0400_nth_digit/Solution.kt    |  8 ++--
 .../g0401_0500/s0401_binary_watch/Solution.kt |  2 +-
 .../g0401_0500/s0403_frog_jump/Solution.kt    |  8 ++--
 .../Solution.kt                               |  5 +-
 .../s0409_longest_palindrome/Solution.kt      |  4 +-
 .../Solution.kt                               |  4 +-
 .../Solution.kt                               |  6 ++-
 .../Solution.kt                               |  2 +-
 .../g0401_0500/s0464_can_i_win/Solution.kt    |  4 +-
 .../g0401_0500/s0475_heaters/Solution.kt      |  2 +-
 .../s0480_sliding_window_median/Solution.kt   | 10 +++-
 .../g0401_0500/s0488_zuma_game/Solution.kt    |  4 +-
 .../s0491_increasing_subsequences/Solution.kt |  2 +-
 .../s0492_construct_the_rectangle/Solution.kt |  2 +-
 .../Solution.kt                               |  3 +-
 .../kotlin/g0501_0600/s0502_ipo/Solution.kt   |  3 +-
 .../Solution.kt                               |  4 +-
 .../s0514_freedom_trail/Solution.kt           |  2 +-
 .../Solution.kt                               |  4 +-
 .../g0501_0600/s0529_minesweeper/Solution.kt  |  2 +-
 .../s0539_minimum_time_difference/Solution.kt |  4 +-
 .../g0501_0600/s0546_remove_boxes/Solution.kt |  2 +-
 .../Solution.kt                               |  2 +-
 .../Solution.kt                               |  2 +-
 .../Solution.kt                               | 10 ++--
 .../Solution.kt                               | 12 +++--
 .../s0572_subtree_of_another_tree/Solution.kt |  8 ++--
 .../s0576_out_of_boundary_paths/Solution.kt   |  4 +-
 .../Solution.kt                               | 12 +++--
 .../g0501_0600/s0593_valid_square/Solution.kt |  4 +-
 .../s0617_merge_two_binary_trees/Solution.kt  | 12 +++--
 .../MyCircularQueue.kt                        |  8 +++-
 .../s0638_shopping_offers/Solution.kt         |  8 ++--
 .../MyCircularDeque.kt                        |  8 +++-
 .../s0655_print_binary_tree/Solution.kt       |  6 ++-
 .../Solution.kt                               |  2 +-
 .../s0684_redundant_connection/Solution.kt    |  4 +-
 .../s0685_redundant_connection_ii/Solution.kt |  4 +-
 .../Solution.kt                               |  4 +-
 .../s0691_stickers_to_spell_word/Solution.kt  |  4 +-
 .../s0692_top_k_frequent_words/Solution.kt    |  2 +-
 .../Solution.kt                               |  2 +-
 .../Solution.kt                               |  4 +-
 .../s0726_number_of_atoms/Solution.kt         |  2 +-
 .../s0741_cherry_pickup/Solution.kt           |  2 +-
 .../s0749_contain_virus/Solution.kt           |  4 +-
 .../s0753_cracking_the_safe/Solution.kt       |  2 +-
 .../Solution.kt                               |  4 +-
 .../s0761_special_binary_string/Solution.kt   |  2 +-
 .../s0764_largest_plus_sign/Solution.kt       |  2 +-
 .../s0770_basic_calculator_iv/Solution.kt     |  2 +-
 .../s0778_swim_in_rising_water/Solution.kt    |  2 +-
 .../s0794_valid_tic_tac_toe_state/Solution.kt |  4 +-
 .../s0804_unique_morse_code_words/Solution.kt |  2 +-
 .../s0808_soup_servings/Solution.kt           |  4 +-
 .../s0814_binary_tree_pruning/Solution.kt     |  4 +-
 .../g0801_0900/s0815_bus_routes/Solution.kt   |  2 +-
 .../s0816_ambiguous_coordinates/Solution.kt   |  4 +-
 .../s0835_image_overlap/Solution.kt           |  2 +-
 .../s0840_magic_squares_in_grid/Solution.kt   |  4 +-
 .../Solution.kt                               |  2 +-
 .../s0850_rectangle_area_ii/Solution.kt       |  8 ++--
 .../g0801_0900/s0855_exam_room/ExamRoom.kt    |  4 +-
 .../Solution.kt                               |  4 +-
 .../s0867_transpose_matrix/Solution.kt        |  2 +-
 .../Solution.kt                               |  2 +-
 .../s0881_boats_to_save_people/Solution.kt    |  4 +-
 .../Solution.kt                               |  2 +-
 .../Solution.kt                               | 10 ++--
 .../Solution.kt                               |  2 +-
 .../Solution.kt                               |  8 +++-
 .../s0908_smallest_range_i/Solution.kt        |  4 +-
 .../s0913_cat_and_mouse/Solution.kt           |  4 +-
 .../Solution.kt                               |  4 +-
 .../s0934_shortest_bridge/Solution.kt         |  2 +-
 .../Solution.kt                               |  2 +-
 .../s0939_minimum_area_rectangle/Solution.kt  | 12 +++--
 .../Solution.kt                               |  6 ++-
 .../Solution.kt                               |  6 ++-
 .../s0954_array_of_doubled_pairs/Solution.kt  |  4 +-
 .../Solution.kt                               |  2 +-
 .../Solution.kt                               |  4 +-
 .../s0966_vowel_spellchecker/Solution.kt      |  4 +-
 .../s0968_binary_tree_cameras/Solution.kt     |  4 +-
 .../Solution.kt                               |  6 +--
 .../Solution.kt                               |  3 +-
 .../s0993_cousins_in_binary_tree/Solution.kt  |  6 ++-
 .../s1024_video_stitching/Solution.kt         |  6 ++-
 .../Solution.kt                               |  2 +-
 .../Solution.kt                               |  4 +-
 .../s1036_escape_a_large_maze/Solution.kt     | 12 +++--
 .../Solution.kt                               |  7 ++-
 .../s1048_longest_string_chain/Solution.kt    |  2 +-
 .../Solution.kt                               |  4 +-
 .../Solution.kt                               |  4 +-
 .../s1095_find_in_mountain_array/Solution.kt  |  4 +-
 .../s1096_brace_expansion_ii/Solution.kt      |  4 +-
 .../Solution.kt                               |  4 +-
 .../Solution.kt                               |  4 +-
 .../Solution.kt                               |  2 +-
 .../Solution.kt                               |  4 +-
 .../Solution.kt                               |  4 +-
 .../s1175_prime_arrangements/Solution.kt      |  2 +-
 .../Solution.kt                               |  5 +-
 .../Solution.kt                               |  2 +-
 .../Solution.kt                               |  2 +-
 .../DiningPhilosophers.kt                     |  2 +-
 .../Solution.kt                               |  4 +-
 .../Solution.kt                               |  4 +-
 .../Solution.kt                               |  4 +-
 .../Solution.kt                               |  2 +-
 .../Solution.kt                               |  2 +-
 .../CombinationIterator.kt                    |  2 +-
 .../Solution.kt                               |  2 +-
 .../s1291_sequential_digits/Solution.kt       |  2 +-
 .../Solution.kt                               |  2 +-
 .../Solution.kt                               |  2 +-
 .../Solution.kt                               |  4 +-
 .../Solution.kt                               |  4 +-
 .../Solution.kt                               |  2 +-
 .../Solution.kt                               |  4 +-
 .../Solution.kt                               |  4 +-
 .../Solution.kt                               |  4 +-
 .../Solution.kt                               |  2 +-
 .../TweetCounts.kt                            | 16 +++++--
 .../Cashier.kt                                |  4 +-
 .../Solution.kt                               |  2 +-
 .../Solution.kt                               | 28 ++++++-----
 .../Solution.kt                               |  9 ++--
 .../Solution.kt                               |  5 +-
 .../Solution.kt                               |  6 ++-
 .../s1388_pizza_with_3n_slices/Solution.kt    |  3 +-
 .../Solution.kt                               |  6 +--
 .../s1397_find_all_good_strings/Solution.kt   |  4 +-
 .../Solution.kt                               |  2 +-
 .../s1406_stone_game_iii/Solution.kt          |  2 +-
 .../Solution.kt                               |  2 +-
 .../Solution.kt                               |  4 +-
 .../Solution.kt                               |  2 +-
 .../Solution.kt                               |  2 +-
 .../Solution.kt                               |  4 +-
 .../s1447_simplified_fractions/Solution.kt    |  4 +-
 .../Solution.kt                               |  4 +-
 .../Solution.kt                               |  4 +-
 .../s1462_course_schedule_iv/Solution.kt      |  2 +-
 .../s1473_paint_house_iii/Solution.kt         | 18 +++++---
 .../Solution.kt                               |  7 +--
 .../s1499_max_value_of_equation/Solution.kt   |  2 +-
 .../Solution.kt                               |  4 +-
 .../Solution.kt                               |  2 +-
 .../Solution.kt                               |  4 +-
 .../Solution.kt                               |  4 +-
 .../s1531_string_compression_ii/Solution.kt   |  4 +-
 .../Solution.kt                               |  4 +-
 .../Solution.kt                               |  6 +--
 .../Solution.kt                               |  4 +-
 .../s1583_count_unhappy_friends/Solution.kt   |  2 +-
 .../Solution.kt                               |  2 +-
 .../s1591_strange_printer_ii/Solution.kt      |  2 +-
 .../Solution.kt                               |  4 +-
 .../Solution.kt                               |  2 +-
 .../ThroneInheritance.kt                      |  2 +-
 .../Solution.kt                               |  4 +-
 .../Solution.kt                               |  4 +-
 .../g1601_1700/s1622_fancy_sequence/Fancy.kt  |  4 +-
 .../Solution.kt                               |  6 +--
 .../Solution.kt                               | 11 +++--
 .../Solution.kt                               |  4 +-
 .../Solution.kt                               |  4 +-
 .../Solution.kt                               |  2 +-
 .../Solution.kt                               |  4 +-
 .../Solution.kt                               |  8 +++-
 .../Solution.kt                               |  4 +-
 .../s1766_tree_of_coprimes/Solution.kt        |  2 +-
 .../Solution.kt                               |  2 +-
 .../Solution.kt                               |  4 +-
 .../Solution.kt                               |  4 +-
 .../Solution.kt                               |  4 +-
 .../Solution.kt                               |  2 +-
 .../Solution.kt                               |  4 +-
 .../s1825_finding_mk_average/MKAverage.kt     |  4 +-
 .../Solution.kt                               |  8 ++--
 .../s1834_single_threaded_cpu/Solution.kt     |  2 +-
 .../Solution.kt                               |  2 +-
 .../Solution.kt                               |  4 +-
 .../s1871_jump_game_vii/Solution.kt           |  1 -
 .../Solution.kt                               |  2 +-
 .../s1895_largest_magic_square/Solution.kt    |  2 +-
 .../Solution.kt                               |  8 ++--
 .../Solution.kt                               |  4 +-
 .../Solution.kt                               |  6 +--
 .../Solution.kt                               | 46 ++++++++++++-------
 .../s1958_check_if_move_is_legal/Solution.kt  |  2 +-
 .../Solution.kt                               |  9 +++-
 .../Solution.kt                               |  2 +-
 .../Solution.kt                               |  2 +-
 .../s2029_stone_game_ix/Solution.kt           |  4 +-
 .../Solution.kt                               |  6 +--
 .../Solution.kt                               |  3 +-
 .../Solution.kt                               |  4 +-
 .../Solution.kt                               |  2 +-
 .../Solution.kt                               |  2 +-
 .../Solution.kt                               |  2 +-
 .../SORTracker.kt                             |  4 +-
 .../Solution.kt                               |  2 +-
 .../Solution.kt                               |  4 +-
 .../Solution.kt                               |  4 +-
 .../s2132_stamping_the_grid/Solution.kt       | 12 ++---
 .../Solution.kt                               |  4 +-
 .../Solution.kt                               | 16 ++++---
 .../Solution.kt                               |  2 +-
 .../Solution.kt                               |  2 +-
 .../Solution.kt                               |  2 +-
 .../Solution.kt                               |  4 +-
 .../Solution.kt                               |  2 +-
 .../Solution.kt                               |  4 +-
 .../Solution.kt                               | 12 +++--
 .../Solution.kt                               |  4 +-
 .../Solution.kt                               |  2 +-
 .../Solution.kt                               |  4 +-
 .../Solution.kt                               |  4 +-
 .../Solution.kt                               |  4 +-
 .../Solution.kt                               |  2 +-
 .../Solution.kt                               |  8 ++--
 .../BookMyShow.kt                             |  8 +++-
 .../Solution.kt                               | 14 +++---
 .../Solution.kt                               |  2 +-
 .../Solution.kt                               |  2 +-
 .../NumberContainers.kt                       |  4 +-
 .../FoodRatings.kt                            |  4 +-
 .../Solution.kt                               |  2 +-
 .../Solution.kt                               |  5 +-
 .../s2376_count_special_integers/Solution.kt  |  5 +-
 .../Solution.kt                               |  2 +-
 .../Solution.kt                               |  1 -
 .../Solution.kt                               |  7 ++-
 .../Solution.kt                               |  2 +-
 .../Solution.kt                               |  3 +-
 .../Solution.kt                               |  8 +++-
 .../Solution.kt                               |  4 +-
 .../Solution.kt                               |  2 +-
 .../Solution.kt                               |  4 +-
 .../Solution.kt                               |  4 +-
 .../Solution.kt                               |  2 +-
 .../Solution.kt                               |  1 -
 .../Solution.kt                               |  2 +-
 .../Solution.kt                               |  2 +-
 .../Solution.kt                               |  4 +-
 .../Solution.kt                               |  4 +-
 .../s2512_reward_top_k_students/Solution.kt   |  2 +-
 .../Solution.kt                               |  4 +-
 .../Solution.kt                               |  4 +-
 .../Solution.kt                               |  4 +-
 .../s2551_put_marbles_in_bags/Solution.kt     |  3 +-
 .../Solution.kt                               |  4 +-
 .../s2564_substring_xor_queries/Solution.kt   |  2 +-
 .../Solution.kt                               |  7 ++-
 .../Solution.kt                               |  3 +-
 .../Solution.kt                               |  7 ++-
 .../Solution.kt                               |  6 ++-
 .../Solution.kt                               |  4 +-
 .../Solution.kt                               |  6 ++-
 .../Solution.kt                               |  4 +-
 .../Solution.kt                               |  5 +-
 .../s2659_make_array_empty/Solution.kt        |  3 +-
 .../g2601_2700/s2680_maximum_or/Solution.kt   |  2 +-
 .../Solution.kt                               |  3 +-
 .../Solution.kt                               |  5 +-
 .../Solution.kt                               |  3 +-
 .../Solution.kt                               |  2 +-
 .../s2719_count_of_integers/Solution.kt       |  5 +-
 .../Solution.kt                               |  6 ++-
 .../s2736_maximum_sum_queries/Solution.kt     |  2 +-
 .../Solution.kt                               |  2 +-
 .../Solution.kt                               |  2 +-
 .../Solution.kt                               |  4 +-
 .../s2768_number_of_black_blocks/Solution.kt  |  3 +-
 .../s2785_sort_vowels_in_a_string/Solution.kt | 16 ++++---
 .../Solution.kt                               |  4 +-
 .../Solution.kt                               | 16 ++++---
 .../Solution.kt                               |  4 +-
 .../Solution.kt                               |  2 +-
 .../Solution.kt                               |  3 +-
 .../Solution.kt                               |  4 +-
 .../Solution.kt                               | 12 +++--
 .../Solution.kt                               |  2 +-
 .../Solution.kt                               |  4 +-
 .../Solution.kt                               |  4 +-
 .../s2865_beautiful_towers_i/Solution.kt      |  6 +--
 .../Solution.kt                               |  2 +-
 .../Solution.kt                               |  2 +-
 .../Solution.kt                               |  2 +-
 .../Solution.kt                               |  6 ++-
 .../Solution.kt                               |  6 +--
 .../Solution.kt                               |  2 +-
 .../Solution.kt                               |  2 +-
 .../Solution.kt                               |  7 ++-
 .../Solution.kt                               |  2 +-
 .../Solution.kt                               |  2 +-
 .../Solution.kt                               |  4 +-
 .../Solution.kt                               |  2 +-
 .../Solution.kt                               | 13 ++++--
 .../Solution.kt                               |  7 ++-
 .../Solution.kt                               |  4 +-
 .../Solution.kt                               | 18 ++++----
 .../s3044_most_frequent_prime/Solution.kt     |  4 +-
 .../Solution.kt                               |  5 +-
 .../Solution.kt                               |  4 +-
 .../Solution.kt                               |  2 +-
 .../Solution.kt                               | 11 +++--
 .../Solution.kt                               | 12 ++---
 .../g3101_3200/s3136_valid_word/Solution.kt   |  2 +-
 .../Solution.kt                               |  2 +-
 .../Solution.kt                               | 34 +++++++-------
 .../Solution.kt                               |  4 +-
 .../Solution.kt                               | 10 ++--
 .../s3187_peaks_in_array/Solution.kt          |  7 ++-
 .../Solution.kt                               |  2 +-
 .../Solution.kt                               |  2 +-
 .../Solution.kt                               |  2 +-
 .../Solution.kt                               |  4 +-
 .../Solution.kt                               |  7 ++-
 .../Solution.kt                               |  7 ++-
 .../Solution.kt                               | 14 +++---
 .../Solution.kt                               |  2 +-
 .../Solution.kt                               | 15 ++++--
 .../Solution.kt                               |  4 +-
 .../Solution.kt                               |  4 +-
 .../Solution.kt                               |  2 +-
 .../Solution.kt                               | 16 +++----
 .../Solution.kt                               |  4 +-
 .../kotlin/com_github_leetcode/NodeTest.kt    |  4 +-
 .../kotlin/com_github_leetcode/TreeUtils.kt   |  6 +--
 .../left_right/NodeTest.kt                    |  4 +-
 .../com_github_leetcode/neighbors/NodeTest.kt |  2 +-
 .../com_github_leetcode/random/NodeTest.kt    |  2 +-
 .../s0002_add_two_numbers/SolutionTest.kt     |  7 +--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../g0001_0100/s0015_3sum/SolutionTest.kt     |  6 +--
 .../s0016_3sum_closest/SolutionTest.kt        |  4 +-
 .../SolutionTest.kt                           |  8 ++--
 .../g0001_0100/s0018_4sum/SolutionTest.kt     | 16 +++----
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           | 12 +++--
 .../s0036_valid_sudoku/SolutionTest.kt        |  8 ++--
 .../s0037_sudoku_solver/SolutionTest.kt       |  4 +-
 .../s0039_combination_sum/SolutionTest.kt     |  8 ++--
 .../s0040_combination_sum_ii/SolutionTest.kt  |  4 +-
 .../s0046_permutations/SolutionTest.kt        |  7 +--
 .../s0047_permutations_ii/SolutionTest.kt     | 12 +++--
 .../s0048_rotate_image/SolutionTest.kt        |  6 +--
 .../s0049_group_anagrams/SolutionTest.kt      |  4 +-
 .../g0001_0100/s0051_n_queens/SolutionTest.kt |  6 +--
 .../s0054_spiral_matrix/SolutionTest.kt       |  8 ++--
 .../s0056_merge_intervals/SolutionTest.kt     |  8 ++--
 .../s0057_insert_interval/SolutionTest.kt     | 13 ++++--
 .../s0059_spiral_matrix_ii/SolutionTest.kt    |  2 +-
 .../s0063_unique_paths_ii/SolutionTest.kt     |  5 +-
 .../s0064_minimum_path_sum/SolutionTest.kt    |  2 +-
 .../s0068_text_justification/SolutionTest.kt  |  2 +-
 .../s0074_search_a_2d_matrix/SolutionTest.kt  | 12 ++---
 .../s0077_combinations/SolutionTest.kt        |  8 +++-
 .../g0001_0100/s0078_subsets/SolutionTest.kt  |  8 ++--
 .../s0085_maximal_rectangle/SolutionTest.kt   |  6 ++-
 .../s0090_subsets_ii/SolutionTest.kt          | 12 +++--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           | 12 ++---
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  5 +-
 .../SolutionTest.kt                           |  5 +-
 .../g0101_0200/s0112_path_sum/SolutionTest.kt |  2 +-
 .../s0113_path_sum_ii/SolutionTest.kt         |  4 +-
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  4 +-
 .../s0118_pascals_triangle/SolutionTest.kt    |  4 +-
 .../s0126_word_ladder_ii/SolutionTest.kt      | 16 ++++---
 .../s0127_word_ladder/SolutionTest.kt         | 10 ++--
 .../s0130_surrounded_regions/SolutionTest.kt  |  8 ++--
 .../s0133_clone_graph/SolutionTest.kt         |  5 +-
 .../s0134_gas_station/SolutionTest.kt         |  4 +-
 .../s0140_word_break_ii/SolutionTest.kt       | 11 +++--
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  2 +-
 .../s0147_insertion_sort_list/SolutionTest.kt |  3 +-
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  6 +--
 .../s0175_combine_two_tables/MysqlTest.kt     | 10 ++--
 .../s0176_second_highest_salary/MysqlTest.kt  | 10 ++--
 .../g0101_0200/s0178_rank_scores/MysqlTest.kt | 10 ++--
 .../s0180_consecutive_numbers/MysqlTest.kt    | 10 ++--
 .../MysqlTest.kt                              | 10 ++--
 .../s0182_duplicate_emails/MysqlTest.kt       | 10 ++--
 .../MysqlTest.kt                              | 10 ++--
 .../MysqlTest.kt                              | 10 ++--
 .../MysqlTest.kt                              | 10 ++--
 .../SolutionTest.kt                           |  4 +-
 .../s0190_reverse_bits/SolutionTest.kt        |  4 +-
 .../MysqlTest.kt                              | 10 ++--
 .../s0197_rising_temperature/MysqlTest.kt     | 12 ++---
 .../s0200_number_of_islands/SolutionTest.kt   | 20 ++++----
 .../SolutionTest.kt                           |  3 +-
 .../SolutionTest.kt                           |  3 +-
 .../s0210_course_schedule_ii/SolutionTest.kt  |  2 +-
 .../s0212_word_search_ii/SolutionTest.kt      |  2 +-
 .../SolutionTest.kt                           |  2 +-
 .../s0216_combination_sum_iii/SolutionTest.kt |  4 +-
 .../s0217_contains_duplicate/SolutionTest.kt  |  2 +-
 .../s0218_the_skyline_problem/SolutionTest.kt |  4 +-
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           |  6 +--
 .../s0221_maximal_square/SolutionTest.kt      |  6 ++-
 .../s0228_summary_ranges/SolutionTest.kt      |  4 +-
 .../s0229_majority_element_ii/SolutionTest.kt |  2 +-
 .../SolutionTest.kt                           | 12 ++---
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           | 14 ++++--
 .../SolutionTest.kt                           |  2 +-
 .../s0257_binary_tree_paths/SolutionTest.kt   |  2 +-
 .../s0260_single_number_iii/SolutionTest.kt   |  2 +-
 .../s0262_trips_and_users/MysqlTest.kt        | 10 ++--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  3 +-
 .../s0289_game_of_life/SolutionTest.kt        |  2 +-
 .../SolutionTest.kt                           |  4 +-
 .../NumMatrixTest.kt                          |  4 +-
 .../SolutionTest.kt                           |  7 +--
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  8 ++--
 .../s0336_palindrome_pairs/SolutionTest.kt    | 24 +++++-----
 .../s0337_house_robber_iii/SolutionTest.kt    |  4 +-
 .../NestedIteratorTest.kt                     | 11 +++--
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  3 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  6 +--
 .../s0376_wiggle_subsequence/SolutionTest.kt  |  5 +-
 .../SolutionTest.kt                           |  2 +-
 .../RandomizedSetTest.kt                      |  4 +-
 .../RandomizedCollectionTest.kt               |  4 +-
 .../s0385_mini_parser/SolutionTest.kt         |  2 +-
 .../SolutionTest.kt                           |  2 +-
 .../s0391_perfect_rectangle/SolutionTest.kt   | 24 +++++-----
 .../s0399_evaluate_division/SolutionTest.kt   |  4 +-
 .../s0401_binary_watch/SolutionTest.kt        | 10 ++--
 .../s0404_sum_of_left_leaves/SolutionTest.kt  |  4 +-
 .../SolutionTest.kt                           | 20 ++++----
 .../SolutionTest.kt                           | 12 ++---
 .../s0412_fizz_buzz/SolutionTest.kt           |  9 ++--
 .../SolutionTest.kt                           | 29 ++++++------
 .../SolutionTest.kt                           |  2 +-
 .../s0427_construct_quad_tree/SolutionTest.kt |  8 ++--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           | 12 +++--
 .../SolutionTest.kt                           |  8 ++--
 .../s0436_find_right_interval/SolutionTest.kt |  2 +-
 .../s0437_path_sum_iii/SolutionTest.kt        | 14 +++---
 .../SolutionTest.kt                           |  2 +-
 .../s0443_string_compression/SolutionTest.kt  |  8 ++--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  5 +-
 .../CodecTest.kt                              |  8 ++--
 .../g0401_0500/s0454_4sum_ii/SolutionTest.kt  |  4 +-
 .../s0455_assign_cookies/SolutionTest.kt      |  9 ++--
 .../s0463_island_perimeter/SolutionTest.kt    |  6 +--
 .../s0468_validate_ip_address/SolutionTest.kt |  2 +-
 .../s0472_concatenated_words/SolutionTest.kt  | 12 ++---
 .../s0474_ones_and_zeroes/SolutionTest.kt     |  2 +-
 .../SolutionTest.kt                           | 14 ++++--
 .../s0483_smallest_good_base/SolutionTest.kt  |  2 +-
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           |  4 +-
 .../s0498_diagonal_traverse/SolutionTest.kt   |  4 +-
 .../s0500_keyboard_row/SolutionTest.kt        |  4 +-
 .../g0501_0600/s0502_ipo/SolutionTest.kt      |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../s0506_relative_ranks/SolutionTest.kt      |  4 +-
 .../s0511_game_play_analysis_i/MysqlTest.kt   | 10 ++--
 .../SolutionTest.kt                           |  7 +--
 .../s0529_minesweeper/SolutionTest.kt         |  8 ++--
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           |  7 +--
 .../SolutionTest.kt                           |  5 +-
 .../s0542_01_matrix/SolutionTest.kt           |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../s0547_number_of_provinces/SolutionTest.kt |  4 +-
 .../s0550_game_play_analysis_iv/MysqlTest.kt  | 10 ++--
 .../s0553_optimal_division/SolutionTest.kt    |  2 +-
 .../s0554_brick_wall/SolutionTest.kt          | 10 ++--
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  2 +-
 .../MysqlTest.kt                              | 10 ++--
 .../SolutionTest.kt                           |  2 +-
 .../s0577_employee_bonus/MysqlTest.kt         | 10 ++--
 .../SolutionTest.kt                           |  3 +-
 .../s0584_find_customer_referee/MysqlTest.kt  | 10 ++--
 .../s0585_investments_in_2016/MysqlTest.kt    | 10 ++--
 .../MysqlTest.kt                              | 10 ++--
 .../s0587_erect_the_fence/SolutionTest.kt     |  8 ++--
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  2 +-
 .../s0591_tag_validator/SolutionTest.kt       |  6 +--
 .../s0595_big_countries/MysqlTest.kt          | 10 ++--
 .../MysqlTest.kt                              | 10 ++--
 .../s0598_range_addition_ii/SolutionTest.kt   |  2 +-
 .../SolutionTest.kt                           |  5 +-
 .../MysqlTest.kt                              | 10 ++--
 .../MysqlTest.kt                              | 10 ++--
 .../s0607_sales_person/MysqlTest.kt           | 10 ++--
 .../g0601_0700/s0608_tree_node/MysqlTest.kt   | 10 ++--
 .../SolutionTest.kt                           | 20 ++++----
 .../s0610_triangle_judgement/MysqlTest.kt     | 10 ++--
 .../s0619_biggest_single_number/MysqlTest.kt  | 10 ++--
 .../s0620_not_boring_movies/MysqlTest.kt      | 10 ++--
 .../s0621_task_scheduler/SolutionTest.kt      | 10 ++--
 .../s0623_add_one_row_to_tree/SolutionTest.kt |  6 ++-
 .../s0626_exchange_seats/MysqlTest.kt         | 10 ++--
 .../g0601_0700/s0627_swap_salary/MysqlTest.kt | 10 ++--
 .../s0630_course_schedule_iii/SolutionTest.kt |  2 +-
 .../SolutionTest.kt                           | 12 ++---
 .../SolutionTest.kt                           | 17 +++----
 .../SolutionTest.kt                           |  4 +-
 .../s0638_shopping_offers/SolutionTest.kt     |  8 ++--
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  6 ++-
 .../s0648_replace_words/SolutionTest.kt       |  6 +--
 .../SolutionTest.kt                           |  4 +-
 .../s0654_maximum_binary_tree/SolutionTest.kt |  4 +-
 .../s0655_print_binary_tree/SolutionTest.kt   |  2 +-
 .../SolutionTest.kt                           |  4 +-
 .../s0661_image_smoother/SolutionTest.kt      |  4 +-
 .../SolutionTest.kt                           | 12 +++--
 .../s0682_baseball_game/SolutionTest.kt       |  2 +-
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           |  4 +-
 .../s0690_employee_importance/SolutionTest.kt |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  8 ++--
 .../s0695_max_area_of_island/SolutionTest.kt  |  2 +-
 .../s0697_degree_of_an_array/SolutionTest.kt  |  3 +-
 .../SolutionTest.kt                           |  2 +-
 .../s0699_falling_squares/SolutionTest.kt     |  4 +-
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           | 14 ++++--
 .../s0721_accounts_merge/SolutionTest.kt      |  8 ++--
 .../s0722_remove_comments/SolutionTest.kt     |  2 +-
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           |  5 +-
 .../SolutionTest.kt                           |  4 +-
 .../s0733_flood_fill/SolutionTest.kt          |  4 +-
 .../s0735_asteroid_collision/SolutionTest.kt  |  5 +-
 .../SolutionTest.kt                           |  3 +-
 .../s0739_daily_temperatures/SolutionTest.kt  |  6 +--
 .../s0741_cherry_pickup/SolutionTest.kt       |  4 +-
 .../s0743_network_delay_time/SolutionTest.kt  |  2 +-
 .../SolutionTest.kt                           | 12 +++--
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           | 10 ++--
 .../s0749_contain_virus/SolutionTest.kt       |  4 +-
 .../s0752_open_the_lock/SolutionTest.kt       | 15 ++++--
 .../SolutionTest.kt                           |  7 +--
 .../SolutionTest.kt                           | 12 ++---
 .../s0763_partition_labels/SolutionTest.kt    |  2 +-
 .../SolutionTest.kt                           |  4 +-
 .../s0766_toeplitz_matrix/SolutionTest.kt     | 10 ++--
 .../s0770_basic_calculator_iv/SolutionTest.kt | 10 ++--
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           | 30 ++++++------
 .../SolutionTest.kt                           | 12 ++---
 .../SolutionTest.kt                           |  5 +-
 .../s0785_is_graph_bipartite/SolutionTest.kt  |  8 ++--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           | 16 +++++--
 .../s0789_escape_the_ghosts/SolutionTest.kt   |  6 +--
 .../SolutionTest.kt                           |  7 +--
 .../SolutionTest.kt                           |  9 ++--
 .../SolutionTest.kt                           |  3 +-
 .../SolutionTest.kt                           | 14 +++---
 .../SolutionTest.kt                           |  5 +-
 .../SolutionTest.kt                           | 12 ++---
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           | 12 ++---
 .../SolutionTest.kt                           |  8 ++--
 .../s0809_expressive_words/SolutionTest.kt    |  4 +-
 .../SolutionTest.kt                           | 18 ++++----
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           |  5 +-
 .../s0815_bus_routes/SolutionTest.kt          |  8 ++--
 .../SolutionTest.kt                           | 10 ++--
 .../s0819_most_common_word/SolutionTest.kt    |  5 +-
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  2 +-
 .../s0822_card_flipping_game/SolutionTest.kt  |  2 +-
 .../s0824_goat_latin/SolutionTest.kt          |  6 +--
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           | 10 ++--
 .../SolutionTest.kt                           |  3 +-
 .../s0832_flipping_an_image/SolutionTest.kt   | 12 ++---
 .../SolutionTest.kt                           | 14 ++++--
 .../SolutionTest.kt                           |  7 +--
 .../s0835_image_overlap/SolutionTest.kt       |  4 +-
 .../s0836_rectangle_overlap/SolutionTest.kt   |  6 +--
 .../s0837_new_21_game/SolutionTest.kt         |  5 +-
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  2 +-
 .../s0841_keys_and_rooms/SolutionTest.kt      | 12 +++--
 .../SolutionTest.kt                           |  5 +-
 .../s0843_guess_the_word/SolutionTest.kt      |  2 +-
 .../s0846_hand_of_straights/SolutionTest.kt   |  2 +-
 .../SolutionTest.kt                           |  8 ++--
 .../s0850_rectangle_area_ii/SolutionTest.kt   |  4 +-
 .../s0851_loud_and_rich/SolutionTest.kt       |  9 ++--
 .../s0853_car_fleet/SolutionTest.kt           |  5 +-
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           | 10 ++--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           | 12 ++---
 .../s0867_transpose_matrix/SolutionTest.kt    |  4 +-
 .../s0870_advantage_shuffle/SolutionTest.kt   |  4 +-
 .../SolutionTest.kt                           |  6 ++-
 .../s0872_leaf_similar_trees/SolutionTest.kt  |  4 +-
 .../SolutionTest.kt                           |  5 +-
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           |  4 +-
 .../s0879_profitable_schemes/SolutionTest.kt  |  4 +-
 .../SolutionTest.kt                           | 15 +++---
 .../SolutionTest.kt                           |  4 +-
 .../s0885_spiral_matrix_iii/SolutionTest.kt   |  8 ++--
 .../SolutionTest.kt                           |  9 ++--
 .../s0888_fair_candy_swap/SolutionTest.kt     |  6 +--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           | 10 ++--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  5 +-
 .../s0909_snakes_and_ladders/SolutionTest.kt  |  6 +--
 .../s0912_sort_an_array/SolutionTest.kt       |  5 +-
 .../s0913_cat_and_mouse/SolutionTest.kt       |  8 ++--
 .../SolutionTest.kt                           |  6 ++-
 .../s0916_word_subsets/SolutionTest.kt        |  4 +-
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           | 12 ++---
 .../s0927_three_equal_parts/SolutionTest.kt   |  6 +--
 .../SolutionTest.kt                           | 14 +++---
 .../SolutionTest.kt                           | 14 +++---
 .../SolutionTest.kt                           |  5 +-
 .../s0934_shortest_bridge/SolutionTest.kt     |  8 ++--
 .../SolutionTest.kt                           | 10 ++--
 .../SolutionTest.kt                           | 44 ++++++++++++------
 .../SolutionTest.kt                           | 12 ++---
 .../s0942_di_string_match/SolutionTest.kt     |  5 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           | 12 ++---
 .../s0948_bag_of_tokens/SolutionTest.kt       |  3 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../s0962_maximum_width_ramp/SolutionTest.kt  |  3 +-
 .../SolutionTest.kt                           | 14 +++---
 .../SolutionTest.kt                           |  4 +-
 .../s0966_vowel_spellchecker/SolutionTest.kt  | 12 ++---
 .../SolutionTest.kt                           |  8 ++--
 .../s0968_binary_tree_cameras/SolutionTest.kt |  8 ++--
 .../s0969_pancake_sorting/SolutionTest.kt     |  4 +-
 .../s0970_powerful_integers/SolutionTest.kt   |  4 +-
 .../SolutionTest.kt                           | 12 +++--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  8 ++--
 .../s0980_unique_paths_iii/SolutionTest.kt    |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           | 12 ++---
 .../SolutionTest.kt                           | 16 +++----
 .../SolutionTest.kt                           | 14 +++---
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           | 12 ++---
 .../s0994_rotting_oranges/SolutionTest.kt     |  2 +-
 .../SolutionTest.kt                           | 16 ++++---
 .../SolutionTest.kt                           | 18 ++++----
 .../s1001_grid_illumination/SolutionTest.kt   | 16 ++++---
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  5 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  3 +-
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  4 +-
 .../s1020_number_of_enclaves/SolutionTest.kt  | 12 ++---
 .../SolutionTest.kt                           |  2 +-
 .../s1023_camelcase_matching/SolutionTest.kt  | 18 ++++----
 .../s1024_video_stitching/SolutionTest.kt     | 12 ++---
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  6 +--
 .../s1029_two_city_scheduling/SolutionTest.kt | 18 ++++----
 .../SolutionTest.kt                           | 10 ++--
 .../SolutionTest.kt                           |  6 +--
 .../s1034_coloring_a_border/SolutionTest.kt   |  6 +--
 .../s1035_uncrossed_lines/SolutionTest.kt     |  6 +--
 .../s1036_escape_a_large_maze/SolutionTest.kt |  4 +-
 .../s1037_valid_boomerang/SolutionTest.kt     |  3 +-
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           | 10 ++--
 .../SolutionTest.kt                           |  4 +-
 .../MysqlTest.kt                              | 10 ++--
 .../SolutionTest.kt                           |  4 +-
 .../MysqlTest.kt                              | 10 ++--
 .../SolutionTest.kt                           |  7 +--
 .../SolutionTest.kt                           |  2 +-
 .../s1054_distant_barcodes/SolutionTest.kt    |  4 +-
 .../SolutionTest.kt                           |  6 +--
 .../MysqlTest.kt                              | 10 ++--
 .../MysqlTest.kt                              | 10 ++--
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           |  4 +-
 .../s1075_project_employees_i/MysqlTest.kt    | 10 ++--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           | 21 +++++----
 .../s1084_sales_analysis_iii/MysqlTest.kt     | 10 ++--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  7 +--
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           | 12 ++---
 .../s1094_car_pooling/SolutionTest.kt         |  3 +-
 .../SolutionTest.kt                           | 10 ++--
 .../s1096_brace_expansion_ii/SolutionTest.kt  |  4 +-
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           | 10 ++--
 .../SolutionTest.kt                           |  5 +-
 .../s1122_relative_sort_array/SolutionTest.kt |  4 +-
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           | 19 +++++---
 .../SolutionTest.kt                           | 12 ++---
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../MysqlTest.kt                              | 10 ++--
 .../SolutionTest.kt                           |  2 +-
 .../s1148_article_views_i/MysqlTest.kt        | 10 ++--
 .../s1158_market_analysis_i/MysqlTest.kt      | 10 ++--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  4 +-
 .../MysqlTest.kt                              | 10 ++--
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  6 +--
 .../MysqlTest.kt                              | 10 ++--
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           | 29 +++++++++---
 .../MysqlTest.kt                              | 10 ++--
 .../SolutionTest.kt                           |  9 ++--
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  6 +--
 .../s1193_monthly_transactions_i/MysqlTest.kt | 10 ++--
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           | 16 ++++---
 .../SolutionTest.kt                           | 26 +++++++----
 .../MysqlTest.kt                              | 10 ++--
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  4 +-
 .../MysqlTest.kt                              | 10 ++--
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           | 20 ++++----
 .../SolutionTest.kt                           |  2 +-
 .../DiningPhilosophersTest.kt                 | 10 ++--
 .../SolutionTest.kt                           | 12 ++---
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  2 +-
 .../s1251_average_selling_price/MysqlTest.kt  | 10 ++--
 .../SolutionTest.kt                           | 18 ++++----
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           | 16 +++++--
 .../SolutionTest.kt                           | 27 ++++++-----
 .../s1260_shift_2d_grid/SolutionTest.kt       | 26 ++++++-----
 .../SolutionTest.kt                           | 18 ++++----
 .../SolutionTest.kt                           |  5 +-
 .../SolutionTest.kt                           | 22 +++++----
 .../SolutionTest.kt                           | 27 +++++++----
 .../SolutionTest.kt                           | 29 +++++++-----
 .../SolutionTest.kt                           |  4 +-
 .../MysqlTest.kt                              | 10 ++--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           | 14 +++---
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           | 13 +++---
 .../SolutionTest.kt                           |  2 +-
 .../s1291_sequential_digits/SolutionTest.kt   |  2 +-
 .../SolutionTest.kt                           | 18 +++++---
 .../SolutionTest.kt                           | 20 ++++----
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           | 37 ++++++++++-----
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           | 20 ++++----
 .../SolutionTest.kt                           | 26 +++++++----
 .../SolutionTest.kt                           |  4 +-
 .../s1314_matrix_block_sum/SolutionTest.kt    |  4 +-
 .../SolutionTest.kt                           | 24 ++++++----
 .../s1321_restaurant_growth/MysqlTest.kt      | 10 ++--
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  6 +--
 .../MysqlTest.kt                              | 10 ++--
 .../SolutionTest.kt                           | 15 ++++--
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           | 27 +++++++----
 .../SolutionTest.kt                           |  8 +++-
 .../SolutionTest.kt                           | 13 ++++--
 .../SolutionTest.kt                           |  2 +-
 .../s1340_jump_game_v/SolutionTest.kt         |  2 +-
 .../s1341_movie_rating/MysqlTest.kt           | 10 ++--
 .../SolutionTest.kt                           |  4 +-
 .../s1345_jump_game_iv/SolutionTest.kt        |  2 +-
 .../TweetCountsTest.kt                        |  6 +--
 .../SolutionTest.kt                           | 16 +++++--
 .../SolutionTest.kt                           | 10 ++--
 .../SolutionTest.kt                           | 17 ++++---
 .../SolutionTest.kt                           |  4 +-
 .../CashierTest.kt                            |  8 ++--
 .../SolutionTest.kt                           | 14 ++++--
 .../SolutionTest.kt                           |  3 +-
 .../SolutionTest.kt                           |  6 +--
 .../s1366_rank_teams_by_votes/SolutionTest.kt |  4 +-
 .../SolutionTest.kt                           | 12 ++---
 .../SolutionTest.kt                           | 25 +++++-----
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  7 ++-
 .../SolutionTest.kt                           | 24 ++++++----
 .../MysqlTest.kt                              | 10 ++--
 .../SolutionTest.kt                           | 10 ++--
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           | 21 ++++++---
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           | 22 +++++----
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           | 14 +++---
 .../s1393_capital_gainloss/MysqlTest.kt       | 10 ++--
 .../UndergroundSystemTest.kt                  |  3 +-
 .../SolutionTest.kt                           |  6 +--
 .../s1407_top_travellers/MysqlTest.kt         | 10 ++--
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  6 +--
 .../s1410_html_entity_parser/SolutionTest.kt  |  4 +-
 .../SolutionTest.kt                           | 27 +++++++----
 .../SolutionTest.kt                           | 11 +++--
 .../SolutionTest.kt                           |  5 +-
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  6 ++-
 .../s1436_destination_city/SolutionTest.kt    |  3 +-
 .../SolutionTest.kt                           |  3 +-
 .../SolutionTest.kt                           |  3 +-
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           | 37 +++++++++------
 .../SolutionTest.kt                           |  5 +-
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  5 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  7 +--
 .../SolutionTest.kt                           |  4 +-
 .../s1462_course_schedule_iv/SolutionTest.kt  |  8 ++--
 .../s1463_cherry_pickup_ii/SolutionTest.kt    | 12 ++---
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           |  2 +-
 .../s1470_shuffle_the_array/SolutionTest.kt   |  7 +--
 .../SolutionTest.kt                           |  6 +--
 .../s1473_paint_house_iii/SolutionTest.kt     | 16 +++----
 .../SolutionTest.kt                           |  6 +--
 .../SubrectangleQueriesTest.kt                |  4 +-
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  2 +-
 .../TreeAncestorTest.kt                       |  4 +-
 .../MysqlTest.kt                              | 12 ++---
 .../SolutionTest.kt                           | 18 +++++---
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           | 11 +++--
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  3 +-
 .../s1494_parallel_courses_ii/SolutionTest.kt |  6 +--
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           |  5 +-
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           | 18 +++++---
 .../SolutionTest.kt                           |  8 ++--
 .../MysqlTest.kt                              | 10 ++--
 .../SolutionTest.kt                           | 12 ++---
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  2 +-
 .../MysqlTest.kt                              | 10 ++--
 .../s1528_shuffle_string/SolutionTest.kt      |  2 +-
 .../SolutionTest.kt                           |  2 +-
 .../s1534_count_good_triplets/SolutionTest.kt |  5 +-
 .../SolutionTest.kt                           | 10 ++--
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  3 +-
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           | 12 ++---
 .../SolutionTest.kt                           | 18 ++++----
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           |  2 +-
 .../s1572_matrix_diagonal_sum/SolutionTest.kt |  8 ++--
 .../SolutionTest.kt                           |  5 +-
 .../SolutionTest.kt                           |  5 +-
 .../SolutionTest.kt                           | 13 +++---
 .../MysqlTest.kt                              | 10 ++--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           | 16 ++++---
 .../SolutionTest.kt                           |  8 ++--
 .../MysqlTest.kt                              | 10 ++--
 .../SolutionTest.kt                           |  4 +-
 .../s1591_strange_printer_ii/SolutionTest.kt  | 14 +++---
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           | 14 +++---
 .../s1598_crawler_log_folder/SolutionTest.kt  |  6 +--
 .../SolutionTest.kt                           |  2 +-
 .../ThroneInheritanceTest.kt                  | 14 ++++--
 .../SolutionTest.kt                           | 12 ++---
 .../SolutionTest.kt                           | 40 ++++++++++++----
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           | 16 +++----
 .../SolutionTest.kt                           | 16 +++----
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           | 18 ++++----
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           | 10 ++--
 .../s1629_slowest_key/SolutionTest.kt         |  3 +-
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           | 10 ++--
 .../SolutionTest.kt                           | 14 +++---
 .../MysqlTest.kt                              | 10 ++--
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           | 12 ++---
 .../SolutionTest.kt                           |  3 +-
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  2 +-
 .../s1652_defuse_the_bomb/SolutionTest.kt     |  7 +--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  7 +--
 .../MysqlTest.kt                              | 10 ++--
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           | 23 ++++++----
 .../s1667_fix_names_in_a_table/MysqlTest.kt   | 10 ++--
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../s1683_invalid_tweets/MysqlTest.kt         | 10 ++--
 .../SolutionTest.kt                           | 15 +++---
 .../SolutionTest.kt                           |  4 +-
 .../s1686_stone_game_vi/SolutionTest.kt       |  3 +-
 .../SolutionTest.kt                           | 31 +++++++++----
 .../s1690_stone_game_vii/SolutionTest.kt      |  3 +-
 .../SolutionTest.kt                           | 15 +++---
 .../MysqlTest.kt                              | 10 ++--
 .../SolutionTest.kt                           |  2 +-
 .../s1696_jump_game_vi/SolutionTest.kt        |  3 +-
 .../SolutionTest.kt                           | 20 ++++----
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           | 12 +++--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           | 22 +++++----
 .../SolutionTest.kt                           |  9 ++--
 .../SolutionTest.kt                           | 19 ++++----
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  5 +-
 .../SolutionTest.kt                           | 17 ++++---
 .../s1720_decode_xored_array/SolutionTest.kt  |  2 +-
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           | 17 ++++---
 .../SolutionTest.kt                           | 16 ++++---
 .../SolutionTest.kt                           |  2 +-
 .../s1728_cat_and_mouse_ii/SolutionTest.kt    |  2 +-
 .../s1729_find_followers_count/MysqlTest.kt   | 10 ++--
 .../MysqlTest.kt                              | 10 ++--
 .../SolutionTest.kt                           | 24 ++++++----
 .../SolutionTest.kt                           |  3 +-
 .../SolutionTest.kt                           | 13 ++++--
 .../MysqlTest.kt                              | 10 ++--
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           | 19 ++++----
 .../SolutionTest.kt                           | 16 ++++---
 .../MysqlTest.kt                              | 10 ++--
 .../SolutionTest.kt                           | 27 +++++++----
 .../SolutionTest.kt                           | 10 ++--
 .../s1765_map_of_highest_peak/SolutionTest.kt |  4 +-
 .../s1766_tree_of_coprimes/SolutionTest.kt    | 13 ++++--
 .../SolutionTest.kt                           |  5 +-
 .../SolutionTest.kt                           | 13 +++---
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  4 +-
 .../s1776_car_fleet_ii/SolutionTest.kt        | 18 +++++---
 .../SolutionTest.kt                           | 14 ++++--
 .../SolutionTest.kt                           | 26 +++++++----
 .../SolutionTest.kt                           | 29 ++++++++----
 .../MysqlTest.kt                              | 10 ++--
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           | 17 ++++---
 .../MysqlTest.kt                              | 10 ++--
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           | 12 ++---
 .../SolutionTest.kt                           | 16 ++++---
 .../SolutionTest.kt                           |  5 +-
 .../SolutionTest.kt                           |  3 +-
 .../s1816_truncate_sentence/SolutionTest.kt   |  6 +--
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           | 10 ++--
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  2 +-
 .../s1834_single_threaded_cpu/SolutionTest.kt |  8 ++--
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  6 +--
 .../s1847_closest_room/SolutionTest.kt        | 10 ++--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  7 +--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../s1861_rotating_the_box/SolutionTest.kt    | 18 ++++----
 .../SolutionTest.kt                           |  2 +-
 .../s1872_stone_game_viii/SolutionTest.kt     |  2 +-
 .../MysqlTest.kt                              | 10 ++--
 .../SolutionTest.kt                           | 12 ++---
 .../SolutionTest.kt                           |  3 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           |  8 ++--
 .../MysqlTest.kt                              | 10 ++--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           | 12 ++---
 .../SolutionTest.kt                           |  4 +-
 .../s1905_count_sub_islands/SolutionTest.kt   | 36 ++++++++++-----
 .../SolutionTest.kt                           | 12 +++--
 .../MysqlTest.kt                              | 10 ++--
 .../MovieRentingSystemTest.kt                 | 12 +++--
 .../SolutionTest.kt                           |  3 +-
 .../SolutionTest.kt                           | 20 ++++----
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  7 +--
 .../SolutionTest.kt                           | 16 ++++---
 .../SolutionTest.kt                           | 39 ++++++++++------
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           | 15 +++---
 .../s1934_confirmation_rate/MysqlTest.kt      | 10 ++--
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           | 11 +++--
 .../SolutionTest.kt                           |  6 ++-
 .../SolutionTest.kt                           | 22 +++++----
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           | 19 ++++----
 .../SolutionTest.kt                           | 36 +++++++++------
 .../SolutionTest.kt                           |  3 +-
 .../SolutionTest.kt                           | 12 ++---
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           | 10 ++--
 .../SolutionTest.kt                           |  6 +--
 .../MysqlTest.kt                              | 10 ++--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           | 10 ++--
 .../SolutionTest.kt                           | 14 +++---
 .../SolutionTest.kt                           |  6 +--
 .../s1975_maximum_matrix_sum/SolutionTest.kt  |  4 +-
 .../SolutionTest.kt                           |  6 +--
 .../MysqlTest.kt                              | 10 ++--
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           |  7 +--
 .../SolutionTest.kt                           | 10 ++--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  9 ++--
 .../SolutionTest.kt                           |  6 +--
 .../s2017_grid_game/SolutionTest.kt           |  6 +--
 .../SolutionTest.kt                           | 12 ++---
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  7 +--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  7 +--
 .../s2032_two_out_of_three/SolutionTest.kt    |  6 +--
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           | 11 +++--
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           | 12 ++---
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  7 +--
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  8 ++--
 .../s2079_watering_plants/SolutionTest.kt     |  2 +-
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           | 11 +++--
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  5 +-
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           | 10 ++--
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           | 12 +++--
 .../SolutionTest.kt                           | 10 ++--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           | 14 +++---
 .../SolutionTest.kt                           | 14 +++---
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  3 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  2 +-
 .../s2132_stamping_the_grid/SolutionTest.kt   | 33 +++++++------
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           | 14 +++---
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  5 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../s2157_groups_of_strings/SolutionTest.kt   |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  5 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           | 12 ++---
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           | 11 +++--
 .../SolutionTest.kt                           |  8 ++--
 .../EncrypterTest.kt                          | 14 ++++--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           | 22 ++++-----
 .../SolutionTest.kt                           |  3 +-
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  3 +-
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  3 +-
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           | 10 ++--
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  9 ++--
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           |  7 +--
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           | 11 +++--
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           | 12 ++---
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           | 13 +++---
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           | 12 ++---
 .../SolutionTest.kt                           |  4 +-
 .../s2306_naming_a_company/SolutionTest.kt    |  2 +-
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           | 14 +++---
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           |  8 ++--
 .../s2325_decode_the_message/SolutionTest.kt  |  9 ++--
 .../s2326_spiral_matrix_iv/SolutionTest.kt    |  9 ++--
 .../SolutionTest.kt                           | 36 +++++++--------
 .../SolutionTest.kt                           | 12 ++---
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           | 11 +++--
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  4 +-
 .../s2347_best_poker_hand/SolutionTest.kt     |  8 ++--
 .../SolutionTest.kt                           |  3 +-
 .../SolutionTest.kt                           |  5 +-
 .../SolutionTest.kt                           |  8 ++--
 .../FoodRatingsTest.kt                        |  9 +++-
 .../MysqlTest.kt                              | 10 ++--
 .../s2363_merge_similar_items/SolutionTest.kt | 28 +++++------
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           | 12 ++---
 .../SolutionTest.kt                           | 12 ++---
 .../s2381_shifting_letters_ii/SolutionTest.kt |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           | 10 ++--
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           | 12 ++---
 .../s2402_meeting_rooms_iii/SolutionTest.kt   |  6 +--
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           |  5 +-
 .../SolutionTest.kt                           | 15 ++++--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  2 +-
 .../s2418_sort_the_people/SolutionTest.kt     |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  7 +--
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  5 +-
 .../SolutionTest.kt                           | 10 ++--
 .../SolutionTest.kt                           | 13 +++---
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  7 +--
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           | 14 +++---
 .../SolutionTest.kt                           | 15 +++---
 .../SolutionTest.kt                           | 12 ++---
 .../SolutionTest.kt                           | 20 ++++----
 .../SolutionTest.kt                           |  4 +-
 .../s2490_circular_sentence/SolutionTest.kt   |  2 +-
 .../SolutionTest.kt                           | 12 ++---
 .../SolutionTest.kt                           | 12 ++---
 .../SolutionTest.kt                           |  5 +-
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  3 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           | 36 +++++++--------
 .../SolutionTest.kt                           |  5 +-
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           | 14 +++---
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           | 12 ++---
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../s2551_put_marbles_in_bags/SolutionTest.kt |  4 +-
 .../SolutionTest.kt                           | 15 +++---
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           | 16 ++++---
 .../s2560_house_robber_iv/SolutionTest.kt     |  4 +-
 .../s2561_rearranging_fruits/SolutionTest.kt  |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           | 12 +++--
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           | 30 +++++++-----
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           | 12 +++--
 .../SolutionTest.kt                           | 18 +++++---
 .../SolutionTest.kt                           | 12 ++---
 .../SolutionTest.kt                           | 27 ++++++-----
 .../SolutionTest.kt                           | 18 ++++----
 .../SolutionTest.kt                           | 17 ++++---
 .../SolutionTest.kt                           | 22 +++++----
 .../SolutionTest.kt                           | 13 ++++--
 .../SolutionTest.kt                           |  7 +--
 .../s2611_mice_and_cheese/SolutionTest.kt     |  8 ++--
 .../SolutionTest.kt                           | 12 ++---
 .../s2614_prime_in_diagonal/SolutionTest.kt   | 12 ++---
 .../s2615_sum_of_distances/SolutionTest.kt    |  2 +-
 .../SolutionTest.kt                           | 14 +++---
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           |  8 ++--
 .../GraphTest.kt                              |  8 ++--
 .../SolutionTest.kt                           | 12 ++---
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           | 21 +++++----
 .../SolutionTest.kt                           |  6 +--
 .../s2652_sum_multiples/SolutionTest.kt       |  6 +--
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           | 20 ++++----
 .../s2659_make_array_empty/SolutionTest.kt    |  6 +--
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  9 ++--
 .../SolutionTest.kt                           | 17 ++++---
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           | 13 ++++--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../s2679_sum_in_a_matrix/SolutionTest.kt     | 12 +++--
 .../s2680_maximum_or/SolutionTest.kt          |  4 +-
 .../s2681_power_of_heroes/SolutionTest.kt     |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           | 12 +++--
 .../SolutionTest.kt                           | 18 +++++---
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           | 29 ++++++++----
 .../s2706_buy_two_chocolates/SolutionTest.kt  |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  9 ++--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           | 21 +++++----
 .../s2719_count_of_integers/SolutionTest.kt   |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           | 13 +++---
 .../s2736_maximum_sum_queries/SolutionTest.kt | 27 ++++++-----
 .../SolutionTest.kt                           | 23 ++++++----
 .../s2751_robot_collisions/SolutionTest.kt    | 23 +++++-----
 .../s2766_relocate_marbles/SolutionTest.kt    | 14 +++---
 .../SolutionTest.kt                           | 12 +++--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           | 10 ++--
 .../SolutionTest.kt                           | 10 ++--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           | 16 +++----
 .../SolutionTest.kt                           | 10 ++--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  3 +-
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  5 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           | 16 +++----
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           | 12 ++---
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           | 12 ++---
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           | 14 +++---
 .../SolutionTest.kt                           |  4 +-
 .../s2865_beautiful_towers_i/SolutionTest.kt  |  8 ++--
 .../s2866_beautiful_towers_ii/SolutionTest.kt |  8 ++--
 .../SolutionTest.kt                           | 12 ++---
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           | 12 ++---
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           | 10 ++--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           | 12 +++--
 .../SolutionTest.kt                           | 12 +++--
 .../SolutionTest.kt                           |  5 +-
 .../SolutionTest.kt                           |  5 +-
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  5 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  5 +-
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  3 +-
 .../SolutionTest.kt                           | 12 ++---
 .../s2923_find_champion_i/SolutionTest.kt     | 18 ++++----
 .../s2924_find_champion_ii/SolutionTest.kt    |  4 +-
 .../SolutionTest.kt                           | 12 ++---
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           | 12 ++---
 .../SolutionTest.kt                           | 18 ++++----
 .../SolutionTest.kt                           |  7 +--
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           | 12 ++---
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  3 +-
 .../SolutionTest.kt                           |  7 +--
 .../SolutionTest.kt                           |  7 +--
 .../SolutionTest.kt                           | 12 ++---
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  3 +-
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           | 18 ++++----
 .../s2974_minimum_number_game/SolutionTest.kt |  3 +-
 .../SolutionTest.kt                           |  5 +-
 .../SolutionTest.kt                           | 12 ++---
 .../SolutionTest.kt                           | 12 ++---
 .../SolutionTest.kt                           | 21 +++++----
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  9 ++--
 .../SolutionTest.kt                           |  7 ++-
 .../SolutionTest.kt                           |  5 +-
 .../SolutionTest.kt                           | 18 ++++----
 .../SolutionTest.kt                           |  7 +--
 .../SolutionTest.kt                           | 18 ++++----
 .../SolutionTest.kt                           | 30 ++++++------
 .../s3033_modify_the_matrix/SolutionTest.kt   | 12 ++---
 .../SolutionTest.kt                           |  7 +--
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  7 +--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../s3044_most_frequent_prime/SolutionTest.kt |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../s3046_split_the_array/SolutionTest.kt     |  2 +-
 .../SolutionTest.kt                           | 24 +++++-----
 .../SolutionTest.kt                           | 12 +++--
 .../SolutionTest.kt                           | 12 +++--
 .../SolutionTest.kt                           | 12 ++---
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           | 12 ++---
 .../SolutionTest.kt                           | 12 ++---
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           |  2 +-
 .../s3092_most_frequent_ids/SolutionTest.kt   |  4 +-
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           | 12 ++---
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           | 14 +++---
 .../SolutionTest.kt                           | 10 ++--
 .../SolutionTest.kt                           |  7 +--
 .../SolutionTest.kt                           |  6 ++-
 .../SolutionTest.kt                           | 10 ++--
 .../SolutionTest.kt                           | 12 ++---
 .../s3128_right_triangles/SolutionTest.kt     |  8 ++--
 .../SolutionTest.kt                           |  5 +-
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  3 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           | 10 ++--
 .../SolutionTest.kt                           |  6 ++-
 .../s3152_special_array_ii/SolutionTest.kt    |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           | 10 ++--
 .../SolutionTest.kt                           | 18 ++++----
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  3 +-
 .../SolutionTest.kt                           |  3 +-
 .../SolutionTest.kt                           |  2 +-
 .../s3187_peaks_in_array/SolutionTest.kt      |  9 ++--
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           |  3 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           | 13 +++---
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  7 +--
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           | 10 ++--
 .../SolutionTest.kt                           | 12 ++---
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  2 +-
 .../MysqlTest.kt                              | 16 +++----
 .../SolutionTest.kt                           | 12 ++---
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           | 14 +++---
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  9 ++--
 .../s3248_snake_in_matrix/SolutionTest.kt     |  3 +-
 .../SolutionTest.kt                           | 12 ++---
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           |  5 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           |  5 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           | 10 ++--
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           | 26 ++++++-----
 .../SolutionTest.kt                           | 22 ++++-----
 .../SolutionTest.kt                           |  7 +--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  6 +--
 .../s3295_report_spam_message/SolutionTest.kt |  8 ++--
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           | 18 ++++----
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           | 16 ++++---
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  8 ++--
 .../SolutionTest.kt                           |  2 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           | 24 +++++-----
 .../SolutionTest.kt                           | 18 ++++----
 .../SolutionTest.kt                           | 14 +++---
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  4 +-
 .../SolutionTest.kt                           |  7 +--
 .../SolutionTest.kt                           | 10 ++--
 .../SolutionTest.kt                           |  6 +--
 .../SolutionTest.kt                           |  6 +--
 1739 files changed, 6742 insertions(+), 5410 deletions(-)

diff --git a/build.gradle.kts b/build.gradle.kts
index 6e97cdbac..9c21f0cc6 100644
--- a/build.gradle.kts
+++ b/build.gradle.kts
@@ -2,7 +2,7 @@ plugins {
     kotlin("jvm") version "2.0.21"
     jacoco
     id("org.sonarqube") version "5.1.0.4882"
-    id("com.diffplug.spotless") version "6.12.0"
+    id("com.diffplug.spotless") version "6.21.0"
     `maven-publish`
 }
 
@@ -52,9 +52,14 @@ spotless {
     kotlin {
         encoding("UTF-8")
         target("**/src/**/*.kt")
-        ktlint("0.43.0").userData(mapOf(
-                "max_line_length" to "120"
-                ))
+        ktlint("0.50.0").editorConfigOverride(
+            mapOf(
+                "max_line_length" to "120",
+                "indent_size" to "4",
+                "ktlint_standard_package-name" to "disabled",
+                "ktlint_standard_comment-wrapping" to "disabled"
+            )
+        )
         toggleOffOn()
         trimTrailingWhitespace()
         endWithNewline()
diff --git a/pom-central.xml b/pom-central.xml
index 0487c8cbe..6a5fdc619 100644
--- a/pom-central.xml
+++ b/pom-central.xml
@@ -109,7 +109,7 @@
             <plugin>
                 <groupId>org.jetbrains.dokka</groupId>
                 <artifactId>dokka-maven-plugin</artifactId>
-                <version>1.9.20</version>
+                <version>2.0.0-Beta</version>
                 <executions>
                     <execution>
                         <phase>prepare-package</phase>
diff --git a/src/main/kotlin/com_github_leetcode/Employee.kt b/src/main/kotlin/com_github_leetcode/Employee.kt
index 9ca82053d..78f7d309e 100644
--- a/src/main/kotlin/com_github_leetcode/Employee.kt
+++ b/src/main/kotlin/com_github_leetcode/Employee.kt
@@ -6,5 +6,5 @@ class Employee(
     /** the importance value of this employee  */
     var importance: Int,
     /** the id of direct subordinates  */
-    var subordinates: List<Int> = listOf()
+    var subordinates: List<Int> = listOf(),
 )
diff --git a/src/main/kotlin/g0001_0100/s0005_longest_palindromic_substring/Solution.kt b/src/main/kotlin/g0001_0100/s0005_longest_palindromic_substring/Solution.kt
index 9c47dfcc3..40fee3c2b 100644
--- a/src/main/kotlin/g0001_0100/s0005_longest_palindromic_substring/Solution.kt
+++ b/src/main/kotlin/g0001_0100/s0005_longest_palindromic_substring/Solution.kt
@@ -19,10 +19,14 @@ class Solution {
         var lpsCenter = 0
         var lpsRadius = 0
         for (i in newStr.indices) {
-            dp[i] = if (friendCenter + friendRadius > i) Math.min(
-                dp[friendCenter * 2 - i],
-                friendCenter + friendRadius - i
-            ) else 1
+            dp[i] = if (friendCenter + friendRadius > i) {
+                Math.min(
+                    dp[friendCenter * 2 - i],
+                    friendCenter + friendRadius - i,
+                )
+            } else {
+                1
+            }
             while (i + dp[i] < newStr.size && i - dp[i] >= 0 && newStr[i + dp[i]] == newStr[i - dp[i]]) {
                 dp[i]++
             }
diff --git a/src/main/kotlin/g0001_0100/s0010_regular_expression_matching/Solution.kt b/src/main/kotlin/g0001_0100/s0010_regular_expression_matching/Solution.kt
index cb7a3edf1..549989034 100644
--- a/src/main/kotlin/g0001_0100/s0010_regular_expression_matching/Solution.kt
+++ b/src/main/kotlin/g0001_0100/s0010_regular_expression_matching/Solution.kt
@@ -31,7 +31,7 @@ class Solution {
                     i,
                     j - 2,
                     s,
-                    p
+                    p,
                 )
             }
         } else {
diff --git a/src/main/kotlin/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.kt b/src/main/kotlin/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.kt
index 6b03ea3f9..b9532e2bf 100644
--- a/src/main/kotlin/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.kt
+++ b/src/main/kotlin/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.kt
@@ -19,7 +19,7 @@ class Solution {
         nums: String,
         letters: Array<String>,
         curr: StringBuilder,
-        ans: MutableList<String>
+        ans: MutableList<String>,
     ) {
         if (curr.length == nums.length) {
             ans.add(curr.toString())
diff --git a/src/main/kotlin/g0001_0100/s0023_merge_k_sorted_lists/Solution.kt b/src/main/kotlin/g0001_0100/s0023_merge_k_sorted_lists/Solution.kt
index caf5dcfa3..933185af3 100644
--- a/src/main/kotlin/g0001_0100/s0023_merge_k_sorted_lists/Solution.kt
+++ b/src/main/kotlin/g0001_0100/s0023_merge_k_sorted_lists/Solution.kt
@@ -19,7 +19,9 @@ class Solution {
     fun mergeKLists(lists: Array<ListNode>): ListNode? {
         return if (lists.isEmpty()) {
             null
-        } else mergeKLists(lists, 0, lists.size)
+        } else {
+            mergeKLists(lists, 0, lists.size)
+        }
     }
 
     private fun mergeKLists(lists: Array<ListNode>, leftIndex: Int, rightIndex: Int): ListNode? {
diff --git a/src/main/kotlin/g0001_0100/s0030_substring_with_concatenation_of_all_words/Solution.kt b/src/main/kotlin/g0001_0100/s0030_substring_with_concatenation_of_all_words/Solution.kt
index c1eb72cfd..28549689d 100644
--- a/src/main/kotlin/g0001_0100/s0030_substring_with_concatenation_of_all_words/Solution.kt
+++ b/src/main/kotlin/g0001_0100/s0030_substring_with_concatenation_of_all_words/Solution.kt
@@ -20,7 +20,6 @@ class Solution {
             // move a word's length each time
             var j = i
             while (j + window <= s.length) {
-
                 // get the subStr
                 val subStr = s.substring(j, j + window)
                 val map: MutableMap<String, Int> = HashMap()
diff --git a/src/main/kotlin/g0001_0100/s0040_combination_sum_ii/Solution.kt b/src/main/kotlin/g0001_0100/s0040_combination_sum_ii/Solution.kt
index 9372d68bd..0c80480b9 100644
--- a/src/main/kotlin/g0001_0100/s0040_combination_sum_ii/Solution.kt
+++ b/src/main/kotlin/g0001_0100/s0040_combination_sum_ii/Solution.kt
@@ -19,7 +19,7 @@ class Solution {
         target: Int,
         start: Int,
         sums: MutableList<List<Int>>,
-        sum: LinkedList<Int>
+        sum: LinkedList<Int>,
     ) {
         if (target == 0) {
             // make a deep copy of the current combination
@@ -28,7 +28,6 @@ class Solution {
         }
         var i = start
         while (i < candidates.size && target >= candidates[i]) {
-
             // If candidate[i] equals candidate[i-1], then solutions for i is subset of
             // solution of i-1
             if (i == start || i > start && candidates[i] != candidates[i - 1]) {
diff --git a/src/main/kotlin/g0001_0100/s0046_permutations/Solution.kt b/src/main/kotlin/g0001_0100/s0046_permutations/Solution.kt
index 77eb4849a..129b871ce 100644
--- a/src/main/kotlin/g0001_0100/s0046_permutations/Solution.kt
+++ b/src/main/kotlin/g0001_0100/s0046_permutations/Solution.kt
@@ -19,7 +19,7 @@ class Solution {
         nums: IntArray,
         finalResult: MutableList<List<Int>>,
         currResult: MutableList<Int>,
-        used: BooleanArray
+        used: BooleanArray,
     ) {
         if (currResult.size == nums.size) {
             finalResult.add(ArrayList(currResult))
diff --git a/src/main/kotlin/g0001_0100/s0048_rotate_image/Solution.kt b/src/main/kotlin/g0001_0100/s0048_rotate_image/Solution.kt
index a6b742f8f..e54b21e6b 100644
--- a/src/main/kotlin/g0001_0100/s0048_rotate_image/Solution.kt
+++ b/src/main/kotlin/g0001_0100/s0048_rotate_image/Solution.kt
@@ -13,7 +13,7 @@ class Solution {
                     intArrayOf(i, j),
                     intArrayOf(j, n - 1 - i),
                     intArrayOf(n - 1 - i, n - 1 - j),
-                    intArrayOf(n - 1 - j, i)
+                    intArrayOf(n - 1 - j, i),
                 )
                 var t = matrix[pos[0][0]][pos[0][1]]
                 for (k in 1 until pos.size) {
diff --git a/src/main/kotlin/g0001_0100/s0049_group_anagrams/Solution.kt b/src/main/kotlin/g0001_0100/s0049_group_anagrams/Solution.kt
index dbd11500a..f03be4e89 100644
--- a/src/main/kotlin/g0001_0100/s0049_group_anagrams/Solution.kt
+++ b/src/main/kotlin/g0001_0100/s0049_group_anagrams/Solution.kt
@@ -12,7 +12,7 @@ class Solution {
             ch.sort()
             val temp = String(ch)
             hm.computeIfAbsent(
-                temp
+                temp,
             ) { _: String? -> ArrayList() }
             hm.getValue(temp).add(s)
         }
diff --git a/src/main/kotlin/g0001_0100/s0050_powx_n/Solution.kt b/src/main/kotlin/g0001_0100/s0050_powx_n/Solution.kt
index 02eab3734..75121bcfd 100644
--- a/src/main/kotlin/g0001_0100/s0050_powx_n/Solution.kt
+++ b/src/main/kotlin/g0001_0100/s0050_powx_n/Solution.kt
@@ -23,6 +23,8 @@ class Solution {
         }
         return if (n < 0) {
             1.0 / res
-        } else res
+        } else {
+            res
+        }
     }
 }
diff --git a/src/main/kotlin/g0001_0100/s0052_n_queens_ii/Solution.kt b/src/main/kotlin/g0001_0100/s0052_n_queens_ii/Solution.kt
index fef743484..9ce21317d 100644
--- a/src/main/kotlin/g0001_0100/s0052_n_queens_ii/Solution.kt
+++ b/src/main/kotlin/g0001_0100/s0052_n_queens_ii/Solution.kt
@@ -17,7 +17,7 @@ class Solution {
         row: BooleanArray,
         col: BooleanArray,
         diagonal: BooleanArray,
-        antiDiagonal: BooleanArray
+        antiDiagonal: BooleanArray,
     ): Int {
         if (r == n) {
             return 1
diff --git a/src/main/kotlin/g0001_0100/s0079_word_search/Solution.kt b/src/main/kotlin/g0001_0100/s0079_word_search/Solution.kt
index 308aceb01..3bed9ef04 100644
--- a/src/main/kotlin/g0001_0100/s0079_word_search/Solution.kt
+++ b/src/main/kotlin/g0001_0100/s0079_word_search/Solution.kt
@@ -11,7 +11,7 @@ class Solution {
         word: String,
         index: Int,
         x: Int,
-        y: Int
+        y: Int,
     ): Boolean {
         if (index == word.length) {
             return true
@@ -40,7 +40,7 @@ class Solution {
     fun exist(board: Array<CharArray>, word: String): Boolean {
         val visited = Array(board.size) {
             BooleanArray(
-                board[0].size
+                board[0].size,
             )
         }
         for (i in board.indices) {
diff --git a/src/main/kotlin/g0001_0100/s0084_largest_rectangle_in_histogram/Solution.kt b/src/main/kotlin/g0001_0100/s0084_largest_rectangle_in_histogram/Solution.kt
index c3cbcbf52..f30e5539c 100644
--- a/src/main/kotlin/g0001_0100/s0084_largest_rectangle_in_histogram/Solution.kt
+++ b/src/main/kotlin/g0001_0100/s0084_largest_rectangle_in_histogram/Solution.kt
@@ -38,7 +38,7 @@ class Solution {
             maxOfThreeNums(
                 largestArea(a, start, minInd),
                 a[minInd] * (limit - start),
-                largestArea(a, minInd + 1, limit)
+                largestArea(a, minInd + 1, limit),
             )
         }
     }
diff --git a/src/main/kotlin/g0001_0100/s0093_restore_ip_addresses/Solution.kt b/src/main/kotlin/g0001_0100/s0093_restore_ip_addresses/Solution.kt
index 37745a7e4..c7f7ea1d3 100644
--- a/src/main/kotlin/g0001_0100/s0093_restore_ip_addresses/Solution.kt
+++ b/src/main/kotlin/g0001_0100/s0093_restore_ip_addresses/Solution.kt
@@ -17,7 +17,7 @@ class Solution {
                     '.' +
                     octets[2] +
                     '.' +
-                    octets[3]
+                    octets[3],
             )
         } else if (count < 4 && pos < 12) {
             var octet = 0
diff --git a/src/main/kotlin/g0001_0100/s0097_interleaving_string/Solution.kt b/src/main/kotlin/g0001_0100/s0097_interleaving_string/Solution.kt
index 2aa3e1793..43bc40285 100644
--- a/src/main/kotlin/g0001_0100/s0097_interleaving_string/Solution.kt
+++ b/src/main/kotlin/g0001_0100/s0097_interleaving_string/Solution.kt
@@ -18,7 +18,7 @@ class Solution {
         i1: Int,
         i2: Int,
         i3: Int,
-        cache: Array<Array<Boolean?>>
+        cache: Array<Array<Boolean?>>,
     ): Boolean {
         if (cache[i1][i2] != null) {
             return cache[i1][i2]!!
diff --git a/src/main/kotlin/g0001_0100/s0098_validate_binary_search_tree/Solution.kt b/src/main/kotlin/g0001_0100/s0098_validate_binary_search_tree/Solution.kt
index 4c46a1dbc..2032bd889 100644
--- a/src/main/kotlin/g0001_0100/s0098_validate_binary_search_tree/Solution.kt
+++ b/src/main/kotlin/g0001_0100/s0098_validate_binary_search_tree/Solution.kt
@@ -30,6 +30,8 @@ class Solution {
         }
         return if (root.`val` <= left || root.`val` >= right) {
             false
-        } else solve(root.left, left, root.`val`.toLong()) && solve(root.right, root.`val`.toLong(), right)
+        } else {
+            solve(root.left, left, root.`val`.toLong()) && solve(root.right, root.`val`.toLong(), right)
+        }
     }
 }
diff --git a/src/main/kotlin/g0001_0100/s0100_same_tree/Solution.kt b/src/main/kotlin/g0001_0100/s0100_same_tree/Solution.kt
index 86b9286eb..17c0a1060 100644
--- a/src/main/kotlin/g0001_0100/s0100_same_tree/Solution.kt
+++ b/src/main/kotlin/g0001_0100/s0100_same_tree/Solution.kt
@@ -20,7 +20,9 @@ class Solution {
         return if (n != null && m != null) {
             if (n.`val` != m.`val`) {
                 false
-            } else trav(n.left, m.left) && trav(n.right, m.right)
+            } else {
+                trav(n.left, m.left) && trav(n.right, m.right)
+            }
         } else {
             n == null && m == null
         }
diff --git a/src/main/kotlin/g0101_0200/s0101_symmetric_tree/Solution.kt b/src/main/kotlin/g0101_0200/s0101_symmetric_tree/Solution.kt
index 5995a83c8..f5bacc07c 100644
--- a/src/main/kotlin/g0101_0200/s0101_symmetric_tree/Solution.kt
+++ b/src/main/kotlin/g0101_0200/s0101_symmetric_tree/Solution.kt
@@ -20,7 +20,9 @@ class Solution {
     fun isSymmetric(root: TreeNode?): Boolean {
         return if (root == null) {
             true
-        } else helper(root.left, root.right)
+        } else {
+            helper(root.left, root.right)
+        }
     }
 
     private fun helper(leftNode: TreeNode?, rightNode: TreeNode?): Boolean {
@@ -29,6 +31,8 @@ class Solution {
         }
         return if (leftNode.`val` != rightNode.`val`) {
             false
-        } else helper(leftNode.left, rightNode.right) && helper(leftNode.right, rightNode.left)
+        } else {
+            helper(leftNode.left, rightNode.right) && helper(leftNode.right, rightNode.left)
+        }
     }
 }
diff --git a/src/main/kotlin/g0101_0200/s0112_path_sum/Solution.kt b/src/main/kotlin/g0101_0200/s0112_path_sum/Solution.kt
index d251ff661..fdcf5a9f2 100644
--- a/src/main/kotlin/g0101_0200/s0112_path_sum/Solution.kt
+++ b/src/main/kotlin/g0101_0200/s0112_path_sum/Solution.kt
@@ -22,6 +22,8 @@ class Solution {
         }
         return if (targetSum == root.`val` && root.left == null && root.right == null) {
             true
-        } else hasPathSum(root.left, targetSum - root.`val`) || hasPathSum(root.right, targetSum - root.`val`)
+        } else {
+            hasPathSum(root.left, targetSum - root.`val`) || hasPathSum(root.right, targetSum - root.`val`)
+        }
     }
 }
diff --git a/src/main/kotlin/g0101_0200/s0113_path_sum_ii/Solution.kt b/src/main/kotlin/g0101_0200/s0113_path_sum_ii/Solution.kt
index 4532d4188..99aac2986 100644
--- a/src/main/kotlin/g0101_0200/s0113_path_sum_ii/Solution.kt
+++ b/src/main/kotlin/g0101_0200/s0113_path_sum_ii/Solution.kt
@@ -31,7 +31,7 @@ class Solution {
         al: ArrayList<Int>,
         sum: Int,
         targetSum: Int,
-        root: TreeNode?
+        root: TreeNode?,
     ) {
         var sum = sum
         if (root == null) {
diff --git a/src/main/kotlin/g0101_0200/s0120_triangle/Solution.kt b/src/main/kotlin/g0101_0200/s0120_triangle/Solution.kt
index a0bbd0467..05248ad7e 100644
--- a/src/main/kotlin/g0101_0200/s0120_triangle/Solution.kt
+++ b/src/main/kotlin/g0101_0200/s0120_triangle/Solution.kt
@@ -27,7 +27,7 @@ class Solution {
             triangle[row][col] +
                 Math.min(
                     dfs(triangle, dp, row + 1, col),
-                    dfs(triangle, dp, row + 1, col + 1)
+                    dfs(triangle, dp, row + 1, col + 1),
                 )
             )
         dp[row][col] = sum
diff --git a/src/main/kotlin/g0101_0200/s0123_best_time_to_buy_and_sell_stock_iii/Solution.kt b/src/main/kotlin/g0101_0200/s0123_best_time_to_buy_and_sell_stock_iii/Solution.kt
index b55ff744e..a69080c91 100644
--- a/src/main/kotlin/g0101_0200/s0123_best_time_to_buy_and_sell_stock_iii/Solution.kt
+++ b/src/main/kotlin/g0101_0200/s0123_best_time_to_buy_and_sell_stock_iii/Solution.kt
@@ -5,7 +5,7 @@ package g0101_0200.s0123_best_time_to_buy_and_sell_stock_iii
 class Solution {
     fun maxProfit(prices: IntArray): Int {
         val n = prices.size
-        if (n <2) {
+        if (n < 2) {
             return 0
         }
         val a = IntArray(n) { 0 }
diff --git a/src/main/kotlin/g0101_0200/s0126_word_ladder_ii/Solution.kt b/src/main/kotlin/g0101_0200/s0126_word_ladder_ii/Solution.kt
index eafff9f8d..0465b60c8 100644
--- a/src/main/kotlin/g0101_0200/s0126_word_ladder_ii/Solution.kt
+++ b/src/main/kotlin/g0101_0200/s0126_word_ladder_ii/Solution.kt
@@ -32,7 +32,7 @@ class Solution {
                 if (isLadder(word, next)) {
                     // construct the reverse graph from endWord
                     val reverseLadders = reverse.computeIfAbsent(
-                        next
+                        next,
                     ) { _: String? -> HashSet() }
                     reverseLadders.add(word)
                     if (endWord == next) {
@@ -71,7 +71,7 @@ class Solution {
         beginWord: String,
         graph: Map<String, MutableSet<String>>,
         ans: MutableList<List<String>>,
-        path: MutableSet<String>
+        path: MutableSet<String>,
     ) {
         val next = graph[endWord] ?: return
         for (word in next) {
diff --git a/src/main/kotlin/g0101_0200/s0128_longest_consecutive_sequence/Solution.kt b/src/main/kotlin/g0101_0200/s0128_longest_consecutive_sequence/Solution.kt
index 6d9a4edf0..61f929220 100644
--- a/src/main/kotlin/g0101_0200/s0128_longest_consecutive_sequence/Solution.kt
+++ b/src/main/kotlin/g0101_0200/s0128_longest_consecutive_sequence/Solution.kt
@@ -22,7 +22,7 @@ class Solution {
             if (num == lastNum) {
                 continue
             }
-            length ++
+            length++
             if (num - lastNum > 1) {
                 length = 1
             }
diff --git a/src/main/kotlin/g0101_0200/s0134_gas_station/Solution.kt b/src/main/kotlin/g0101_0200/s0134_gas_station/Solution.kt
index a2935e040..a8429aaaa 100644
--- a/src/main/kotlin/g0101_0200/s0134_gas_station/Solution.kt
+++ b/src/main/kotlin/g0101_0200/s0134_gas_station/Solution.kt
@@ -24,6 +24,8 @@ class Solution {
         }
         return if (sumGas < sumCost) {
             -1
-        } else result
+        } else {
+            result
+        }
     }
 }
diff --git a/src/main/kotlin/g0101_0200/s0140_word_break_ii/Solution.kt b/src/main/kotlin/g0101_0200/s0140_word_break_ii/Solution.kt
index 017683e3d..2642a273a 100644
--- a/src/main/kotlin/g0101_0200/s0140_word_break_ii/Solution.kt
+++ b/src/main/kotlin/g0101_0200/s0140_word_break_ii/Solution.kt
@@ -18,7 +18,7 @@ class Solution {
         wordSet: Set<String>,
         index: Int,
         sb: StringBuilder,
-        result: MutableList<String>
+        result: MutableList<String>,
     ) {
         if (index == s.length) {
             if (sb[sb.length - 1] == ' ') {
diff --git a/src/main/kotlin/g0101_0200/s0150_evaluate_reverse_polish_notation/Solution.kt b/src/main/kotlin/g0101_0200/s0150_evaluate_reverse_polish_notation/Solution.kt
index ced8f2045..777709b11 100644
--- a/src/main/kotlin/g0101_0200/s0150_evaluate_reverse_polish_notation/Solution.kt
+++ b/src/main/kotlin/g0101_0200/s0150_evaluate_reverse_polish_notation/Solution.kt
@@ -8,7 +8,7 @@ class Solution {
         "/" to { a, b -> a / b },
         "*" to { a, b -> a * b },
         "+" to { a, b -> a + b },
-        "-" to { a, b -> a - b }
+        "-" to { a, b -> a - b },
     )
     fun evalRPN(tokens: Array<String>): Int {
         val stack = ArrayDeque<String>()
diff --git a/src/main/kotlin/g0101_0200/s0154_find_minimum_in_rotated_sorted_array_ii/Solution.kt b/src/main/kotlin/g0101_0200/s0154_find_minimum_in_rotated_sorted_array_ii/Solution.kt
index c8b7c19e1..6def9f22a 100644
--- a/src/main/kotlin/g0101_0200/s0154_find_minimum_in_rotated_sorted_array_ii/Solution.kt
+++ b/src/main/kotlin/g0101_0200/s0154_find_minimum_in_rotated_sorted_array_ii/Solution.kt
@@ -7,7 +7,9 @@ class Solution {
     fun findMin(nums: IntArray): Int {
         return if (nums.isEmpty()) {
             0
-        } else find(0, nums.size - 1, nums)
+        } else {
+            find(0, nums.size - 1, nums)
+        }
     }
 
     private fun find(left: Int, right: Int, nums: IntArray): Int {
diff --git a/src/main/kotlin/g0101_0200/s0155_min_stack/MinStack.kt b/src/main/kotlin/g0101_0200/s0155_min_stack/MinStack.kt
index 7a04758c1..6ed23aed0 100644
--- a/src/main/kotlin/g0101_0200/s0155_min_stack/MinStack.kt
+++ b/src/main/kotlin/g0101_0200/s0155_min_stack/MinStack.kt
@@ -9,8 +9,11 @@ class MinStack() {
     private val stack: ArrayDeque<Pair<Int, Int>> = ArrayDeque()
 
     fun push(x: Int) {
-        val min: Int = if (stack.isEmpty()) x
-        else getMin()
+        val min: Int = if (stack.isEmpty()) {
+            x
+        } else {
+            getMin()
+        }
         stack.addLast(x to minOf(min, x))
     }
 
diff --git a/src/main/kotlin/g0201_0300/s0201_bitwise_and_of_numbers_range/Solution.kt b/src/main/kotlin/g0201_0300/s0201_bitwise_and_of_numbers_range/Solution.kt
index b39057084..03c7593f3 100644
--- a/src/main/kotlin/g0201_0300/s0201_bitwise_and_of_numbers_range/Solution.kt
+++ b/src/main/kotlin/g0201_0300/s0201_bitwise_and_of_numbers_range/Solution.kt
@@ -41,7 +41,7 @@ class Solution {
             -0x10,
             -0x8,
             -0x4,
-            -0x2
+            -0x2,
         )
     }
 }
diff --git a/src/main/kotlin/g0201_0300/s0210_course_schedule_ii/Solution.kt b/src/main/kotlin/g0201_0300/s0210_course_schedule_ii/Solution.kt
index 871371fa6..1daf48b76 100644
--- a/src/main/kotlin/g0201_0300/s0210_course_schedule_ii/Solution.kt
+++ b/src/main/kotlin/g0201_0300/s0210_course_schedule_ii/Solution.kt
@@ -34,7 +34,7 @@ class Solution {
     private fun buildGraph(
         numCourses: Int,
         prerequisites: Array<IntArray>,
-        indegrees: IntArray
+        indegrees: IntArray,
     ): List<List<Int>> {
         val graph = List(numCourses) { mutableListOf<Int>() }
         for ((cur, prev) in prerequisites) {
diff --git a/src/main/kotlin/g0201_0300/s0222_count_complete_tree_nodes/Solution.kt b/src/main/kotlin/g0201_0300/s0222_count_complete_tree_nodes/Solution.kt
index 399668032..4e2e9d8ea 100644
--- a/src/main/kotlin/g0201_0300/s0222_count_complete_tree_nodes/Solution.kt
+++ b/src/main/kotlin/g0201_0300/s0222_count_complete_tree_nodes/Solution.kt
@@ -30,12 +30,16 @@ class Solution {
     private fun leftHeight(root: TreeNode?): Int {
         return if (root == null) {
             0
-        } else 1 + leftHeight(root.left)
+        } else {
+            1 + leftHeight(root.left)
+        }
     }
 
     private fun rightHeight(root: TreeNode?): Int {
         return if (root == null) {
             0
-        } else 1 + rightHeight(root.right)
+        } else {
+            1 + rightHeight(root.right)
+        }
     }
 }
diff --git a/src/main/kotlin/g0201_0300/s0258_add_digits/Solution.kt b/src/main/kotlin/g0201_0300/s0258_add_digits/Solution.kt
index cdfffaf49..9ba8be40c 100644
--- a/src/main/kotlin/g0201_0300/s0258_add_digits/Solution.kt
+++ b/src/main/kotlin/g0201_0300/s0258_add_digits/Solution.kt
@@ -9,6 +9,8 @@ class Solution {
         }
         return if (num % 9 == 0) {
             9
-        } else num % 9
+        } else {
+            num % 9
+        }
     }
 }
diff --git a/src/main/kotlin/g0201_0300/s0273_integer_to_english_words/Solution.kt b/src/main/kotlin/g0201_0300/s0273_integer_to_english_words/Solution.kt
index 1c2799707..903de826f 100644
--- a/src/main/kotlin/g0201_0300/s0273_integer_to_english_words/Solution.kt
+++ b/src/main/kotlin/g0201_0300/s0273_integer_to_english_words/Solution.kt
@@ -7,7 +7,7 @@ import java.util.StringJoiner
 
 class Solution {
     private val ones = arrayOf(
-        "One ", "Two ", "Three ", "Four ", "Five ", "Six ", "Seven ", "Eight ", "Nine "
+        "One ", "Two ", "Three ", "Four ", "Five ", "Six ", "Seven ", "Eight ", "Nine ",
     )
     private val teens = arrayOf(
         "Ten ",
@@ -19,10 +19,17 @@ class Solution {
         "Sixteen ",
         "Seventeen ",
         "Eighteen ",
-        "Nineteen "
+        "Nineteen ",
     )
     private val twenties = arrayOf(
-        "Twenty ", "Thirty ", "Forty ", "Fifty ", "Sixty ", "Seventy ", "Eighty ", "Ninety "
+        "Twenty ",
+        "Thirty ",
+        "Forty ",
+        "Fifty ",
+        "Sixty ",
+        "Seventy ",
+        "Eighty ",
+        "Ninety ",
     )
 
     fun numberToWords(num: Int): String {
diff --git a/src/main/kotlin/g0201_0300/s0282_expression_add_operators/Solution.kt b/src/main/kotlin/g0201_0300/s0282_expression_add_operators/Solution.kt
index 9bf6514f8..f5c97835f 100644
--- a/src/main/kotlin/g0201_0300/s0282_expression_add_operators/Solution.kt
+++ b/src/main/kotlin/g0201_0300/s0282_expression_add_operators/Solution.kt
@@ -24,7 +24,7 @@ class Solution {
         `val`: Int,
         mul: Int,
         preOp: Char,
-        join: Int
+        join: Int,
     ) {
         var j = j
         arr[j++] = list[i]
diff --git a/src/main/kotlin/g0201_0300/s0289_game_of_life/Solution.kt b/src/main/kotlin/g0201_0300/s0289_game_of_life/Solution.kt
index 49352ee2e..f662081e7 100644
--- a/src/main/kotlin/g0201_0300/s0289_game_of_life/Solution.kt
+++ b/src/main/kotlin/g0201_0300/s0289_game_of_life/Solution.kt
@@ -5,8 +5,14 @@ package g0201_0300.s0289_game_of_life
 class Solution {
     companion object {
         var dim: Array<IntArray> = arrayOf(
-            intArrayOf(1, 0), intArrayOf(0, 1), intArrayOf(-1, 0), intArrayOf(0, -1),
-            intArrayOf(1, 1), intArrayOf(1, -1), intArrayOf(-1, 1), intArrayOf(-1, -1)
+            intArrayOf(1, 0),
+            intArrayOf(0, 1),
+            intArrayOf(-1, 0),
+            intArrayOf(0, -1),
+            intArrayOf(1, 1),
+            intArrayOf(1, -1),
+            intArrayOf(-1, 1),
+            intArrayOf(-1, -1),
         )
     }
 
diff --git a/src/main/kotlin/g0201_0300/s0297_serialize_and_deserialize_binary_tree/Codec.kt b/src/main/kotlin/g0201_0300/s0297_serialize_and_deserialize_binary_tree/Codec.kt
index 5f6181dee..c8477a619 100644
--- a/src/main/kotlin/g0201_0300/s0297_serialize_and_deserialize_binary_tree/Codec.kt
+++ b/src/main/kotlin/g0201_0300/s0297_serialize_and_deserialize_binary_tree/Codec.kt
@@ -50,7 +50,7 @@ class Codec {
             return null
         }
         val root = TreeNode(
-            data.substring(offset, offset + 3).toInt(16) - BASE_OFFSET
+            data.substring(offset, offset + 3).toInt(16) - BASE_OFFSET,
         )
         offset += 3
         root.left = deserialize(data)
diff --git a/src/main/kotlin/g0301_0400/s0303_range_sum_query_immutable/NumArray.kt b/src/main/kotlin/g0301_0400/s0303_range_sum_query_immutable/NumArray.kt
index b1ef0486e..47f22ac76 100644
--- a/src/main/kotlin/g0301_0400/s0303_range_sum_query_immutable/NumArray.kt
+++ b/src/main/kotlin/g0301_0400/s0303_range_sum_query_immutable/NumArray.kt
@@ -20,7 +20,9 @@ class NumArray(nums: IntArray) {
     fun sumRange(i: Int, j: Int): Int {
         return if (i == 0) {
             sums[j]
-        } else sums[j] - sums[i - 1]
+        } else {
+            sums[j] - sums[i - 1]
+        }
     }
 }
 
diff --git a/src/main/kotlin/g0301_0400/s0319_bulb_switcher/Solution.kt b/src/main/kotlin/g0301_0400/s0319_bulb_switcher/Solution.kt
index 61ca64fba..37cddcb44 100644
--- a/src/main/kotlin/g0301_0400/s0319_bulb_switcher/Solution.kt
+++ b/src/main/kotlin/g0301_0400/s0319_bulb_switcher/Solution.kt
@@ -6,6 +6,8 @@ class Solution {
     fun bulbSwitch(n: Int): Int {
         return if (n < 2) {
             n
-        } else Math.sqrt(n.toDouble()).toInt()
+        } else {
+            Math.sqrt(n.toDouble()).toInt()
+        }
     }
 }
diff --git a/src/main/kotlin/g0301_0400/s0321_create_maximum_number/Solution.kt b/src/main/kotlin/g0301_0400/s0321_create_maximum_number/Solution.kt
index 3c45e9295..016a08afa 100644
--- a/src/main/kotlin/g0301_0400/s0321_create_maximum_number/Solution.kt
+++ b/src/main/kotlin/g0301_0400/s0321_create_maximum_number/Solution.kt
@@ -87,6 +87,8 @@ class Solution {
         }
         return if (equal && merge[k - 1] > res[k - 1]) {
             merge
-        } else res
+        } else {
+            res
+        }
     }
 }
diff --git a/src/main/kotlin/g0301_0400/s0336_palindrome_pairs/Solution.kt b/src/main/kotlin/g0301_0400/s0336_palindrome_pairs/Solution.kt
index 63202c3fc..faa9fae6c 100644
--- a/src/main/kotlin/g0301_0400/s0336_palindrome_pairs/Solution.kt
+++ b/src/main/kotlin/g0301_0400/s0336_palindrome_pairs/Solution.kt
@@ -21,11 +21,13 @@ class Solution {
         val curWord = words[idxCurWord]
         val lenW = curWord.length
         for (idxCh in curWord.indices) {
-            if (cur!!.index >= 0 && cur.index != idxCurWord && isPalindrome(curWord, idxCh, lenW - 1))
+            if (cur!!.index >= 0 && cur.index != idxCurWord && isPalindrome(curWord, idxCh, lenW - 1)) {
                 res.add(listOf(idxCurWord, cur.index))
+            }
             cur = cur.children[curWord[idxCh] - 'a']
-            if (cur == null)
+            if (cur == null) {
                 return
+            }
         }
         for (idxPalin in cur!!.panlinIndicies) {
             if (idxPalin == idxCurWord) continue
@@ -37,10 +39,12 @@ class Solution {
         var cur: TrieNode? = root
         for (idx in word.indices.reversed()) {
             val idxCh = word[idx] - 'a'
-            if (cur!!.children[idxCh] == null)
+            if (cur!!.children[idxCh] == null) {
                 cur.children[idxCh] = TrieNode()
-            if (isPalindrome(word, 0, idx))
+            }
+            if (isPalindrome(word, 0, idx)) {
                 cur.panlinIndicies.add(index)
+            }
             cur = cur.children[idxCh]
         }
         cur!!.panlinIndicies.add(index)
@@ -51,8 +55,9 @@ class Solution {
         var lo = lo
         var hi = hi
         while (lo < hi) {
-            if (word[lo] != word[hi])
+            if (word[lo] != word[hi]) {
                 return false
+            }
             ++lo
             --hi
         }
@@ -62,6 +67,6 @@ class Solution {
     private data class TrieNode(
         val children: Array<TrieNode?> = Array<TrieNode?>(26) { null },
         var index: Int = -1,
-        val panlinIndicies: MutableList<Int> = mutableListOf<Int>()
+        val panlinIndicies: MutableList<Int> = mutableListOf<Int>(),
     )
 }
diff --git a/src/main/kotlin/g0301_0400/s0350_intersection_of_two_arrays_ii/Solution.kt b/src/main/kotlin/g0301_0400/s0350_intersection_of_two_arrays_ii/Solution.kt
index bc18a1b5d..b20e42499 100644
--- a/src/main/kotlin/g0301_0400/s0350_intersection_of_two_arrays_ii/Solution.kt
+++ b/src/main/kotlin/g0301_0400/s0350_intersection_of_two_arrays_ii/Solution.kt
@@ -11,7 +11,7 @@ class Solution {
         }
         var s = MutableList<Int>(0) { 0 }
         for (i in 0 until nums2.size) {
-            if (a.getOrDefault(nums2[i], 0)> 0) {
+            if (a.getOrDefault(nums2[i], 0) > 0) {
                 s.add(nums2[i])
                 a[nums2[i]] = a.getValue(nums2[i]) - 1
             }
diff --git a/src/main/kotlin/g0301_0400/s0354_russian_doll_envelopes/Solution.kt b/src/main/kotlin/g0301_0400/s0354_russian_doll_envelopes/Solution.kt
index 7c642037d..34046a506 100644
--- a/src/main/kotlin/g0301_0400/s0354_russian_doll_envelopes/Solution.kt
+++ b/src/main/kotlin/g0301_0400/s0354_russian_doll_envelopes/Solution.kt
@@ -7,7 +7,11 @@ class Solution {
     fun maxEnvelopes(envelopes: Array<IntArray>): Int {
         envelopes.sortWith { a: IntArray, b: IntArray ->
             if (a[0] != b[0]
-            ) a[0] - b[0] else b[1] - a[1]
+            ) {
+                a[0] - b[0]
+            } else {
+                b[1] - a[1]
+            }
         }
         val tails = IntArray(envelopes.size)
         var size = 0
diff --git a/src/main/kotlin/g0301_0400/s0365_water_and_jug_problem/Solution.kt b/src/main/kotlin/g0301_0400/s0365_water_and_jug_problem/Solution.kt
index 660a49477..3c8e55049 100644
--- a/src/main/kotlin/g0301_0400/s0365_water_and_jug_problem/Solution.kt
+++ b/src/main/kotlin/g0301_0400/s0365_water_and_jug_problem/Solution.kt
@@ -8,7 +8,9 @@ class Solution {
     private fun gcd(n1: Int, n2: Int): Int {
         return if (n2 == 0) {
             n1
-        } else gcd(n2, n1 % n2)
+        } else {
+            gcd(n2, n1 % n2)
+        }
     }
 
     fun canMeasureWater(jug1Capacity: Int, jug2Capacity: Int, targetCapacity: Int): Boolean {
diff --git a/src/main/kotlin/g0301_0400/s0372_super_pow/Solution.kt b/src/main/kotlin/g0301_0400/s0372_super_pow/Solution.kt
index 85dddd326..d69aec6a5 100644
--- a/src/main/kotlin/g0301_0400/s0372_super_pow/Solution.kt
+++ b/src/main/kotlin/g0301_0400/s0372_super_pow/Solution.kt
@@ -11,7 +11,9 @@ class Solution {
             // Cycle has started
             // cycle starts at phi with length phi
             exp(a % MOD, phi + arrMod)
-        } else exp(a % MOD, arrMod)
+        } else {
+            exp(a % MOD, arrMod)
+        }
     }
 
     private fun phi(n: Int): Int {
diff --git a/src/main/kotlin/g0301_0400/s0381_insert_delete_getrandom_o1_duplicates_allowed/RandomizedCollection.kt b/src/main/kotlin/g0301_0400/s0381_insert_delete_getrandom_o1_duplicates_allowed/RandomizedCollection.kt
index e775e893f..574d88d2e 100644
--- a/src/main/kotlin/g0301_0400/s0381_insert_delete_getrandom_o1_duplicates_allowed/RandomizedCollection.kt
+++ b/src/main/kotlin/g0301_0400/s0381_insert_delete_getrandom_o1_duplicates_allowed/RandomizedCollection.kt
@@ -25,13 +25,15 @@ class RandomizedCollection() {
 
     /** Removes a value from the collection. Returns true if the collection contained the specified element. */
     fun remove(x: Int): Boolean {
-        if (x !in m2a)
+        if (x !in m2a) {
             return false
+        }
         val pos = m2a[x]!!.iterator().next()
-        if (m2a[x]!!.size == 1)
+        if (m2a[x]!!.size == 1) {
             m2a.remove(x)
-        else
+        } else {
             m2a[x]!!.remove(pos)
+        }
         if (pos != a2m.size - 1) {
             m2a[a2m[a2m.size - 1]]!!.remove(a2m.size - 1)
             m2a[a2m[a2m.size - 1]]!!.add(pos)
diff --git a/src/main/kotlin/g0301_0400/s0387_first_unique_character_in_a_string/Solution.kt b/src/main/kotlin/g0301_0400/s0387_first_unique_character_in_a_string/Solution.kt
index 814e567c6..9ecaa96a1 100644
--- a/src/main/kotlin/g0301_0400/s0387_first_unique_character_in_a_string/Solution.kt
+++ b/src/main/kotlin/g0301_0400/s0387_first_unique_character_in_a_string/Solution.kt
@@ -16,6 +16,8 @@ class Solution {
         }
         return if (ans == Int.MAX_VALUE) {
             -1
-        } else ans
+        } else {
+            ans
+        }
     }
 }
diff --git a/src/main/kotlin/g0301_0400/s0398_random_pick_index/Solution.kt b/src/main/kotlin/g0301_0400/s0398_random_pick_index/Solution.kt
index b19e12634..d6481fa8f 100644
--- a/src/main/kotlin/g0301_0400/s0398_random_pick_index/Solution.kt
+++ b/src/main/kotlin/g0301_0400/s0398_random_pick_index/Solution.kt
@@ -14,7 +14,7 @@ class Solution(nums: IntArray) {
         map = HashMap()
         for (i in nums.indices) {
             map.computeIfAbsent(
-                nums[i]
+                nums[i],
             ) { ArrayList() }.add(i)
         }
     }
diff --git a/src/main/kotlin/g0301_0400/s0399_evaluate_division/Solution.kt b/src/main/kotlin/g0301_0400/s0399_evaluate_division/Solution.kt
index 3ebdb79c8..ca37158dc 100644
--- a/src/main/kotlin/g0301_0400/s0399_evaluate_division/Solution.kt
+++ b/src/main/kotlin/g0301_0400/s0399_evaluate_division/Solution.kt
@@ -11,7 +11,7 @@ class Solution {
     fun calcEquation(
         equations: List<List<String?>>,
         values: DoubleArray,
-        queries: List<List<String?>>
+        queries: List<List<String?>>,
     ): DoubleArray {
         root = HashMap()
         rate = HashMap()
@@ -41,8 +41,12 @@ class Solution {
             }
             val rootX = findRoot(x, x, 1.0)
             val rootY = findRoot(y, y, 1.0)
-            result[i] = if (rootX == rootY) (rate as HashMap<String?, Double>).get(x)!! /
-                (rate as HashMap<String?, Double>).get(y)!! else -1.0
+            result[i] = if (rootX == rootY) {
+                (rate as HashMap<String?, Double>).get(x)!! /
+                    (rate as HashMap<String?, Double>).get(y)!!
+            } else {
+                -1.0
+            }
         }
         return result
     }
diff --git a/src/main/kotlin/g0301_0400/s0400_nth_digit/Solution.kt b/src/main/kotlin/g0301_0400/s0400_nth_digit/Solution.kt
index a9ecdd95d..f3d52c128 100644
--- a/src/main/kotlin/g0301_0400/s0400_nth_digit/Solution.kt
+++ b/src/main/kotlin/g0301_0400/s0400_nth_digit/Solution.kt
@@ -5,10 +5,10 @@ package g0301_0400.s0400_nth_digit
 @Suppress("NAME_SHADOWING")
 class Solution {
     /*
-    * 1. find the length of the number where the nth digit is from
-    * 2. find the actual number where the nth digit is from
-    * 3. find the nth digit and return
-    */
+     * 1. find the length of the number where the nth digit is from
+     * 2. find the actual number where the nth digit is from
+     * 3. find the nth digit and return
+     */
     fun findNthDigit(n: Int): Int {
         var n = n
         var len = 1
diff --git a/src/main/kotlin/g0401_0500/s0401_binary_watch/Solution.kt b/src/main/kotlin/g0401_0500/s0401_binary_watch/Solution.kt
index 607e119e3..19c1af940 100644
--- a/src/main/kotlin/g0401_0500/s0401_binary_watch/Solution.kt
+++ b/src/main/kotlin/g0401_0500/s0401_binary_watch/Solution.kt
@@ -20,7 +20,7 @@ class Solution {
         turnedOn: Int,
         selectedTimes: MutableList<String>,
         hour: Int,
-        minutes: Int
+        minutes: Int,
     ) {
         if (isValidTime(turnedOn, hour, minutes)) {
             selectedTimes.add(getTimeString(hour, minutes))
diff --git a/src/main/kotlin/g0401_0500/s0403_frog_jump/Solution.kt b/src/main/kotlin/g0401_0500/s0403_frog_jump/Solution.kt
index efa9d5977..467658bd2 100644
--- a/src/main/kotlin/g0401_0500/s0403_frog_jump/Solution.kt
+++ b/src/main/kotlin/g0401_0500/s0403_frog_jump/Solution.kt
@@ -28,7 +28,7 @@ class Solution {
         index: Int,
         jumpLength: Int,
         expectedVal: Int,
-        rocks: Map<Int, Int>
+        rocks: Map<Int, Int>,
     ): Boolean {
         // overshoot and going backwards not allowed
         if (index >= stones.size || jumpLength <= 0) {
@@ -52,21 +52,21 @@ class Solution {
                 rocks[stones[index] + jumpLength] ?: stones.size,
                 jumpLength + 1,
                 stones[index] + jumpLength,
-                rocks
+                rocks,
             ) ||
                 jump(
                     stones,
                     rocks[stones[index] + jumpLength] ?: stones.size,
                     jumpLength,
                     stones[index] + jumpLength,
-                    rocks
+                    rocks,
                 ) ||
                 jump(
                     stones,
                     rocks[stones[index] + jumpLength] ?: stones.size,
                     jumpLength - 1,
                     stones[index] + jumpLength,
-                    rocks
+                    rocks,
                 )
             )
     }
diff --git a/src/main/kotlin/g0401_0500/s0406_queue_reconstruction_by_height/Solution.kt b/src/main/kotlin/g0401_0500/s0406_queue_reconstruction_by_height/Solution.kt
index d47a176c5..f9dd7c37c 100644
--- a/src/main/kotlin/g0401_0500/s0406_queue_reconstruction_by_height/Solution.kt
+++ b/src/main/kotlin/g0401_0500/s0406_queue_reconstruction_by_height/Solution.kt
@@ -6,7 +6,10 @@ package g0401_0500.s0406_queue_reconstruction_by_height
 class Solution {
     fun reconstructQueue(people: Array<IntArray>): Array<IntArray> {
         return people.sortedWith(compareBy({ -it[0] }, { it[1] }))
-            .fold(mutableListOf<IntArray>()) { output, p -> output.add(p[1], p); output }
+            .fold(mutableListOf<IntArray>()) { output, p ->
+                output.add(p[1], p)
+                output
+            }
             .toTypedArray()
     }
 }
diff --git a/src/main/kotlin/g0401_0500/s0409_longest_palindrome/Solution.kt b/src/main/kotlin/g0401_0500/s0409_longest_palindrome/Solution.kt
index 3e5a34c66..8db501d64 100644
--- a/src/main/kotlin/g0401_0500/s0409_longest_palindrome/Solution.kt
+++ b/src/main/kotlin/g0401_0500/s0409_longest_palindrome/Solution.kt
@@ -13,6 +13,8 @@ class Solution {
         }
         return if (set.isEmpty()) {
             s.length
-        } else s.length - set.cardinality() + 1
+        } else {
+            s.length - set.cardinality() + 1
+        }
     }
 }
diff --git a/src/main/kotlin/g0401_0500/s0417_pacific_atlantic_water_flow/Solution.kt b/src/main/kotlin/g0401_0500/s0417_pacific_atlantic_water_flow/Solution.kt
index ddd0d3868..24c6c62c6 100644
--- a/src/main/kotlin/g0401_0500/s0417_pacific_atlantic_water_flow/Solution.kt
+++ b/src/main/kotlin/g0401_0500/s0417_pacific_atlantic_water_flow/Solution.kt
@@ -16,12 +16,12 @@ class Solution {
         row = matrix[0].size
         val pacific = Array(col) {
             BooleanArray(
-                row
+                row,
             )
         }
         val atlantic = Array(col) {
             BooleanArray(
-                row
+                row,
             )
         }
         for (i in 0 until col) {
diff --git a/src/main/kotlin/g0401_0500/s0435_non_overlapping_intervals/Solution.kt b/src/main/kotlin/g0401_0500/s0435_non_overlapping_intervals/Solution.kt
index 3130276e5..512c88c2b 100644
--- a/src/main/kotlin/g0401_0500/s0435_non_overlapping_intervals/Solution.kt
+++ b/src/main/kotlin/g0401_0500/s0435_non_overlapping_intervals/Solution.kt
@@ -7,7 +7,11 @@ class Solution {
     fun eraseOverlapIntervals(intervals: Array<IntArray>): Int {
         intervals.sortWith { a: IntArray, b: IntArray ->
             if (a[0] != b[0]
-            ) a[0] - b[0] else a[1] - b[1]
+            ) {
+                a[0] - b[0]
+            } else {
+                a[1] - b[1]
+            }
         }
         var erasures = 0
         var end = intervals[0][1]
diff --git a/src/main/kotlin/g0401_0500/s0446_arithmetic_slices_ii_subsequence/Solution.kt b/src/main/kotlin/g0401_0500/s0446_arithmetic_slices_ii_subsequence/Solution.kt
index 946a51271..347308029 100644
--- a/src/main/kotlin/g0401_0500/s0446_arithmetic_slices_ii_subsequence/Solution.kt
+++ b/src/main/kotlin/g0401_0500/s0446_arithmetic_slices_ii_subsequence/Solution.kt
@@ -16,7 +16,7 @@ class Solution {
                 count += length[i][j]
             }
             indexes.computeIfAbsent(
-                arr[i].toLong()
+                arr[i].toLong(),
             ) { _: Long? -> ArrayList() }.add(i)
         }
         return count
diff --git a/src/main/kotlin/g0401_0500/s0464_can_i_win/Solution.kt b/src/main/kotlin/g0401_0500/s0464_can_i_win/Solution.kt
index 0c5bff10c..2e64a3a24 100644
--- a/src/main/kotlin/g0401_0500/s0464_can_i_win/Solution.kt
+++ b/src/main/kotlin/g0401_0500/s0464_can_i_win/Solution.kt
@@ -10,7 +10,9 @@ class Solution {
         }
         return if (1.0 * maxChoosableInteger * (1 + maxChoosableInteger) / 2 < desiredTotal) {
             false
-        } else canWin(0, arrayOfNulls(1 shl maxChoosableInteger), desiredTotal, maxChoosableInteger)
+        } else {
+            canWin(0, arrayOfNulls(1 shl maxChoosableInteger), desiredTotal, maxChoosableInteger)
+        }
     }
 
     private fun canWin(state: Int, dp: Array<Boolean?>, desiredTotal: Int, maxChoosableInteger: Int): Boolean {
diff --git a/src/main/kotlin/g0401_0500/s0475_heaters/Solution.kt b/src/main/kotlin/g0401_0500/s0475_heaters/Solution.kt
index a1d5e2930..4c24c6b6e 100644
--- a/src/main/kotlin/g0401_0500/s0475_heaters/Solution.kt
+++ b/src/main/kotlin/g0401_0500/s0475_heaters/Solution.kt
@@ -22,7 +22,7 @@ class Solution {
             } else if (houses[hs] <= heaters[ht + 1]) {
                 res = Math.max(
                     res,
-                    Math.min(houses[hs] - heaters[ht], heaters[ht + 1] - houses[hs])
+                    Math.min(houses[hs] - heaters[ht], heaters[ht + 1] - houses[hs]),
                 )
                 hs++
             } else {
diff --git a/src/main/kotlin/g0401_0500/s0480_sliding_window_median/Solution.kt b/src/main/kotlin/g0401_0500/s0480_sliding_window_median/Solution.kt
index aaac37ca7..bfac89127 100644
--- a/src/main/kotlin/g0401_0500/s0480_sliding_window_median/Solution.kt
+++ b/src/main/kotlin/g0401_0500/s0480_sliding_window_median/Solution.kt
@@ -18,7 +18,11 @@ class Solution {
         }
         val comparator = Comparator { a: Int?, b: Int? ->
             if (nums[a!!] != nums[b!!]
-            ) Integer.compare(nums[a], nums[b]) else Integer.compare(a, b)
+            ) {
+                Integer.compare(nums[a], nums[b])
+            } else {
+                Integer.compare(a, b)
+            }
         }
         val smallNums = TreeSet(comparator.reversed())
         val largeNums = TreeSet(comparator)
@@ -59,6 +63,8 @@ class Solution {
     private fun getMedian(smallNums: TreeSet<Int?>, largeNums: TreeSet<Int?>, nums: IntArray): Double {
         return if (smallNums.size == largeNums.size) {
             (nums[smallNums.first()!!].toDouble() + nums[largeNums.first()!!]) / 2
-        } else nums[smallNums.first()!!].toDouble()
+        } else {
+            nums[smallNums.first()!!].toDouble()
+        }
     }
 }
diff --git a/src/main/kotlin/g0401_0500/s0488_zuma_game/Solution.kt b/src/main/kotlin/g0401_0500/s0488_zuma_game/Solution.kt
index c9101fa80..9c30d5d7a 100644
--- a/src/main/kotlin/g0401_0500/s0488_zuma_game/Solution.kt
+++ b/src/main/kotlin/g0401_0500/s0488_zuma_game/Solution.kt
@@ -37,7 +37,7 @@ class Solution {
                     val sR = findMinStepDp(
                         removeRepeated(newS.toString()),
                         hand.substring(0, j) + hand.substring(j + 1, hand.length),
-                        dp
+                        dp,
                     )
                     if (sR != -1) {
                         min = if (min == -1) sR + 1 else Integer.min(min, sR + 1)
@@ -61,7 +61,7 @@ class Solution {
                 if (count >= 3) {
                     return removeRepeated(
                         original.substring(0, i - count) +
-                            original.substring(i, original.length)
+                            original.substring(i, original.length),
                     )
                 } else {
                     count = 1
diff --git a/src/main/kotlin/g0401_0500/s0491_increasing_subsequences/Solution.kt b/src/main/kotlin/g0401_0500/s0491_increasing_subsequences/Solution.kt
index 3c23c6b2d..293cd51e4 100644
--- a/src/main/kotlin/g0401_0500/s0491_increasing_subsequences/Solution.kt
+++ b/src/main/kotlin/g0401_0500/s0491_increasing_subsequences/Solution.kt
@@ -17,7 +17,7 @@ class Solution {
         nums: IntArray,
         start: Int,
         currList: MutableList<Int>,
-        answer: MutableSet<List<Int>>
+        answer: MutableSet<List<Int>>,
     ): Set<List<Int>> {
         if (currList.size >= 2) {
             answer.add(ArrayList(currList))
diff --git a/src/main/kotlin/g0401_0500/s0492_construct_the_rectangle/Solution.kt b/src/main/kotlin/g0401_0500/s0492_construct_the_rectangle/Solution.kt
index 7ab87937d..bc7c3b894 100644
--- a/src/main/kotlin/g0401_0500/s0492_construct_the_rectangle/Solution.kt
+++ b/src/main/kotlin/g0401_0500/s0492_construct_the_rectangle/Solution.kt
@@ -7,7 +7,7 @@ class Solution {
       Algorithm:
      - start with an index i from the square root all the way to 1;
      - if at any time, area % i == 0 (so i is a divisor of area), then it's the closest solution.
-    */
+     */
     fun constructRectangle(area: Int): IntArray {
         var low = Math.sqrt(area.toDouble()).toInt()
         while (low > 0) {
diff --git a/src/main/kotlin/g0401_0500/s0497_random_point_in_non_overlapping_rectangles/Solution.kt b/src/main/kotlin/g0401_0500/s0497_random_point_in_non_overlapping_rectangles/Solution.kt
index 5a17a7092..dc575ecae 100644
--- a/src/main/kotlin/g0401_0500/s0497_random_point_in_non_overlapping_rectangles/Solution.kt
+++ b/src/main/kotlin/g0401_0500/s0497_random_point_in_non_overlapping_rectangles/Solution.kt
@@ -49,7 +49,8 @@ class Solution(rects: Array<IntArray>) {
         val bot = r[1]
         val top = r[3]
         return intArrayOf(
-            left + random.nextInt(right - left + 1), bot + random.nextInt(top - bot + 1)
+            left + random.nextInt(right - left + 1),
+            bot + random.nextInt(top - bot + 1),
         )
     }
 }
diff --git a/src/main/kotlin/g0501_0600/s0502_ipo/Solution.kt b/src/main/kotlin/g0501_0600/s0502_ipo/Solution.kt
index 0a1e78436..7514956fe 100644
--- a/src/main/kotlin/g0501_0600/s0502_ipo/Solution.kt
+++ b/src/main/kotlin/g0501_0600/s0502_ipo/Solution.kt
@@ -12,7 +12,7 @@ class Solution {
     var profitMaxHeap = PriorityQueue<Data> { d1, d2 ->
         -1 * Integer.compare(
             d1.profit,
-            d2.profit
+            d2.profit,
         )
     }
 
@@ -23,7 +23,6 @@ class Solution {
         var maxCapital = w
         var currentCapital = w
         for (i in 0 until k) {
-
             // first fetch all tasks you can do with current capital and add those in profit max heap
             while (capitalMinHeap.isNotEmpty() && currentCapital >= capitalMinHeap.peek().capital) {
                 profitMaxHeap.add(capitalMinHeap.poll())
diff --git a/src/main/kotlin/g0501_0600/s0513_find_bottom_left_tree_value/Solution.kt b/src/main/kotlin/g0501_0600/s0513_find_bottom_left_tree_value/Solution.kt
index a3db0e756..f73189af0 100644
--- a/src/main/kotlin/g0501_0600/s0513_find_bottom_left_tree_value/Solution.kt
+++ b/src/main/kotlin/g0501_0600/s0513_find_bottom_left_tree_value/Solution.kt
@@ -48,6 +48,8 @@ class Solution {
         val a = func(root, 0)
         return if (a != null && a.size > 0) {
             a[0]
-        } else -1
+        } else {
+            -1
+        }
     }
 }
diff --git a/src/main/kotlin/g0501_0600/s0514_freedom_trail/Solution.kt b/src/main/kotlin/g0501_0600/s0514_freedom_trail/Solution.kt
index 8fe12476f..88e0e0fb5 100644
--- a/src/main/kotlin/g0501_0600/s0514_freedom_trail/Solution.kt
+++ b/src/main/kotlin/g0501_0600/s0514_freedom_trail/Solution.kt
@@ -23,7 +23,7 @@ class Solution {
         key: String,
         j: Int,
         cache: Array<IntArray>,
-        indexs: Array<MutableList<Int>?>
+        indexs: Array<MutableList<Int>?>,
     ): Int {
         if (j == key.length) {
             return 0
diff --git a/src/main/kotlin/g0501_0600/s0521_longest_uncommon_subsequence_i/Solution.kt b/src/main/kotlin/g0501_0600/s0521_longest_uncommon_subsequence_i/Solution.kt
index 4668123c8..dd0f66d4b 100644
--- a/src/main/kotlin/g0501_0600/s0521_longest_uncommon_subsequence_i/Solution.kt
+++ b/src/main/kotlin/g0501_0600/s0521_longest_uncommon_subsequence_i/Solution.kt
@@ -6,6 +6,8 @@ class Solution {
     fun findLUSlength(a: String, b: String): Int {
         return if (a == b) {
             -1
-        } else a.length.coerceAtLeast(b.length)
+        } else {
+            a.length.coerceAtLeast(b.length)
+        }
     }
 }
diff --git a/src/main/kotlin/g0501_0600/s0529_minesweeper/Solution.kt b/src/main/kotlin/g0501_0600/s0529_minesweeper/Solution.kt
index 3e7e65a46..9d5e8e767 100644
--- a/src/main/kotlin/g0501_0600/s0529_minesweeper/Solution.kt
+++ b/src/main/kotlin/g0501_0600/s0529_minesweeper/Solution.kt
@@ -57,7 +57,7 @@ class Solution {
             intArrayOf(-1, -1),
             intArrayOf(-1, 1),
             intArrayOf(1, -1),
-            intArrayOf(1, 1)
+            intArrayOf(1, 1),
         )
     }
 }
diff --git a/src/main/kotlin/g0501_0600/s0539_minimum_time_difference/Solution.kt b/src/main/kotlin/g0501_0600/s0539_minimum_time_difference/Solution.kt
index aab0fe172..454e53952 100644
--- a/src/main/kotlin/g0501_0600/s0539_minimum_time_difference/Solution.kt
+++ b/src/main/kotlin/g0501_0600/s0539_minimum_time_difference/Solution.kt
@@ -6,7 +6,9 @@ class Solution {
     fun findMinDifference(timePoints: List<String>): Int {
         return if (timePoints.size < 300) {
             smallInputSize(timePoints)
-        } else largeInputSize(timePoints)
+        } else {
+            largeInputSize(timePoints)
+        }
     }
 
     private fun largeInputSize(timePoints: List<String>): Int {
diff --git a/src/main/kotlin/g0501_0600/s0546_remove_boxes/Solution.kt b/src/main/kotlin/g0501_0600/s0546_remove_boxes/Solution.kt
index 7ad012f4f..05b96eef6 100644
--- a/src/main/kotlin/g0501_0600/s0546_remove_boxes/Solution.kt
+++ b/src/main/kotlin/g0501_0600/s0546_remove_boxes/Solution.kt
@@ -12,7 +12,7 @@ class Solution {
         dp = Array(n + 1) {
             Array(n + 1) {
                 IntArray(
-                    n + 1
+                    n + 1,
                 )
             }
         }
diff --git a/src/main/kotlin/g0501_0600/s0552_student_attendance_record_ii/Solution.kt b/src/main/kotlin/g0501_0600/s0552_student_attendance_record_ii/Solution.kt
index 8b986977b..3aab04004 100644
--- a/src/main/kotlin/g0501_0600/s0552_student_attendance_record_ii/Solution.kt
+++ b/src/main/kotlin/g0501_0600/s0552_student_attendance_record_ii/Solution.kt
@@ -15,7 +15,7 @@ class Solution {
             longArrayOf(1, 0, 0, 1, 0, 0),
             longArrayOf(0, 0, 0, 1, 1, 0),
             longArrayOf(0, 0, 0, 1, 0, 1),
-            longArrayOf(0, 0, 0, 1, 0, 0)
+            longArrayOf(0, 0, 0, 1, 0, 0),
         )
         val e = quickPower(matrix, n - 1)
         return (
diff --git a/src/main/kotlin/g0501_0600/s0556_next_greater_element_iii/Solution.kt b/src/main/kotlin/g0501_0600/s0556_next_greater_element_iii/Solution.kt
index 5a645c3de..d28b1b83a 100644
--- a/src/main/kotlin/g0501_0600/s0556_next_greater_element_iii/Solution.kt
+++ b/src/main/kotlin/g0501_0600/s0556_next_greater_element_iii/Solution.kt
@@ -14,7 +14,7 @@ class Solution {
                look for largest index l such that inp[l] > inp[k]
                swap the two index
                reverse from k+1 to n.length
-       */
+     */
     fun nextGreaterElement(n: Int): Int {
         val inp = n.toString().toCharArray()
         // Find k
diff --git a/src/main/kotlin/g0501_0600/s0558_logical_or_of_two_binary_grids_represented_as_quad_trees/Solution.kt b/src/main/kotlin/g0501_0600/s0558_logical_or_of_two_binary_grids_represented_as_quad_trees/Solution.kt
index 7a9990b99..a93724fc6 100644
--- a/src/main/kotlin/g0501_0600/s0558_logical_or_of_two_binary_grids_represented_as_quad_trees/Solution.kt
+++ b/src/main/kotlin/g0501_0600/s0558_logical_or_of_two_binary_grids_represented_as_quad_trees/Solution.kt
@@ -25,11 +25,11 @@ class Solution {
         val bl: Node? = intersect(quadTree1.bottomLeft, quadTree2.bottomLeft)
         val br: Node? = intersect(quadTree1.bottomRight, quadTree2.bottomRight)
         if ((
-            tl!!.isLeaf &&
-                tr!!.isLeaf &&
-                bl!!.isLeaf &&
-                br!!.isLeaf && tl.`val` == tr.`val`
-            ) && tr.`val` == bl.`val` && br.`val` == bl.`val`
+                tl!!.isLeaf &&
+                    tr!!.isLeaf &&
+                    bl!!.isLeaf &&
+                    br!!.isLeaf && tl.`val` == tr.`val`
+                ) && tr.`val` == bl.`val` && br.`val` == bl.`val`
         ) {
             out.isLeaf = true
             out.`val` = tl.`val`
diff --git a/src/main/kotlin/g0501_0600/s0564_find_the_closest_palindrome/Solution.kt b/src/main/kotlin/g0501_0600/s0564_find_the_closest_palindrome/Solution.kt
index 73e1f83e5..7e54ca3a2 100644
--- a/src/main/kotlin/g0501_0600/s0564_find_the_closest_palindrome/Solution.kt
+++ b/src/main/kotlin/g0501_0600/s0564_find_the_closest_palindrome/Solution.kt
@@ -12,10 +12,14 @@ class Solution {
         val offset = Math.pow(10.0, (n.length / 2).toDouble()).toInt()
         val first =
             if (isPalindrome(n)) palindromeGenerator(num + offset, n.length) else palindromeGenerator(num, n.length)
-        val second = if (first < num) palindromeGenerator(num + offset, n.length) else palindromeGenerator(
-            num - offset,
-            n.length
-        )
+        val second = if (first < num) {
+            palindromeGenerator(num + offset, n.length)
+        } else {
+            palindromeGenerator(
+                num - offset,
+                n.length,
+            )
+        }
         if (first + second == 2 * num) {
             return if (first < second) first.toString() else second.toString()
         }
diff --git a/src/main/kotlin/g0501_0600/s0572_subtree_of_another_tree/Solution.kt b/src/main/kotlin/g0501_0600/s0572_subtree_of_another_tree/Solution.kt
index dd55f58d2..f8ff4a4b4 100644
--- a/src/main/kotlin/g0501_0600/s0572_subtree_of_another_tree/Solution.kt
+++ b/src/main/kotlin/g0501_0600/s0572_subtree_of_another_tree/Solution.kt
@@ -37,8 +37,10 @@ class Solution {
         }
         return if (root == null || subRoot == null) {
             false
-        } else isSubtreeFound(root, subRoot) ||
-            isSubtree(root.left, subRoot) ||
-            isSubtree(root.right, subRoot)
+        } else {
+            isSubtreeFound(root, subRoot) ||
+                isSubtree(root.left, subRoot) ||
+                isSubtree(root.right, subRoot)
+        }
     }
 }
diff --git a/src/main/kotlin/g0501_0600/s0576_out_of_boundary_paths/Solution.kt b/src/main/kotlin/g0501_0600/s0576_out_of_boundary_paths/Solution.kt
index 78bb40911..0c172693a 100644
--- a/src/main/kotlin/g0501_0600/s0576_out_of_boundary_paths/Solution.kt
+++ b/src/main/kotlin/g0501_0600/s0576_out_of_boundary_paths/Solution.kt
@@ -10,7 +10,7 @@ class Solution {
         remainingMoves: Int,
         currRow: Int,
         currCol: Int,
-        cache: Array<Array<IntArray>>
+        cache: Array<Array<IntArray>>,
     ): Int {
         if (currRow < 0 || currRow == m || currCol < 0 || currCol == n) {
             return 1
@@ -35,7 +35,7 @@ class Solution {
         val cache = Array(m) {
             Array(n) {
                 IntArray(
-                    maxMoves + 1
+                    maxMoves + 1,
                 )
             }
         }
diff --git a/src/main/kotlin/g0501_0600/s0583_delete_operation_for_two_strings/Solution.kt b/src/main/kotlin/g0501_0600/s0583_delete_operation_for_two_strings/Solution.kt
index 2fe8f068d..5af551623 100644
--- a/src/main/kotlin/g0501_0600/s0583_delete_operation_for_two_strings/Solution.kt
+++ b/src/main/kotlin/g0501_0600/s0583_delete_operation_for_two_strings/Solution.kt
@@ -10,10 +10,14 @@ class Solution {
         val dp = Array(m + 1) { IntArray(n + 1) }
         for (i in 1..m) {
             for (j in 1..n) {
-                dp[i][j] = if (word1[i - 1] == word2[j - 1]) dp[i - 1][j - 1] + 1 else Math.max(
-                    dp[i - 1][j],
-                    dp[i][j - 1]
-                )
+                dp[i][j] = if (word1[i - 1] == word2[j - 1]) {
+                    dp[i - 1][j - 1] + 1
+                } else {
+                    Math.max(
+                        dp[i - 1][j],
+                        dp[i][j - 1],
+                    )
+                }
             }
         }
         return m + n - 2 * dp[m][n]
diff --git a/src/main/kotlin/g0501_0600/s0593_valid_square/Solution.kt b/src/main/kotlin/g0501_0600/s0593_valid_square/Solution.kt
index 654d1a7f2..6bbb8f7f5 100644
--- a/src/main/kotlin/g0501_0600/s0593_valid_square/Solution.kt
+++ b/src/main/kotlin/g0501_0600/s0593_valid_square/Solution.kt
@@ -20,7 +20,9 @@ class Solution {
         }
         return if (distancesSquared[4] != distancesSquared[5]) {
             false
-        } else distancesSquared[5] == 2 * distancesSquared[0]
+        } else {
+            distancesSquared[5] == 2 * distancesSquared[0]
+        }
     }
 
     private fun getDistanceSquared(p1: IntArray, p2: IntArray): Int {
diff --git a/src/main/kotlin/g0601_0700/s0617_merge_two_binary_trees/Solution.kt b/src/main/kotlin/g0601_0700/s0617_merge_two_binary_trees/Solution.kt
index 02c427601..313bd4675 100644
--- a/src/main/kotlin/g0601_0700/s0617_merge_two_binary_trees/Solution.kt
+++ b/src/main/kotlin/g0601_0700/s0617_merge_two_binary_trees/Solution.kt
@@ -23,10 +23,12 @@ class Solution {
         }
         return if (root2 == null) {
             root1
-        } else TreeNode(
-            root1.`val` + root2.`val`,
-            mergeTrees(root1.left, root2.left),
-            mergeTrees(root1.right, root2.right)
-        )
+        } else {
+            TreeNode(
+                root1.`val` + root2.`val`,
+                mergeTrees(root1.left, root2.left),
+                mergeTrees(root1.right, root2.right),
+            )
+        }
     }
 }
diff --git a/src/main/kotlin/g0601_0700/s0622_design_circular_queue/MyCircularQueue.kt b/src/main/kotlin/g0601_0700/s0622_design_circular_queue/MyCircularQueue.kt
index 8ba4033f7..9fcebccff 100644
--- a/src/main/kotlin/g0601_0700/s0622_design_circular_queue/MyCircularQueue.kt
+++ b/src/main/kotlin/g0601_0700/s0622_design_circular_queue/MyCircularQueue.kt
@@ -40,13 +40,17 @@ class MyCircularQueue(private val maxSize: Int) {
     fun Rear(): Int {
         return if (size == 0) {
             -1
-        } else dumyHead.right!!.`val`
+        } else {
+            dumyHead.right!!.`val`
+        }
     }
 
     fun Front(): Int {
         return if (size == 0) {
             -1
-        } else dumyHead.left!!.`val`
+        } else {
+            dumyHead.left!!.`val`
+        }
     }
 
     fun isEmpty(): Boolean {
diff --git a/src/main/kotlin/g0601_0700/s0638_shopping_offers/Solution.kt b/src/main/kotlin/g0601_0700/s0638_shopping_offers/Solution.kt
index 77e8ddfe5..5f626ef65 100644
--- a/src/main/kotlin/g0601_0700/s0638_shopping_offers/Solution.kt
+++ b/src/main/kotlin/g0601_0700/s0638_shopping_offers/Solution.kt
@@ -7,7 +7,7 @@ class Solution {
     fun shoppingOffers(
         price: List<Int>,
         special: List<List<Int>>,
-        needs: List<Int>
+        needs: List<Int>,
     ): Int {
         val map: MutableMap<List<Int>, Int> = HashMap()
         shoppingOffersUtil(price, special, needs, map)
@@ -18,7 +18,7 @@ class Solution {
         price: List<Int>,
         special: List<List<Int>>,
         needs: List<Int>,
-        map: MutableMap<List<Int>, Int>
+        map: MutableMap<List<Int>, Int>,
     ): Int {
         if (map.containsKey(needs)) {
             return map[needs]!!
@@ -32,9 +32,9 @@ class Solution {
                             price,
                             special,
                             updatedNeeds(needs, special[i]),
-                            map
+                            map,
                         ),
-                    ans
+                    ans,
                 )
             }
         }
diff --git a/src/main/kotlin/g0601_0700/s0641_design_circular_deque/MyCircularDeque.kt b/src/main/kotlin/g0601_0700/s0641_design_circular_deque/MyCircularDeque.kt
index 053bd4da8..f32cdd7aa 100644
--- a/src/main/kotlin/g0601_0700/s0641_design_circular_deque/MyCircularDeque.kt
+++ b/src/main/kotlin/g0601_0700/s0641_design_circular_deque/MyCircularDeque.kt
@@ -58,13 +58,17 @@ class MyCircularDeque(k: Int) {
     fun getFront(): Int {
         return if (size == 0) {
             -1
-        } else data[(front - 1 + data.size) % data.size]
+        } else {
+            data[(front - 1 + data.size) % data.size]
+        }
     }
 
     fun getRear(): Int {
         return if (size == 0) {
             -1
-        } else data[(rear + 1) % data.size]
+        } else {
+            data[(rear + 1) % data.size]
+        }
     }
 
     fun isEmpty(): Boolean {
diff --git a/src/main/kotlin/g0601_0700/s0655_print_binary_tree/Solution.kt b/src/main/kotlin/g0601_0700/s0655_print_binary_tree/Solution.kt
index 3813b15c9..0b7902a63 100644
--- a/src/main/kotlin/g0601_0700/s0655_print_binary_tree/Solution.kt
+++ b/src/main/kotlin/g0601_0700/s0655_print_binary_tree/Solution.kt
@@ -39,7 +39,7 @@ class Solution {
         row: Int,
         totalRows: Int,
         i: Int,
-        j: Int
+        j: Int,
     ) {
         if (row == totalRows || root == null) {
             return
@@ -52,6 +52,8 @@ class Solution {
     private fun getHeight(root: TreeNode?): Int {
         return if (root == null) {
             0
-        } else 1 + getHeight(root.left).coerceAtLeast(getHeight(root.right))
+        } else {
+            1 + getHeight(root.left).coerceAtLeast(getHeight(root.right))
+        }
     }
 }
diff --git a/src/main/kotlin/g0601_0700/s0675_cut_off_trees_for_golf_event/Solution.kt b/src/main/kotlin/g0601_0700/s0675_cut_off_trees_for_golf_event/Solution.kt
index ca1177466..1c1db9a14 100644
--- a/src/main/kotlin/g0601_0700/s0675_cut_off_trees_for_golf_event/Solution.kt
+++ b/src/main/kotlin/g0601_0700/s0675_cut_off_trees_for_golf_event/Solution.kt
@@ -36,7 +36,7 @@ class Solution {
         val dirs = arrayOf(intArrayOf(0, 1), intArrayOf(0, -1), intArrayOf(1, 0), intArrayOf(-1, 0))
         val visited = Array(forest.size) {
             BooleanArray(
-                forest[0].size
+                forest[0].size,
             )
         }
         val q: Queue<IntArray> = LinkedList()
diff --git a/src/main/kotlin/g0601_0700/s0684_redundant_connection/Solution.kt b/src/main/kotlin/g0601_0700/s0684_redundant_connection/Solution.kt
index ac207ae6b..753c7229a 100644
--- a/src/main/kotlin/g0601_0700/s0684_redundant_connection/Solution.kt
+++ b/src/main/kotlin/g0601_0700/s0684_redundant_connection/Solution.kt
@@ -29,6 +29,8 @@ class Solution {
     private fun find(x: Int): Int {
         return if (par[x] == x) {
             x
-        } else find(par[x])
+        } else {
+            find(par[x])
+        }
     }
 }
diff --git a/src/main/kotlin/g0601_0700/s0685_redundant_connection_ii/Solution.kt b/src/main/kotlin/g0601_0700/s0685_redundant_connection_ii/Solution.kt
index 748a19060..a6f40fc50 100644
--- a/src/main/kotlin/g0601_0700/s0685_redundant_connection_ii/Solution.kt
+++ b/src/main/kotlin/g0601_0700/s0685_redundant_connection_ii/Solution.kt
@@ -48,6 +48,8 @@ class Solution {
     private fun find(x: Int): Int {
         return if (par[x] == x) {
             x
-        } else find(par[x])
+        } else {
+            find(par[x])
+        }
     }
 }
diff --git a/src/main/kotlin/g0601_0700/s0688_knight_probability_in_chessboard/Solution.kt b/src/main/kotlin/g0601_0700/s0688_knight_probability_in_chessboard/Solution.kt
index aa3e33e28..8b5b86500 100644
--- a/src/main/kotlin/g0601_0700/s0688_knight_probability_in_chessboard/Solution.kt
+++ b/src/main/kotlin/g0601_0700/s0688_knight_probability_in_chessboard/Solution.kt
@@ -11,14 +11,14 @@ class Solution {
         intArrayOf(2, -1),
         intArrayOf(2, 1),
         intArrayOf(1, -2),
-        intArrayOf(-1, -2)
+        intArrayOf(-1, -2),
     )
     private lateinit var probabilityGiven: Array<Array<DoubleArray>>
     fun knightProbability(n: Int, k: Int, row: Int, column: Int): Double {
         probabilityGiven = Array(n) {
             Array(n) {
                 DoubleArray(
-                    k + 1
+                    k + 1,
                 )
             }
         }
diff --git a/src/main/kotlin/g0601_0700/s0691_stickers_to_spell_word/Solution.kt b/src/main/kotlin/g0601_0700/s0691_stickers_to_spell_word/Solution.kt
index c2df26149..e48b079ca 100644
--- a/src/main/kotlin/g0601_0700/s0691_stickers_to_spell_word/Solution.kt
+++ b/src/main/kotlin/g0601_0700/s0691_stickers_to_spell_word/Solution.kt
@@ -24,7 +24,9 @@ class Solution {
         val res = dp(0, target)
         return if (res > target.length) {
             -1
-        } else res
+        } else {
+            res
+        }
     }
 
     private fun dp(bits: Int, target: String): Int {
diff --git a/src/main/kotlin/g0601_0700/s0692_top_k_frequent_words/Solution.kt b/src/main/kotlin/g0601_0700/s0692_top_k_frequent_words/Solution.kt
index bbfc9393f..43f680df4 100644
--- a/src/main/kotlin/g0601_0700/s0692_top_k_frequent_words/Solution.kt
+++ b/src/main/kotlin/g0601_0700/s0692_top_k_frequent_words/Solution.kt
@@ -21,7 +21,7 @@ class Solution {
                 } else {
                     key.compareTo(key1, ignoreCase = true)
                 }
-            }
+            },
         )
         sortedset.addAll(map.entries)
         val result: MutableList<String> = ArrayList()
diff --git a/src/main/kotlin/g0701_0800/s0701_insert_into_a_binary_search_tree/Solution.kt b/src/main/kotlin/g0701_0800/s0701_insert_into_a_binary_search_tree/Solution.kt
index 0e780f7b8..1606f2977 100644
--- a/src/main/kotlin/g0701_0800/s0701_insert_into_a_binary_search_tree/Solution.kt
+++ b/src/main/kotlin/g0701_0800/s0701_insert_into_a_binary_search_tree/Solution.kt
@@ -18,7 +18,7 @@ import com_github_leetcode.TreeNode
 class Solution {
     fun insertIntoBST(
         root: TreeNode?,
-        value: Int
+        value: Int,
     ): TreeNode? {
         if (root == null) {
             return TreeNode(value)
diff --git a/src/main/kotlin/g0701_0800/s0710_random_pick_with_blacklist/Solution.kt b/src/main/kotlin/g0701_0800/s0710_random_pick_with_blacklist/Solution.kt
index 9ec9bd4d6..bdd4ae820 100644
--- a/src/main/kotlin/g0701_0800/s0710_random_pick_with_blacklist/Solution.kt
+++ b/src/main/kotlin/g0701_0800/s0710_random_pick_with_blacklist/Solution.kt
@@ -31,7 +31,9 @@ class Solution(n: Int, blacklist: IntArray) {
         val `val`: Int = Random.nextInt(upperLimit)
         return if (map.containsKey(`val`)) {
             map[`val`]!!
-        } else `val`
+        } else {
+            `val`
+        }
     }
 }
 
diff --git a/src/main/kotlin/g0701_0800/s0726_number_of_atoms/Solution.kt b/src/main/kotlin/g0701_0800/s0726_number_of_atoms/Solution.kt
index e931bf0ec..17b402641 100644
--- a/src/main/kotlin/g0701_0800/s0726_number_of_atoms/Solution.kt
+++ b/src/main/kotlin/g0701_0800/s0726_number_of_atoms/Solution.kt
@@ -7,7 +7,7 @@ class Solution {
     data class Item(
         var title: String = "",
         var total: String = "",
-        var count: Int = 0
+        var count: Int = 0,
     ) {
         fun getT(): String {
             return if (total == "") "1" else total
diff --git a/src/main/kotlin/g0701_0800/s0741_cherry_pickup/Solution.kt b/src/main/kotlin/g0701_0800/s0741_cherry_pickup/Solution.kt
index be30563f2..67a09359c 100644
--- a/src/main/kotlin/g0701_0800/s0741_cherry_pickup/Solution.kt
+++ b/src/main/kotlin/g0701_0800/s0741_cherry_pickup/Solution.kt
@@ -8,7 +8,7 @@ class Solution {
         val dp = Array(grid.size) {
             Array(grid.size) {
                 IntArray(
-                    grid.size
+                    grid.size,
                 )
             }
         }
diff --git a/src/main/kotlin/g0701_0800/s0749_contain_virus/Solution.kt b/src/main/kotlin/g0701_0800/s0749_contain_virus/Solution.kt
index ce5ed4480..ae06bd285 100644
--- a/src/main/kotlin/g0701_0800/s0749_contain_virus/Solution.kt
+++ b/src/main/kotlin/g0701_0800/s0749_contain_virus/Solution.kt
@@ -67,7 +67,7 @@ class Solution {
         islands: MutableMap<Int, MutableSet<Int>>,
         scores: MutableMap<Int, MutableSet<Int>>,
         walls: MutableMap<Int, Int>,
-        id: Int
+        id: Int,
     ) {
         if (!visited.add(i * n + j)) {
             return
@@ -84,7 +84,7 @@ class Solution {
             }
             if (grid[x][y] == 0) {
                 scores.computeIfAbsent(
-                    id
+                    id,
                 ) { HashSet() }.add(x * n + y)
                 walls[id] = walls.getOrDefault(id, 0) + 1
             }
diff --git a/src/main/kotlin/g0701_0800/s0753_cracking_the_safe/Solution.kt b/src/main/kotlin/g0701_0800/s0753_cracking_the_safe/Solution.kt
index 04bde56dc..1834690f5 100644
--- a/src/main/kotlin/g0701_0800/s0753_cracking_the_safe/Solution.kt
+++ b/src/main/kotlin/g0701_0800/s0753_cracking_the_safe/Solution.kt
@@ -27,7 +27,7 @@ class Solution {
         prev: Int,
         visited: BooleanArray,
         visitedCnt: Int,
-        targetCnt: Int
+        targetCnt: Int,
     ) {
         if (foundStr != null) {
             return
diff --git a/src/main/kotlin/g0701_0800/s0757_set_intersection_size_at_least_two/Solution.kt b/src/main/kotlin/g0701_0800/s0757_set_intersection_size_at_least_two/Solution.kt
index a62ee5ea4..6d8028004 100644
--- a/src/main/kotlin/g0701_0800/s0757_set_intersection_size_at_least_two/Solution.kt
+++ b/src/main/kotlin/g0701_0800/s0757_set_intersection_size_at_least_two/Solution.kt
@@ -7,7 +7,9 @@ class Solution {
         intervals.sortWith { a, b ->
             if (a[1] == b[1]) {
                 b[0] - a[0]
-            } else a[1] - b[1]
+            } else {
+                a[1] - b[1]
+            }
         }
         val list: MutableList<Int> = ArrayList()
         list.add(intervals[0][1] - 1)
diff --git a/src/main/kotlin/g0701_0800/s0761_special_binary_string/Solution.kt b/src/main/kotlin/g0701_0800/s0761_special_binary_string/Solution.kt
index 83d7c1a5b..1fac584bf 100644
--- a/src/main/kotlin/g0701_0800/s0761_special_binary_string/Solution.kt
+++ b/src/main/kotlin/g0701_0800/s0761_special_binary_string/Solution.kt
@@ -11,7 +11,7 @@ class Solution {
         }
         val pq = PriorityQueue { a: String?, b: String? ->
             b!!.compareTo(
-                a!!
+                a!!,
             )
         }
         var acc = 1
diff --git a/src/main/kotlin/g0701_0800/s0764_largest_plus_sign/Solution.kt b/src/main/kotlin/g0701_0800/s0764_largest_plus_sign/Solution.kt
index 38cce3b27..64cc5af00 100644
--- a/src/main/kotlin/g0701_0800/s0764_largest_plus_sign/Solution.kt
+++ b/src/main/kotlin/g0701_0800/s0764_largest_plus_sign/Solution.kt
@@ -30,7 +30,7 @@ class Solution {
                 val i2 = if (i == n - 1) 0 else down[i + 1][j]
                 down[i][j] = if (mat[i][j]) 0 else 1 + i2
                 val x = left[i][j].coerceAtMost(up[i][j]).coerceAtMost(
-                    right[i][j].coerceAtMost(down[i][j])
+                    right[i][j].coerceAtMost(down[i][j]),
                 )
                 ans = ans.coerceAtLeast(x)
             }
diff --git a/src/main/kotlin/g0701_0800/s0770_basic_calculator_iv/Solution.kt b/src/main/kotlin/g0701_0800/s0770_basic_calculator_iv/Solution.kt
index 2618291c0..24c7ae03c 100644
--- a/src/main/kotlin/g0701_0800/s0770_basic_calculator_iv/Solution.kt
+++ b/src/main/kotlin/g0701_0800/s0770_basic_calculator_iv/Solution.kt
@@ -69,7 +69,7 @@ class Solution {
             val ans: MutableList<String> = ArrayList()
             val keys: List<List<String>> = ArrayList(mem.keys)
             Collections.sort(
-                keys
+                keys,
             ) { a: List<String>, b: List<String> ->
                 if (a.size != b.size) {
                     return@sort b.size - a.size
diff --git a/src/main/kotlin/g0701_0800/s0778_swim_in_rising_water/Solution.kt b/src/main/kotlin/g0701_0800/s0778_swim_in_rising_water/Solution.kt
index 616382bc3..13c2711f1 100644
--- a/src/main/kotlin/g0701_0800/s0778_swim_in_rising_water/Solution.kt
+++ b/src/main/kotlin/g0701_0800/s0778_swim_in_rising_water/Solution.kt
@@ -43,7 +43,7 @@ class Solution {
         // boolean array to keep track of visited cells
         val visited = Array(grid.size) {
             BooleanArray(
-                grid[0].size
+                grid[0].size,
             )
         }
         // we start from top left corner
diff --git a/src/main/kotlin/g0701_0800/s0794_valid_tic_tac_toe_state/Solution.kt b/src/main/kotlin/g0701_0800/s0794_valid_tic_tac_toe_state/Solution.kt
index b8f7192d4..0018c9afa 100644
--- a/src/main/kotlin/g0701_0800/s0794_valid_tic_tac_toe_state/Solution.kt
+++ b/src/main/kotlin/g0701_0800/s0794_valid_tic_tac_toe_state/Solution.kt
@@ -59,6 +59,8 @@ class Solution {
         }
         return if (sum == 0 && !xWin) {
             true
-        } else sum == 1 && !oWin
+        } else {
+            sum == 1 && !oWin
+        }
     }
 }
diff --git a/src/main/kotlin/g0801_0900/s0804_unique_morse_code_words/Solution.kt b/src/main/kotlin/g0801_0900/s0804_unique_morse_code_words/Solution.kt
index ab9e5f6df..9c0461420 100644
--- a/src/main/kotlin/g0801_0900/s0804_unique_morse_code_words/Solution.kt
+++ b/src/main/kotlin/g0801_0900/s0804_unique_morse_code_words/Solution.kt
@@ -7,7 +7,7 @@ class Solution {
         val morse = arrayOf(
             ".-", "-...", "-.-.", "-..", ".", "..-.", "--.", "....", "..", ".---", "-.-", ".-..",
             "--", "-.", "---", ".--.", "--.-", ".-.", "...", "-", "..-", "...-", ".--", "-..-",
-            "-.--", "--.."
+            "-.--", "--..",
         )
         val set: MutableSet<String> = HashSet()
         for (word in words) {
diff --git a/src/main/kotlin/g0801_0900/s0808_soup_servings/Solution.kt b/src/main/kotlin/g0801_0900/s0808_soup_servings/Solution.kt
index fd6e96585..702caecc1 100644
--- a/src/main/kotlin/g0801_0900/s0808_soup_servings/Solution.kt
+++ b/src/main/kotlin/g0801_0900/s0808_soup_servings/Solution.kt
@@ -14,7 +14,9 @@ class Solution {
         n = n / 25 + if (n % 25 > 0) 1 else 0
         return if (n >= 500) {
             1.0
-        } else find(n, n, Array(n + 1) { arrayOfNulls(n + 1) })
+        } else {
+            find(n, n, Array(n + 1) { arrayOfNulls(n + 1) })
+        }
     }
 
     private fun find(a: Int, b: Int, mem: Array<Array<Double?>>): Double {
diff --git a/src/main/kotlin/g0801_0900/s0814_binary_tree_pruning/Solution.kt b/src/main/kotlin/g0801_0900/s0814_binary_tree_pruning/Solution.kt
index 4ef05901a..8effe1189 100644
--- a/src/main/kotlin/g0801_0900/s0814_binary_tree_pruning/Solution.kt
+++ b/src/main/kotlin/g0801_0900/s0814_binary_tree_pruning/Solution.kt
@@ -24,6 +24,8 @@ class Solution {
         root.right = pruneTree(root.right)
         return if (root.left == null && root.right == null && root.`val` == 0) {
             null
-        } else root
+        } else {
+            root
+        }
     }
 }
diff --git a/src/main/kotlin/g0801_0900/s0815_bus_routes/Solution.kt b/src/main/kotlin/g0801_0900/s0815_bus_routes/Solution.kt
index fbfd72dc3..481bcfb29 100644
--- a/src/main/kotlin/g0801_0900/s0815_bus_routes/Solution.kt
+++ b/src/main/kotlin/g0801_0900/s0815_bus_routes/Solution.kt
@@ -44,7 +44,7 @@ class Solution {
         target: Int,
         queue: Queue<Int>,
         targetRoutes: MutableSet<Int>,
-        taken: BooleanArray
+        taken: BooleanArray,
     ): Array<ArrayList<Int>?> {
         val len = routes.size
         val graph: Array<ArrayList<Int>?> = arrayOfNulls(len)
diff --git a/src/main/kotlin/g0801_0900/s0816_ambiguous_coordinates/Solution.kt b/src/main/kotlin/g0801_0900/s0816_ambiguous_coordinates/Solution.kt
index b8f4ebc1f..33966452a 100644
--- a/src/main/kotlin/g0801_0900/s0816_ambiguous_coordinates/Solution.kt
+++ b/src/main/kotlin/g0801_0900/s0816_ambiguous_coordinates/Solution.kt
@@ -34,7 +34,7 @@ class Solution {
                                 dp1Idx,
                                 commaPos,
                                 sc.size - 2,
-                                dp2Idx
+                                dp2Idx,
                             )
                         }
                     }
@@ -60,7 +60,7 @@ class Solution {
         dp1Idx: Int,
         start2Idx: Int,
         last2Idx: Int,
-        dp2Idx: Int
+        dp2Idx: Int,
     ) {
         sb.setLength(0)
         sb.append('(')
diff --git a/src/main/kotlin/g0801_0900/s0835_image_overlap/Solution.kt b/src/main/kotlin/g0801_0900/s0835_image_overlap/Solution.kt
index 0cc7aa037..9ec4325ff 100644
--- a/src/main/kotlin/g0801_0900/s0835_image_overlap/Solution.kt
+++ b/src/main/kotlin/g0801_0900/s0835_image_overlap/Solution.kt
@@ -15,7 +15,7 @@ class Solution {
                     for (i in -1 * veti until n) {
                         curOverLapping += if (hori < 0) {
                             Integer.bitCount(
-                                bits1[i] shl -1 * hori and bits2[i - -1 * veti]
+                                bits1[i] shl -1 * hori and bits2[i - -1 * veti],
                             )
                         } else {
                             Integer.bitCount(bits1[i] shr hori and bits2[i - -1 * veti])
diff --git a/src/main/kotlin/g0801_0900/s0840_magic_squares_in_grid/Solution.kt b/src/main/kotlin/g0801_0900/s0840_magic_squares_in_grid/Solution.kt
index 5e0b0ad4c..62ecf2357 100644
--- a/src/main/kotlin/g0801_0900/s0840_magic_squares_in_grid/Solution.kt
+++ b/src/main/kotlin/g0801_0900/s0840_magic_squares_in_grid/Solution.kt
@@ -16,8 +16,8 @@ class Solution {
                     sum == grid[i][j + 1] + grid[i + 1][j + 1] + grid[i + 2][j + 1] && sum == grid[i][j + 2] +
                     grid[i + 1][j + 2] + grid[i + 2][j + 2] && sum == grid[i][j] + grid[i + 1][j + 1] +
                     grid[i + 2][j + 2] && sum == grid[i][j + 2] + grid[i + 1][j + 1] + grid[i + 2][j] && set.add(
-                            grid[i][j]
-                        ) &&
+                        grid[i][j],
+                    ) &&
                     isLegit(grid[i][j]) &&
                     set.add(grid[i][j + 1]) &&
                     isLegit(grid[i][j + 1]) &&
diff --git a/src/main/kotlin/g0801_0900/s0847_shortest_path_visiting_all_nodes/Solution.kt b/src/main/kotlin/g0801_0900/s0847_shortest_path_visiting_all_nodes/Solution.kt
index 0316762ab..29fe1ab00 100644
--- a/src/main/kotlin/g0801_0900/s0847_shortest_path_visiting_all_nodes/Solution.kt
+++ b/src/main/kotlin/g0801_0900/s0847_shortest_path_visiting_all_nodes/Solution.kt
@@ -18,7 +18,7 @@ class Solution {
         var steps = 0
         val visited = Array(graph.size) {
             BooleanArray(
-                target + 1
+                target + 1,
             )
         }
         while (q.isNotEmpty()) {
diff --git a/src/main/kotlin/g0801_0900/s0850_rectangle_area_ii/Solution.kt b/src/main/kotlin/g0801_0900/s0850_rectangle_area_ii/Solution.kt
index 1f8a43ffb..7bf4e7c6d 100644
--- a/src/main/kotlin/g0801_0900/s0850_rectangle_area_ii/Solution.kt
+++ b/src/main/kotlin/g0801_0900/s0850_rectangle_area_ii/Solution.kt
@@ -40,9 +40,9 @@ class Solution {
                     rectangle[0].coerceAtLeast(cur[0]),
                     rectangle[1],
                     rectangle[2].coerceAtMost(cur[2]),
-                    cur[1]
+                    cur[1],
                 ),
-                memo
+                memo,
             )
         }
         if (rectangle[3] > cur[3]) {
@@ -52,9 +52,9 @@ class Solution {
                     rectangle[0].coerceAtLeast(cur[0]),
                     cur[3],
                     rectangle[2].coerceAtMost(cur[2]),
-                    rectangle[3]
+                    rectangle[3],
                 ),
-                memo
+                memo,
             )
         }
     }
diff --git a/src/main/kotlin/g0801_0900/s0855_exam_room/ExamRoom.kt b/src/main/kotlin/g0801_0900/s0855_exam_room/ExamRoom.kt
index 370625712..e43d50dd1 100644
--- a/src/main/kotlin/g0801_0900/s0855_exam_room/ExamRoom.kt
+++ b/src/main/kotlin/g0801_0900/s0855_exam_room/ExamRoom.kt
@@ -65,7 +65,9 @@ class ExamRoom() {
         }
         return if (right > max) {
             Node(n - 1, map).insert(tail.pre)
-        } else Node(maxAt, map).insert(maxAtLeft)
+        } else {
+            Node(maxAt, map).insert(maxAtLeft)
+        }
     }
 
     fun leave(p: Int) {
diff --git a/src/main/kotlin/g0801_0900/s0865_smallest_subtree_with_all_the_deepest_nodes/Solution.kt b/src/main/kotlin/g0801_0900/s0865_smallest_subtree_with_all_the_deepest_nodes/Solution.kt
index 0752d0c5f..77080f88b 100644
--- a/src/main/kotlin/g0801_0900/s0865_smallest_subtree_with_all_the_deepest_nodes/Solution.kt
+++ b/src/main/kotlin/g0801_0900/s0865_smallest_subtree_with_all_the_deepest_nodes/Solution.kt
@@ -43,7 +43,9 @@ class Solution {
         val rightLca: TreeNode? = lca(root.right, left, right)
         return if (leftLca != null && rightLca != null) {
             root
-        } else leftLca ?: rightLca
+        } else {
+            leftLca ?: rightLca
+        }
     }
 
     private fun deep(root: TreeNode?, level: Int) {
diff --git a/src/main/kotlin/g0801_0900/s0867_transpose_matrix/Solution.kt b/src/main/kotlin/g0801_0900/s0867_transpose_matrix/Solution.kt
index 2da2ac852..123cc0711 100644
--- a/src/main/kotlin/g0801_0900/s0867_transpose_matrix/Solution.kt
+++ b/src/main/kotlin/g0801_0900/s0867_transpose_matrix/Solution.kt
@@ -6,7 +6,7 @@ class Solution {
     fun transpose(input: Array<IntArray>): Array<IntArray> {
         val output = Array(input[0].size) {
             IntArray(
-                input.size
+                input.size,
             )
         }
         var i = 0
diff --git a/src/main/kotlin/g0801_0900/s0874_walking_robot_simulation/Solution.kt b/src/main/kotlin/g0801_0900/s0874_walking_robot_simulation/Solution.kt
index e4d1f11d5..78cac9403 100644
--- a/src/main/kotlin/g0801_0900/s0874_walking_robot_simulation/Solution.kt
+++ b/src/main/kotlin/g0801_0900/s0874_walking_robot_simulation/Solution.kt
@@ -52,7 +52,7 @@ class Solution {
             override fun turnRight(): Direction {
                 return NORTH
             }
-        };
+        }, ;
 
         abstract fun turnLeft(): Direction
         abstract fun turnRight(): Direction
diff --git a/src/main/kotlin/g0801_0900/s0881_boats_to_save_people/Solution.kt b/src/main/kotlin/g0801_0900/s0881_boats_to_save_people/Solution.kt
index 52ca14bb2..754d9848f 100644
--- a/src/main/kotlin/g0801_0900/s0881_boats_to_save_people/Solution.kt
+++ b/src/main/kotlin/g0801_0900/s0881_boats_to_save_people/Solution.kt
@@ -21,6 +21,8 @@ class Solution {
         }
         return if (i == j) {
             boats + 1
-        } else boats
+        } else {
+            boats
+        }
     }
 }
diff --git a/src/main/kotlin/g0801_0900/s0882_reachable_nodes_in_subdivided_graph/Solution.kt b/src/main/kotlin/g0801_0900/s0882_reachable_nodes_in_subdivided_graph/Solution.kt
index 09e3ddff3..3dfa22912 100644
--- a/src/main/kotlin/g0801_0900/s0882_reachable_nodes_in_subdivided_graph/Solution.kt
+++ b/src/main/kotlin/g0801_0900/s0882_reachable_nodes_in_subdivided_graph/Solution.kt
@@ -30,7 +30,7 @@ class Solution {
                     if (cNodeDist <= maxMoves) pQueue.add(intArrayOf(cNode, cNodeDist))
                 } else {
                     res += (weight - (maxMoves - minDis[cNode]).coerceAtMost(weight)).coerceAtMost(
-                        (maxMoves - dist).coerceAtMost(weight)
+                        (maxMoves - dist).coerceAtMost(weight),
                     )
                 }
             }
diff --git a/src/main/kotlin/g0801_0900/s0889_construct_binary_tree_from_preorder_and_postorder_traversal/Solution.kt b/src/main/kotlin/g0801_0900/s0889_construct_binary_tree_from_preorder_and_postorder_traversal/Solution.kt
index 22d30ee29..3c2e64fdb 100644
--- a/src/main/kotlin/g0801_0900/s0889_construct_binary_tree_from_preorder_and_postorder_traversal/Solution.kt
+++ b/src/main/kotlin/g0801_0900/s0889_construct_binary_tree_from_preorder_and_postorder_traversal/Solution.kt
@@ -19,7 +19,9 @@ class Solution {
     fun constructFromPrePost(preorder: IntArray, postorder: IntArray): TreeNode? {
         return if (preorder.isEmpty() || preorder.size != postorder.size) {
             null
-        } else buildTree(preorder, 0, preorder.size - 1, postorder, 0, postorder.size - 1)
+        } else {
+            buildTree(preorder, 0, preorder.size - 1, postorder, 0, postorder.size - 1)
+        }
     }
 
     private fun buildTree(
@@ -28,7 +30,7 @@ class Solution {
         preEnd: Int,
         postorder: IntArray,
         postStart: Int,
-        postEnd: Int
+        postEnd: Int,
     ): TreeNode? {
         if (preStart > preEnd || postStart > postEnd) {
             return null
@@ -51,7 +53,7 @@ class Solution {
             preStart + offset - postStart + 1,
             postorder,
             postStart,
-            offset
+            offset,
         )
         root.right = buildTree(
             preorder,
@@ -59,7 +61,7 @@ class Solution {
             preEnd,
             postorder,
             offset + 1,
-            postEnd - 1
+            postEnd - 1,
         )
         return root
     }
diff --git a/src/main/kotlin/g0801_0900/s0891_sum_of_subsequence_widths/Solution.kt b/src/main/kotlin/g0801_0900/s0891_sum_of_subsequence_widths/Solution.kt
index 73d669b77..9827e7181 100644
--- a/src/main/kotlin/g0801_0900/s0891_sum_of_subsequence_widths/Solution.kt
+++ b/src/main/kotlin/g0801_0900/s0891_sum_of_subsequence_widths/Solution.kt
@@ -26,7 +26,7 @@ class Solution {
         + nums[1]*(pow[1]-1) + nums[2]*(pow[2]-1) + .... + nums[5]*(pow[5]-1)
 
         (-1)*A[i]*(pow[l-1-i]-1) + A[i]*(pow[i]-1)
-    */
+     */
     fun sumSubseqWidths(nums: IntArray): Int {
         val mod = 1000000007
         nums.sort()
diff --git a/src/main/kotlin/g0901_1000/s0907_sum_of_subarray_minimums/Solution.kt b/src/main/kotlin/g0901_1000/s0907_sum_of_subarray_minimums/Solution.kt
index a4c7d7610..c95033cce 100644
--- a/src/main/kotlin/g0901_1000/s0907_sum_of_subarray_minimums/Solution.kt
+++ b/src/main/kotlin/g0901_1000/s0907_sum_of_subarray_minimums/Solution.kt
@@ -10,7 +10,9 @@ class Solution {
         }
         return if (arr[start] < arr[i]) {
             0
-        } else (1 + right[start] + calculateRight(i, start + right[start] + 1, right, arr, len)) % MOD
+        } else {
+            (1 + right[start] + calculateRight(i, start + right[start] + 1, right, arr, len)) % MOD
+        }
     }
 
     private fun calculateLeft(i: Int, start: Int, left: IntArray, arr: IntArray, len: Int): Int {
@@ -19,7 +21,9 @@ class Solution {
         }
         return if (arr[start] <= arr[i]) {
             0
-        } else (1 + left[start] + calculateLeft(i, start - left[start] - 1, left, arr, len)) % MOD
+        } else {
+            (1 + left[start] + calculateLeft(i, start - left[start] - 1, left, arr, len)) % MOD
+        }
     }
 
     fun sumSubarrayMins(arr: IntArray): Int {
diff --git a/src/main/kotlin/g0901_1000/s0908_smallest_range_i/Solution.kt b/src/main/kotlin/g0901_1000/s0908_smallest_range_i/Solution.kt
index c44f05fb0..8d34c5cbe 100644
--- a/src/main/kotlin/g0901_1000/s0908_smallest_range_i/Solution.kt
+++ b/src/main/kotlin/g0901_1000/s0908_smallest_range_i/Solution.kt
@@ -12,6 +12,8 @@ class Solution {
         }
         return if (min + k >= max - k) {
             0
-        } else max - k - (min + k)
+        } else {
+            max - k - (min + k)
+        }
     }
 }
diff --git a/src/main/kotlin/g0901_1000/s0913_cat_and_mouse/Solution.kt b/src/main/kotlin/g0901_1000/s0913_cat_and_mouse/Solution.kt
index b050450ca..a759d0f7a 100644
--- a/src/main/kotlin/g0901_1000/s0913_cat_and_mouse/Solution.kt
+++ b/src/main/kotlin/g0901_1000/s0913_cat_and_mouse/Solution.kt
@@ -12,14 +12,14 @@ class Solution {
         val states = Array(n) {
             Array(n) {
                 IntArray(
-                    2
+                    2,
                 )
             }
         }
         val degree = Array(n) {
             Array(n) {
                 IntArray(
-                    2
+                    2,
                 )
             }
         }
diff --git a/src/main/kotlin/g0901_1000/s0914_x_of_a_kind_in_a_deck_of_cards/Solution.kt b/src/main/kotlin/g0901_1000/s0914_x_of_a_kind_in_a_deck_of_cards/Solution.kt
index 0a81bafd3..04d5a2e55 100644
--- a/src/main/kotlin/g0901_1000/s0914_x_of_a_kind_in_a_deck_of_cards/Solution.kt
+++ b/src/main/kotlin/g0901_1000/s0914_x_of_a_kind_in_a_deck_of_cards/Solution.kt
@@ -23,6 +23,8 @@ class Solution {
     private fun gcd(a: Int, b: Int): Int {
         return if (b == 0) {
             a
-        } else gcd(b, a % b)
+        } else {
+            gcd(b, a % b)
+        }
     }
 }
diff --git a/src/main/kotlin/g0901_1000/s0934_shortest_bridge/Solution.kt b/src/main/kotlin/g0901_1000/s0934_shortest_bridge/Solution.kt
index d3427b474..ac0df497d 100644
--- a/src/main/kotlin/g0901_1000/s0934_shortest_bridge/Solution.kt
+++ b/src/main/kotlin/g0901_1000/s0934_shortest_bridge/Solution.kt
@@ -14,7 +14,7 @@ class Solution {
         var flag = false
         val visited = Array(grid.size) {
             BooleanArray(
-                grid[0].size
+                grid[0].size,
             )
         }
         var i = 0
diff --git a/src/main/kotlin/g0901_1000/s0937_reorder_data_in_log_files/Solution.kt b/src/main/kotlin/g0901_1000/s0937_reorder_data_in_log_files/Solution.kt
index 5cca16c3a..c4643b755 100644
--- a/src/main/kotlin/g0901_1000/s0937_reorder_data_in_log_files/Solution.kt
+++ b/src/main/kotlin/g0901_1000/s0937_reorder_data_in_log_files/Solution.kt
@@ -26,7 +26,7 @@ class Solution {
                     return@Comparator firstWord1.compareTo(secondWord1)
                 }
                 firstWord.compareTo(secondWord)
-            }
+            },
         )
         val result = arrayOfNulls<String>(digi.size + word.size)
         var `in` = 0
diff --git a/src/main/kotlin/g0901_1000/s0939_minimum_area_rectangle/Solution.kt b/src/main/kotlin/g0901_1000/s0939_minimum_area_rectangle/Solution.kt
index e17587ad8..5875a7b55 100644
--- a/src/main/kotlin/g0901_1000/s0939_minimum_area_rectangle/Solution.kt
+++ b/src/main/kotlin/g0901_1000/s0939_minimum_area_rectangle/Solution.kt
@@ -16,10 +16,14 @@ class Solution {
             map.getValue(p[0]).add(p[1])
         }
         points.sortWith { a: IntArray, b: IntArray ->
-            if (a[0] == b[0]) Integer.compare(
-                a[1],
-                b[1]
-            ) else Integer.compare(a[0], b[0])
+            if (a[0] == b[0]) {
+                Integer.compare(
+                    a[1],
+                    b[1],
+                )
+            } else {
+                Integer.compare(a[0], b[0])
+            }
         }
         var min = Int.MAX_VALUE
         for (i in 0 until points.size - 2) {
diff --git a/src/main/kotlin/g0901_1000/s0943_find_the_shortest_superstring/Solution.kt b/src/main/kotlin/g0901_1000/s0943_find_the_shortest_superstring/Solution.kt
index e7130df81..438564e8b 100644
--- a/src/main/kotlin/g0901_1000/s0943_find_the_shortest_superstring/Solution.kt
+++ b/src/main/kotlin/g0901_1000/s0943_find_the_shortest_superstring/Solution.kt
@@ -19,7 +19,7 @@ class Solution {
         state: Int,
         startWord: String,
         map: MutableMap<String?, String?>,
-        l: Int
+        l: Int,
     ): String? {
         val key = "$startWord|$state"
         if (state == 0) {
@@ -60,7 +60,9 @@ class Solution {
                 if (word[i] == result[j]) {
                     i++
                     j++
-                } else break
+                } else {
+                    break
+                }
             }
             if (i == l) {
                 found = k
diff --git a/src/main/kotlin/g0901_1000/s0951_flip_equivalent_binary_trees/Solution.kt b/src/main/kotlin/g0901_1000/s0951_flip_equivalent_binary_trees/Solution.kt
index 058010d1b..f33f83f03 100644
--- a/src/main/kotlin/g0901_1000/s0951_flip_equivalent_binary_trees/Solution.kt
+++ b/src/main/kotlin/g0901_1000/s0951_flip_equivalent_binary_trees/Solution.kt
@@ -25,7 +25,9 @@ class Solution {
         }
         return if (root1.`val` != root2.`val`) {
             false
-        } else flipEquiv(root1.left, root2.left) && flipEquiv(root1.right, root2.right) ||
-            flipEquiv(root1.left, root2.right) && flipEquiv(root1.right, root2.left)
+        } else {
+            flipEquiv(root1.left, root2.left) && flipEquiv(root1.right, root2.right) ||
+                flipEquiv(root1.left, root2.right) && flipEquiv(root1.right, root2.left)
+        }
     }
 }
diff --git a/src/main/kotlin/g0901_1000/s0954_array_of_doubled_pairs/Solution.kt b/src/main/kotlin/g0901_1000/s0954_array_of_doubled_pairs/Solution.kt
index 690836bdf..fe9858cd8 100644
--- a/src/main/kotlin/g0901_1000/s0954_array_of_doubled_pairs/Solution.kt
+++ b/src/main/kotlin/g0901_1000/s0954_array_of_doubled_pairs/Solution.kt
@@ -18,7 +18,9 @@ class Solution {
         }
         return if (positive[0] % 2 != 0) {
             false
-        } else validateFrequencies(positive, max) && validateFrequencies(negative, -min)
+        } else {
+            validateFrequencies(positive, max) && validateFrequencies(negative, -min)
+        }
     }
 
     private fun validateFrequencies(frequencies: IntArray, limit: Int): Boolean {
diff --git a/src/main/kotlin/g0901_1000/s0963_minimum_area_rectangle_ii/Solution.kt b/src/main/kotlin/g0901_1000/s0963_minimum_area_rectangle_ii/Solution.kt
index 67571e90b..f3a867946 100644
--- a/src/main/kotlin/g0901_1000/s0963_minimum_area_rectangle_ii/Solution.kt
+++ b/src/main/kotlin/g0901_1000/s0963_minimum_area_rectangle_ii/Solution.kt
@@ -47,7 +47,7 @@ class Solution {
         val second = points[j]
         val third = points[k]
         return abs(
-            first[0] * (second[1] - third[1]) + second[0] * (third[1] - first[1]) + third[0] * (first[1] - second[1])
+            first[0] * (second[1] - third[1]) + second[0] * (third[1] - first[1]) + third[0] * (first[1] - second[1]),
         ).toDouble()
     }
 }
diff --git a/src/main/kotlin/g0901_1000/s0964_least_operators_to_express_number/Solution.kt b/src/main/kotlin/g0901_1000/s0964_least_operators_to_express_number/Solution.kt
index 97a45f410..430421362 100644
--- a/src/main/kotlin/g0901_1000/s0964_least_operators_to_express_number/Solution.kt
+++ b/src/main/kotlin/g0901_1000/s0964_least_operators_to_express_number/Solution.kt
@@ -9,7 +9,9 @@ class Solution {
         this.x = x
         return if (x == target) {
             0
-        } else dfs(0, target.toLong()) - 1
+        } else {
+            dfs(0, target.toLong()) - 1
+        }
     }
 
     // ax^0 + bx^1 + cx^2 +....
diff --git a/src/main/kotlin/g0901_1000/s0966_vowel_spellchecker/Solution.kt b/src/main/kotlin/g0901_1000/s0966_vowel_spellchecker/Solution.kt
index 57cdeb436..7af1c2517 100644
--- a/src/main/kotlin/g0901_1000/s0966_vowel_spellchecker/Solution.kt
+++ b/src/main/kotlin/g0901_1000/s0966_vowel_spellchecker/Solution.kt
@@ -29,7 +29,9 @@ class Solution {
         word = removeVowels(word)
         return if (vowelErrors!!.containsKey(word)) {
             vowelErrors!![word]
-        } else ""
+        } else {
+            ""
+        }
     }
 
     fun spellchecker(wordlist: Array<String>, queries: Array<String>): Array<String?> {
diff --git a/src/main/kotlin/g0901_1000/s0968_binary_tree_cameras/Solution.kt b/src/main/kotlin/g0901_1000/s0968_binary_tree_cameras/Solution.kt
index de45dacdc..16c656aa2 100644
--- a/src/main/kotlin/g0901_1000/s0968_binary_tree_cameras/Solution.kt
+++ b/src/main/kotlin/g0901_1000/s0968_binary_tree_cameras/Solution.kt
@@ -46,7 +46,9 @@ class Solution {
         return if (leftChildState == 0 || rightChildState == 0) {
             // gets covered by the children
             1
-        } else -1
+        } else {
+            -1
+        }
         // needs a camera
     }
 }
diff --git a/src/main/kotlin/g0901_1000/s0983_minimum_cost_for_tickets/Solution.kt b/src/main/kotlin/g0901_1000/s0983_minimum_cost_for_tickets/Solution.kt
index f36b9606a..165771331 100644
--- a/src/main/kotlin/g0901_1000/s0983_minimum_cost_for_tickets/Solution.kt
+++ b/src/main/kotlin/g0901_1000/s0983_minimum_cost_for_tickets/Solution.kt
@@ -13,9 +13,9 @@ class Solution {
                     getNext(
                         days,
                         i,
-                        days[i] + 6
-                    )
-                ]
+                        days[i] + 6,
+                    ),
+                ],
             ).coerceAtMost(costs[2] + memo[getNext(days, i, days[i] + 29)])
         }
         return memo[0]
diff --git a/src/main/kotlin/g0901_1000/s0987_vertical_order_traversal_of_a_binary_tree/Solution.kt b/src/main/kotlin/g0901_1000/s0987_vertical_order_traversal_of_a_binary_tree/Solution.kt
index d60165072..522de8906 100644
--- a/src/main/kotlin/g0901_1000/s0987_vertical_order_traversal_of_a_binary_tree/Solution.kt
+++ b/src/main/kotlin/g0901_1000/s0987_vertical_order_traversal_of_a_binary_tree/Solution.kt
@@ -40,7 +40,8 @@ class Solution {
             return
         }
         map.putIfAbsent(
-            c, PriorityQueue { a: Node, b: Node -> if (a.row != b.row) a.row - b.row else a.`val` - b.`val` }
+            c,
+            PriorityQueue { a: Node, b: Node -> if (a.row != b.row) a.row - b.row else a.`val` - b.`val` },
         )
         map.getValue(c).add(Node(r, cur.`val`))
         helper(cur.left, map, r + 1, c - 1)
diff --git a/src/main/kotlin/g0901_1000/s0993_cousins_in_binary_tree/Solution.kt b/src/main/kotlin/g0901_1000/s0993_cousins_in_binary_tree/Solution.kt
index fcc89d156..99c1fed6b 100644
--- a/src/main/kotlin/g0901_1000/s0993_cousins_in_binary_tree/Solution.kt
+++ b/src/main/kotlin/g0901_1000/s0993_cousins_in_binary_tree/Solution.kt
@@ -51,7 +51,9 @@ class Solution {
         }
         return if (root.left == null || root.right == null) {
             false
-        } else root.left!!.`val` == x && root.right!!.`val` == y ||
-            root.right!!.`val` == x && root.left!!.`val` == y
+        } else {
+            root.left!!.`val` == x && root.right!!.`val` == y ||
+                root.right!!.`val` == x && root.left!!.`val` == y
+        }
     }
 }
diff --git a/src/main/kotlin/g1001_1100/s1024_video_stitching/Solution.kt b/src/main/kotlin/g1001_1100/s1024_video_stitching/Solution.kt
index 77e38de84..89d58170b 100644
--- a/src/main/kotlin/g1001_1100/s1024_video_stitching/Solution.kt
+++ b/src/main/kotlin/g1001_1100/s1024_video_stitching/Solution.kt
@@ -7,7 +7,11 @@ class Solution {
     fun videoStitching(clips: Array<IntArray>, time: Int): Int {
         clips.sortWith { a: IntArray, b: IntArray ->
             if (a[0] == b[0]
-            ) a[1] - b[1] else a[0] - b[0]
+            ) {
+                a[1] - b[1]
+            } else {
+                a[0] - b[0]
+            }
         }
         var count = 0
         var covered = 0
diff --git a/src/main/kotlin/g1001_1100/s1030_matrix_cells_in_distance_order/Solution.kt b/src/main/kotlin/g1001_1100/s1030_matrix_cells_in_distance_order/Solution.kt
index 6c24b3c74..98e0dc554 100644
--- a/src/main/kotlin/g1001_1100/s1030_matrix_cells_in_distance_order/Solution.kt
+++ b/src/main/kotlin/g1001_1100/s1030_matrix_cells_in_distance_order/Solution.kt
@@ -12,7 +12,7 @@ class Solution {
         for (i in 0 until rows) {
             for (j in 0 until cols) {
                 map.computeIfAbsent(
-                    abs(i - rCenter) + abs(j - cCenter)
+                    abs(i - rCenter) + abs(j - cCenter),
                 ) { ArrayList() }
                     .add(intArrayOf(i, j))
             }
diff --git a/src/main/kotlin/g1001_1100/s1033_moving_stones_until_consecutive/Solution.kt b/src/main/kotlin/g1001_1100/s1033_moving_stones_until_consecutive/Solution.kt
index 4e6173a75..e4a918b61 100644
--- a/src/main/kotlin/g1001_1100/s1033_moving_stones_until_consecutive/Solution.kt
+++ b/src/main/kotlin/g1001_1100/s1033_moving_stones_until_consecutive/Solution.kt
@@ -9,7 +9,9 @@ class Solution {
         }
         return if (y - x <= 2 || z - y <= 2) {
             1
-        } else 2
+        } else {
+            2
+        }
     }
 
     private fun maxMoves(x: Int, z: Int): Int {
diff --git a/src/main/kotlin/g1001_1100/s1036_escape_a_large_maze/Solution.kt b/src/main/kotlin/g1001_1100/s1036_escape_a_large_maze/Solution.kt
index e1214ffaf..841ff0362 100644
--- a/src/main/kotlin/g1001_1100/s1036_escape_a_large_maze/Solution.kt
+++ b/src/main/kotlin/g1001_1100/s1036_escape_a_large_maze/Solution.kt
@@ -26,7 +26,7 @@ class Solution {
         i: Int,
         j: Int,
         visited: MutableSet<Int>,
-        target: IntArray
+        target: IntArray,
     ): Boolean {
         if (i < 0 || j < 0 || i > 999999 || j > 999999 || blocks.contains(i * 1000000 + j) ||
             visited.contains(i * 1000000 + j)
@@ -39,9 +39,11 @@ class Solution {
         visited.add(i * 1000000 + j)
         return if (visited.size > blocks.size * (blocks.size + 1)) {
             true
-        } else dfs(blocks, start, i + 1, j, visited, target) ||
-            dfs(blocks, start, i - 1, j, visited, target) ||
-            dfs(blocks, start, i, j + 1, visited, target) ||
-            dfs(blocks, start, i, j - 1, visited, target)
+        } else {
+            dfs(blocks, start, i + 1, j, visited, target) ||
+                dfs(blocks, start, i - 1, j, visited, target) ||
+                dfs(blocks, start, i, j + 1, visited, target) ||
+                dfs(blocks, start, i, j - 1, visited, target)
+        }
     }
 }
diff --git a/src/main/kotlin/g1001_1100/s1040_moving_stones_until_consecutive_ii/Solution.kt b/src/main/kotlin/g1001_1100/s1040_moving_stones_until_consecutive_ii/Solution.kt
index ce2a02584..fda1df642 100644
--- a/src/main/kotlin/g1001_1100/s1040_moving_stones_until_consecutive_ii/Solution.kt
+++ b/src/main/kotlin/g1001_1100/s1040_moving_stones_until_consecutive_ii/Solution.kt
@@ -12,8 +12,11 @@ class Solution {
         val high = (a[n - 1] - n + 2 - a[1]).coerceAtLeast(a[n - 2] - a[0] - n + 2)
         for (j in 0 until n) {
             while (a[j] - a[i] >= n) ++i
-            low = if (j - i + 1 == n - 1 && a[j] - a[i] == n - 2) low.coerceAtMost(2)
-            else low.coerceAtMost(n - (j - i + 1))
+            low = if (j - i + 1 == n - 1 && a[j] - a[i] == n - 2) {
+                low.coerceAtMost(2)
+            } else {
+                low.coerceAtMost(n - (j - i + 1))
+            }
         }
         return intArrayOf(low, high)
     }
diff --git a/src/main/kotlin/g1001_1100/s1048_longest_string_chain/Solution.kt b/src/main/kotlin/g1001_1100/s1048_longest_string_chain/Solution.kt
index 0687b5256..63650c1a3 100644
--- a/src/main/kotlin/g1001_1100/s1048_longest_string_chain/Solution.kt
+++ b/src/main/kotlin/g1001_1100/s1048_longest_string_chain/Solution.kt
@@ -24,7 +24,7 @@ class Solution {
     private fun findLongest(
         word: String,
         lenStr: Array<MutableList<String>?>,
-        longest: MutableMap<String?, Int?>
+        longest: MutableMap<String?, Int?>,
     ): Int {
         if (longest.containsKey(word)) {
             return longest[word]!!
diff --git a/src/main/kotlin/g1001_1100/s1071_greatest_common_divisor_of_strings/Solution.kt b/src/main/kotlin/g1001_1100/s1071_greatest_common_divisor_of_strings/Solution.kt
index 032ea69a1..72c9cddfe 100644
--- a/src/main/kotlin/g1001_1100/s1071_greatest_common_divisor_of_strings/Solution.kt
+++ b/src/main/kotlin/g1001_1100/s1071_greatest_common_divisor_of_strings/Solution.kt
@@ -17,6 +17,8 @@ class Solution {
         }
         return if (n > m && str2.substring(0, m) == str1) {
             gcdOfStrings(str2.substring(m), str1)
-        } else ""
+        } else {
+            ""
+        }
     }
 }
diff --git a/src/main/kotlin/g1001_1100/s1080_insufficient_nodes_in_root_to_leaf_paths/Solution.kt b/src/main/kotlin/g1001_1100/s1080_insufficient_nodes_in_root_to_leaf_paths/Solution.kt
index ee16d3e4f..4de348596 100644
--- a/src/main/kotlin/g1001_1100/s1080_insufficient_nodes_in_root_to_leaf_paths/Solution.kt
+++ b/src/main/kotlin/g1001_1100/s1080_insufficient_nodes_in_root_to_leaf_paths/Solution.kt
@@ -26,13 +26,13 @@ class Solution {
                 root.left,
                 limit,
                 sum + root.`val`,
-                root.left == null && root.right == null
+                root.left == null && root.right == null,
             )
             val rightSum = sufficientSubset(
                 root.right,
                 limit,
                 sum + root.`val`,
-                root.left == null && root.right == null
+                root.left == null && root.right == null,
             )
             if (leftSum < limit) {
                 root.left = null
diff --git a/src/main/kotlin/g1001_1100/s1095_find_in_mountain_array/Solution.kt b/src/main/kotlin/g1001_1100/s1095_find_in_mountain_array/Solution.kt
index ca588543a..a6a61ad20 100644
--- a/src/main/kotlin/g1001_1100/s1095_find_in_mountain_array/Solution.kt
+++ b/src/main/kotlin/g1001_1100/s1095_find_in_mountain_array/Solution.kt
@@ -20,7 +20,9 @@ class Solution {
         val leftResult = findInPeakLeft(target, peakIndex, mountainArr)
         return if (leftResult != -1) {
             leftResult
-        } else findInPeakRight(target, peakIndex, mountainArr)
+        } else {
+            findInPeakRight(target, peakIndex, mountainArr)
+        }
     }
 
     private fun findPeak(mountainArray: MountainArray): Int {
diff --git a/src/main/kotlin/g1001_1100/s1096_brace_expansion_ii/Solution.kt b/src/main/kotlin/g1001_1100/s1096_brace_expansion_ii/Solution.kt
index 24f22a8b9..67bac7060 100644
--- a/src/main/kotlin/g1001_1100/s1096_brace_expansion_ii/Solution.kt
+++ b/src/main/kotlin/g1001_1100/s1096_brace_expansion_ii/Solution.kt
@@ -27,8 +27,8 @@ class Solution {
                 // Create set with single element
                 val set: Set<String> = HashSet(
                     listOf(
-                        expression[idx].toString()
-                    )
+                        expression[idx].toString(),
+                    ),
                 )
                 curSet = concatenateSet(curSet, set)
                 idx++
diff --git a/src/main/kotlin/g1101_1200/s1106_parsing_a_boolean_expression/Solution.kt b/src/main/kotlin/g1101_1200/s1106_parsing_a_boolean_expression/Solution.kt
index 3c75297ec..c35b09132 100644
--- a/src/main/kotlin/g1101_1200/s1106_parsing_a_boolean_expression/Solution.kt
+++ b/src/main/kotlin/g1101_1200/s1106_parsing_a_boolean_expression/Solution.kt
@@ -85,7 +85,9 @@ class Solution {
     private fun match(ch: Char): Boolean {
         return if (isAtEnd) {
             false
-        } else peek() == ch
+        } else {
+            peek() == ch
+        }
     }
 
     private fun consume(ch: Char) {
diff --git a/src/main/kotlin/g1101_1200/s1123_lowest_common_ancestor_of_deepest_leaves/Solution.kt b/src/main/kotlin/g1101_1200/s1123_lowest_common_ancestor_of_deepest_leaves/Solution.kt
index a0d81a38d..f17e4b53a 100644
--- a/src/main/kotlin/g1101_1200/s1123_lowest_common_ancestor_of_deepest_leaves/Solution.kt
+++ b/src/main/kotlin/g1101_1200/s1123_lowest_common_ancestor_of_deepest_leaves/Solution.kt
@@ -36,6 +36,8 @@ class Solution {
     fun getDep(root: TreeNode?): Int {
         return if (root == null) {
             0
-        } else 1 + Math.max(getDep(root.left), getDep(root.right))
+        } else {
+            1 + Math.max(getDep(root.left), getDep(root.right))
+        }
     }
 }
diff --git a/src/main/kotlin/g1101_1200/s1129_shortest_path_with_alternating_colors/Solution.kt b/src/main/kotlin/g1101_1200/s1129_shortest_path_with_alternating_colors/Solution.kt
index c0430a51c..4a66ffc31 100644
--- a/src/main/kotlin/g1101_1200/s1129_shortest_path_with_alternating_colors/Solution.kt
+++ b/src/main/kotlin/g1101_1200/s1129_shortest_path_with_alternating_colors/Solution.kt
@@ -15,7 +15,7 @@ class Solution {
         vis: Array<BooleanArray>,
         graph: List<MutableList<Pair>>,
         blue: Boolean,
-        shortestPaths: IntArray
+        shortestPaths: IntArray,
     ) {
         var blue = blue
         var level = 0
diff --git a/src/main/kotlin/g1101_1200/s1145_binary_tree_coloring_game/Solution.kt b/src/main/kotlin/g1101_1200/s1145_binary_tree_coloring_game/Solution.kt
index be4adebde..6a7acac13 100644
--- a/src/main/kotlin/g1101_1200/s1145_binary_tree_coloring_game/Solution.kt
+++ b/src/main/kotlin/g1101_1200/s1145_binary_tree_coloring_game/Solution.kt
@@ -32,6 +32,8 @@ class Solution {
     private fun countNodes(root: TreeNode?): Int {
         return if (root == null) {
             0
-        } else countNodes(root.left) + countNodes(root.right) + 1
+        } else {
+            countNodes(root.left) + countNodes(root.right) + 1
+        }
     }
 }
diff --git a/src/main/kotlin/g1101_1200/s1155_number_of_dice_rolls_with_target_sum/Solution.kt b/src/main/kotlin/g1101_1200/s1155_number_of_dice_rolls_with_target_sum/Solution.kt
index 9f8369f51..0ebe97f85 100644
--- a/src/main/kotlin/g1101_1200/s1155_number_of_dice_rolls_with_target_sum/Solution.kt
+++ b/src/main/kotlin/g1101_1200/s1155_number_of_dice_rolls_with_target_sum/Solution.kt
@@ -10,7 +10,9 @@ class Solution {
         if (diceLeft == 0) {
             return if (targetLeft == 0) {
                 1
-            } else 0
+            } else {
+                0
+            }
         }
         if (memo[diceLeft][targetLeft] == -1) {
             var res = 0
diff --git a/src/main/kotlin/g1101_1200/s1175_prime_arrangements/Solution.kt b/src/main/kotlin/g1101_1200/s1175_prime_arrangements/Solution.kt
index cf119e7dd..0610d0ba3 100644
--- a/src/main/kotlin/g1101_1200/s1175_prime_arrangements/Solution.kt
+++ b/src/main/kotlin/g1101_1200/s1175_prime_arrangements/Solution.kt
@@ -8,7 +8,7 @@ class Solution {
         var n = n
         val a = intArrayOf(
             2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83,
-            89, 97
+            89, 97,
         )
         var c = 0
         while (c < 25 && n >= a[c]) {
diff --git a/src/main/kotlin/g1101_1200/s1189_maximum_number_of_balloons/Solution.kt b/src/main/kotlin/g1101_1200/s1189_maximum_number_of_balloons/Solution.kt
index ee4d90594..bf77d69a1 100644
--- a/src/main/kotlin/g1101_1200/s1189_maximum_number_of_balloons/Solution.kt
+++ b/src/main/kotlin/g1101_1200/s1189_maximum_number_of_balloons/Solution.kt
@@ -11,8 +11,9 @@ class Solution {
         return Math.min(
             counts[0],
             Math.min(
-                counts[1], Math.min(counts[11] / 2, Math.min(counts[14] / 2, counts[13]))
-            )
+                counts[1],
+                Math.min(counts[11] / 2, Math.min(counts[14] / 2, counts[13])),
+            ),
         )
     }
 }
diff --git a/src/main/kotlin/g1101_1200/s1192_critical_connections_in_a_network/Solution.kt b/src/main/kotlin/g1101_1200/s1192_critical_connections_in_a_network/Solution.kt
index dfbe50523..503b29516 100644
--- a/src/main/kotlin/g1101_1200/s1192_critical_connections_in_a_network/Solution.kt
+++ b/src/main/kotlin/g1101_1200/s1192_critical_connections_in_a_network/Solution.kt
@@ -32,7 +32,7 @@ class Solution {
         time: Int,
         parent: Int,
         rank: IntArray,
-        res: MutableList<List<Int>>
+        res: MutableList<List<Int>>,
     ): Int {
         if (rank[node] > 0) {
             return rank[node]
diff --git a/src/main/kotlin/g1201_1300/s1222_queens_that_can_attack_the_king/Solution.kt b/src/main/kotlin/g1201_1300/s1222_queens_that_can_attack_the_king/Solution.kt
index 46745115d..bedc8c77e 100644
--- a/src/main/kotlin/g1201_1300/s1222_queens_that_can_attack_the_king/Solution.kt
+++ b/src/main/kotlin/g1201_1300/s1222_queens_that_can_attack_the_king/Solution.kt
@@ -27,7 +27,7 @@ class Solution {
         x: Int,
         y: Int,
         result: MutableList<List<Int>>,
-        direction: String?
+        direction: String?,
     ) {
         if (x < 0 || x >= 8 || y < 0 || y >= 8) {
             return
diff --git a/src/main/kotlin/g1201_1300/s1226_the_dining_philosophers/DiningPhilosophers.kt b/src/main/kotlin/g1201_1300/s1226_the_dining_philosophers/DiningPhilosophers.kt
index ebe86e3c4..5b5ef975c 100644
--- a/src/main/kotlin/g1201_1300/s1226_the_dining_philosophers/DiningPhilosophers.kt
+++ b/src/main/kotlin/g1201_1300/s1226_the_dining_philosophers/DiningPhilosophers.kt
@@ -15,7 +15,7 @@ class DiningPhilosophers {
         pickRightFork: Runnable,
         eat: Runnable,
         putLeftFork: Runnable,
-        putRightFork: Runnable
+        putRightFork: Runnable,
     ) {
         synchronized(leftFork) {
             synchronized(rightFork) {
diff --git a/src/main/kotlin/g1201_1300/s1227_airplane_seat_assignment_probability/Solution.kt b/src/main/kotlin/g1201_1300/s1227_airplane_seat_assignment_probability/Solution.kt
index b8edf908c..03c1118d6 100644
--- a/src/main/kotlin/g1201_1300/s1227_airplane_seat_assignment_probability/Solution.kt
+++ b/src/main/kotlin/g1201_1300/s1227_airplane_seat_assignment_probability/Solution.kt
@@ -7,6 +7,8 @@ class Solution {
     fun nthPersonGetsNthSeat(n: Int): Double {
         return if (n == 1) {
             1.0
-        } else 0.5
+        } else {
+            0.5
+        }
     }
 }
diff --git a/src/main/kotlin/g1201_1300/s1250_check_if_it_is_a_good_array/Solution.kt b/src/main/kotlin/g1201_1300/s1250_check_if_it_is_a_good_array/Solution.kt
index a5be4e1f5..94fcde57c 100644
--- a/src/main/kotlin/g1201_1300/s1250_check_if_it_is_a_good_array/Solution.kt
+++ b/src/main/kotlin/g1201_1300/s1250_check_if_it_is_a_good_array/Solution.kt
@@ -6,7 +6,9 @@ class Solution {
     private fun gcd(a: Int, b: Int): Int {
         return if (b == 0) {
             a
-        } else gcd(b, a % b)
+        } else {
+            gcd(b, a % b)
+        }
     }
 
     fun isGoodArray(nums: IntArray): Boolean {
diff --git a/src/main/kotlin/g1201_1300/s1275_find_winner_on_a_tic_tac_toe_game/Solution.kt b/src/main/kotlin/g1201_1300/s1275_find_winner_on_a_tic_tac_toe_game/Solution.kt
index 1cf713824..b87dc466b 100644
--- a/src/main/kotlin/g1201_1300/s1275_find_winner_on_a_tic_tac_toe_game/Solution.kt
+++ b/src/main/kotlin/g1201_1300/s1275_find_winner_on_a_tic_tac_toe_game/Solution.kt
@@ -44,7 +44,9 @@ class Solution {
         val str = board[1][1]
         return if (str == board[0][0] && str == board[2][2] || str == board[0][2] && str == board[2][0]) {
             getWinner(str)
-        } else ""
+        } else {
+            ""
+        }
     }
 
     private fun getWinner(str: String?): String {
diff --git a/src/main/kotlin/g1201_1300/s1277_count_square_submatrices_with_all_ones/Solution.kt b/src/main/kotlin/g1201_1300/s1277_count_square_submatrices_with_all_ones/Solution.kt
index def4fa2a3..34578cf0d 100644
--- a/src/main/kotlin/g1201_1300/s1277_count_square_submatrices_with_all_ones/Solution.kt
+++ b/src/main/kotlin/g1201_1300/s1277_count_square_submatrices_with_all_ones/Solution.kt
@@ -18,7 +18,7 @@ class Solution {
                     matrix[i][j] = (
                         Math.min(
                             matrix[i - 1][j - 1],
-                            Math.min(matrix[i - 1][j], matrix[i][j - 1])
+                            Math.min(matrix[i - 1][j], matrix[i][j - 1]),
                         ) +
                             1
                         )
diff --git a/src/main/kotlin/g1201_1300/s1278_palindrome_partitioning_iii/Solution.kt b/src/main/kotlin/g1201_1300/s1278_palindrome_partitioning_iii/Solution.kt
index da2c6268b..ee5402c41 100644
--- a/src/main/kotlin/g1201_1300/s1278_palindrome_partitioning_iii/Solution.kt
+++ b/src/main/kotlin/g1201_1300/s1278_palindrome_partitioning_iii/Solution.kt
@@ -20,7 +20,7 @@ class Solution {
         n: Int,
         k: Int,
         pal: Array<IntArray>,
-        dp: Array<IntArray>
+        dp: Array<IntArray>,
     ): Int {
         if (index == n) {
             return n
diff --git a/src/main/kotlin/g1201_1300/s1286_iterator_for_combination/CombinationIterator.kt b/src/main/kotlin/g1201_1300/s1286_iterator_for_combination/CombinationIterator.kt
index b2f6d66a7..b9db6bdd9 100644
--- a/src/main/kotlin/g1201_1300/s1286_iterator_for_combination/CombinationIterator.kt
+++ b/src/main/kotlin/g1201_1300/s1286_iterator_for_combination/CombinationIterator.kt
@@ -18,7 +18,7 @@ class CombinationIterator(characters: String, private val combinationLength: Int
         characters: String,
         start: Int,
         sb: StringBuilder,
-        visited: BooleanArray
+        visited: BooleanArray,
     ) {
         if (sb.length == combinationLength) {
             list.add(sb.toString())
diff --git a/src/main/kotlin/g1201_1300/s1288_remove_covered_intervals/Solution.kt b/src/main/kotlin/g1201_1300/s1288_remove_covered_intervals/Solution.kt
index 32c547536..47b6e0821 100644
--- a/src/main/kotlin/g1201_1300/s1288_remove_covered_intervals/Solution.kt
+++ b/src/main/kotlin/g1201_1300/s1288_remove_covered_intervals/Solution.kt
@@ -7,7 +7,7 @@ import java.util.Queue
 
 class Solution {
     fun removeCoveredIntervals(intervals: Array<IntArray>): Int {
-        val q: Queue<IntArray> = PriorityQueue { a: IntArray, b: IntArray
+        val q: Queue<IntArray> = PriorityQueue { a: IntArray, b: IntArray,
             ->
             if (a[0] == b[0]) b[1] - a[1] else a[0] - b[0]
         }
diff --git a/src/main/kotlin/g1201_1300/s1291_sequential_digits/Solution.kt b/src/main/kotlin/g1201_1300/s1291_sequential_digits/Solution.kt
index 87e4aaa13..a5689f4dd 100644
--- a/src/main/kotlin/g1201_1300/s1291_sequential_digits/Solution.kt
+++ b/src/main/kotlin/g1201_1300/s1291_sequential_digits/Solution.kt
@@ -7,7 +7,7 @@ class Solution {
         val arr = intArrayOf(
             12, 23, 34, 45, 56, 67, 78, 89, 123, 234, 345, 456, 567, 678, 789, 1234, 2345, 3456,
             4567, 5678, 6789, 12345, 23456, 34567, 45678, 56789, 123456, 234567, 345678, 456789,
-            1234567, 2345678, 3456789, 12345678, 23456789, 123456789
+            1234567, 2345678, 3456789, 12345678, 23456789, 123456789,
         )
         val result: MutableList<Int> = ArrayList()
         for (j in arr) {
diff --git a/src/main/kotlin/g1201_1300/s1292_maximum_side_length_of_a_square_with_sum_less_than_or_equal_to_threshold/Solution.kt b/src/main/kotlin/g1201_1300/s1292_maximum_side_length_of_a_square_with_sum_less_than_or_equal_to_threshold/Solution.kt
index a71a9f007..1e25cf26f 100644
--- a/src/main/kotlin/g1201_1300/s1292_maximum_side_length_of_a_square_with_sum_less_than_or_equal_to_threshold/Solution.kt
+++ b/src/main/kotlin/g1201_1300/s1292_maximum_side_length_of_a_square_with_sum_less_than_or_equal_to_threshold/Solution.kt
@@ -54,7 +54,7 @@ class Solution {
                                 prefix[i][j - length] -
                                 prefix[i - length][j]
                             ) +
-                            prefix[i - length][j - length]
+                            prefix[i - length][j - length],
                     )
                 }
             }
diff --git a/src/main/kotlin/g1201_1300/s1298_maximum_candies_you_can_get_from_boxes/Solution.kt b/src/main/kotlin/g1201_1300/s1298_maximum_candies_you_can_get_from_boxes/Solution.kt
index 6f15ef5e4..3b1974dbd 100644
--- a/src/main/kotlin/g1201_1300/s1298_maximum_candies_you_can_get_from_boxes/Solution.kt
+++ b/src/main/kotlin/g1201_1300/s1298_maximum_candies_you_can_get_from_boxes/Solution.kt
@@ -11,7 +11,7 @@ class Solution {
         candies: IntArray,
         keys: Array<IntArray>,
         containedBoxes: Array<IntArray>,
-        initialBoxes: IntArray
+        initialBoxes: IntArray,
     ): Int {
         var collectedCandies = 0
         val boxes: Queue<Int> = LinkedList()
diff --git a/src/main/kotlin/g1301_1400/s1311_get_watched_videos_by_your_friends/Solution.kt b/src/main/kotlin/g1301_1400/s1311_get_watched_videos_by_your_friends/Solution.kt
index 338ea0cd6..584bb9b70 100644
--- a/src/main/kotlin/g1301_1400/s1311_get_watched_videos_by_your_friends/Solution.kt
+++ b/src/main/kotlin/g1301_1400/s1311_get_watched_videos_by_your_friends/Solution.kt
@@ -18,7 +18,7 @@ class Solution {
         watchedVideos: List<List<String>>,
         friends: Array<IntArray>,
         id: Int,
-        level: Int
+        level: Int,
     ): List<String> {
         val visited = BooleanArray(watchedVideos.size)
         val queue: Queue<Int> = LinkedList()
@@ -51,7 +51,7 @@ class Solution {
                 map[video]!!.count++
             }
         }
-        val pq = PriorityQueue { v1: VideoCount, v2: VideoCount
+        val pq = PriorityQueue { v1: VideoCount, v2: VideoCount,
             ->
             if (v1.count == v2.count) v1.v.compareTo(v2.v) else v1.count - v2.count
         }
diff --git a/src/main/kotlin/g1301_1400/s1315_sum_of_nodes_with_even_valued_grandparent/Solution.kt b/src/main/kotlin/g1301_1400/s1315_sum_of_nodes_with_even_valued_grandparent/Solution.kt
index 01d720ad0..600373622 100644
--- a/src/main/kotlin/g1301_1400/s1315_sum_of_nodes_with_even_valued_grandparent/Solution.kt
+++ b/src/main/kotlin/g1301_1400/s1315_sum_of_nodes_with_even_valued_grandparent/Solution.kt
@@ -20,7 +20,9 @@ class Solution {
     fun sumEvenGrandparent(root: TreeNode?): Int {
         return if (root == null) {
             0
-        } else dfs(root, root.left, 0) + dfs(root, root.right, 0)
+        } else {
+            dfs(root, root.left, 0) + dfs(root, root.right, 0)
+        }
     }
 
     private fun dfs(grandparent: TreeNode?, parent: TreeNode?, sum: Int): Int {
diff --git a/src/main/kotlin/g1301_1400/s1320_minimum_distance_to_type_a_word_using_two_fingers/Solution.kt b/src/main/kotlin/g1301_1400/s1320_minimum_distance_to_type_a_word_using_two_fingers/Solution.kt
index 4e1b75114..d19373931 100644
--- a/src/main/kotlin/g1301_1400/s1320_minimum_distance_to_type_a_word_using_two_fingers/Solution.kt
+++ b/src/main/kotlin/g1301_1400/s1320_minimum_distance_to_type_a_word_using_two_fingers/Solution.kt
@@ -17,7 +17,7 @@ class Solution {
             return 0
         }
         val result = dp[if (f1 == null) 0 else f1.code - 'A'.code + 1][
-            if (f2 == null) 0 else f2.code - 'A'.code + 1
+            if (f2 == null) 0 else f2.code - 'A'.code + 1,
         ][index]
         if (result != null) {
             return result
diff --git a/src/main/kotlin/g1301_1400/s1325_delete_leaves_with_a_given_value/Solution.kt b/src/main/kotlin/g1301_1400/s1325_delete_leaves_with_a_given_value/Solution.kt
index 4b3164d19..ae0424719 100644
--- a/src/main/kotlin/g1301_1400/s1325_delete_leaves_with_a_given_value/Solution.kt
+++ b/src/main/kotlin/g1301_1400/s1325_delete_leaves_with_a_given_value/Solution.kt
@@ -53,6 +53,8 @@ class Solution {
         }
         return if (root.left == null && root.right == null && root.`val` == target) {
             true
-        } else hasTargetLeafNodes(root.left, target) || hasTargetLeafNodes(root.right, target)
+        } else {
+            hasTargetLeafNodes(root.left, target) || hasTargetLeafNodes(root.right, target)
+        }
     }
 }
diff --git a/src/main/kotlin/g1301_1400/s1330_reverse_subarray_to_maximize_array_value/Solution.kt b/src/main/kotlin/g1301_1400/s1330_reverse_subarray_to_maximize_array_value/Solution.kt
index b3a8bb841..d590cc90d 100644
--- a/src/main/kotlin/g1301_1400/s1330_reverse_subarray_to_maximize_array_value/Solution.kt
+++ b/src/main/kotlin/g1301_1400/s1330_reverse_subarray_to_maximize_array_value/Solution.kt
@@ -24,14 +24,14 @@ class Solution {
             diff = Math.max(
                 diff,
                 getAbsoluteDifference(nums[0], nums[i + 1]) -
-                    getAbsoluteDifference(nums[i], nums[i + 1])
+                    getAbsoluteDifference(nums[i], nums[i + 1]),
             )
         }
         for (i in 0 until n - 1) {
             diff = Math.max(
                 diff,
                 getAbsoluteDifference(nums[n - 1], nums[i]) -
-                    getAbsoluteDifference(nums[i + 1], nums[i])
+                    getAbsoluteDifference(nums[i + 1], nums[i]),
             )
         }
         return result + diff
diff --git a/src/main/kotlin/g1301_1400/s1332_remove_palindromic_subsequences/Solution.kt b/src/main/kotlin/g1301_1400/s1332_remove_palindromic_subsequences/Solution.kt
index f6b55184c..bc1980087 100644
--- a/src/main/kotlin/g1301_1400/s1332_remove_palindromic_subsequences/Solution.kt
+++ b/src/main/kotlin/g1301_1400/s1332_remove_palindromic_subsequences/Solution.kt
@@ -9,6 +9,8 @@ class Solution {
         }
         return if (s == StringBuilder(s).reverse().toString()) {
             1
-        } else 2
+        } else {
+            2
+        }
     }
 }
diff --git a/src/main/kotlin/g1301_1400/s1333_filter_restaurants_by_vegan_friendly_price_and_distance/Solution.kt b/src/main/kotlin/g1301_1400/s1333_filter_restaurants_by_vegan_friendly_price_and_distance/Solution.kt
index 0f2975113..b6e7cc978 100644
--- a/src/main/kotlin/g1301_1400/s1333_filter_restaurants_by_vegan_friendly_price_and_distance/Solution.kt
+++ b/src/main/kotlin/g1301_1400/s1333_filter_restaurants_by_vegan_friendly_price_and_distance/Solution.kt
@@ -9,7 +9,7 @@ class Solution {
         restaurants: Array<IntArray>,
         veganFriendly: Int,
         maxPrice: Int,
-        maxDistance: Int
+        maxDistance: Int,
     ): List<Int> {
         val pq = PriorityQueue { a: IntArray, b: IntArray -> if (a[1] == b[1]) b[0] - a[0] else b[1] - a[1] }
         for (i in restaurants.indices) {
diff --git a/src/main/kotlin/g1301_1400/s1348_tweet_counts_per_frequency/TweetCounts.kt b/src/main/kotlin/g1301_1400/s1348_tweet_counts_per_frequency/TweetCounts.kt
index 72daeb8f5..ac8c7c0af 100644
--- a/src/main/kotlin/g1301_1400/s1348_tweet_counts_per_frequency/TweetCounts.kt
+++ b/src/main/kotlin/g1301_1400/s1348_tweet_counts_per_frequency/TweetCounts.kt
@@ -24,7 +24,7 @@ class TweetCounts {
         freq: String,
         tweetName: String,
         startTime: Int,
-        endTime: Int
+        endTime: Int,
     ): List<Int> {
         val sfreq = convFreqToSecond(freq)
         val dstore: Map<Int, MutableMap<Int, MutableMap<Int, MutableList<Int>>>> = store[tweetName]!!
@@ -42,10 +42,16 @@ class TweetCounts {
                 if (!hstore.containsKey(h)) {
                     continue
                 }
-                val sm = if (startTime <= d * DAY + h * HOUR) 0
-                else (startTime - d * DAY - h * HOUR) / MINUTE
-                val em = if (endTime > d * DAY + (h + 1) * HOUR) HOUR / MINUTE
-                else (endTime - d * DAY - h * HOUR) / MINUTE + 1
+                val sm = if (startTime <= d * DAY + h * HOUR) {
+                    0
+                } else {
+                    (startTime - d * DAY - h * HOUR) / MINUTE
+                }
+                val em = if (endTime > d * DAY + (h + 1) * HOUR) {
+                    HOUR / MINUTE
+                } else {
+                    (endTime - d * DAY - h * HOUR) / MINUTE + 1
+                }
                 val mstore: Map<Int, MutableList<Int>> = hstore[h]!!
                 for (m in sm..em) {
                     if (!mstore.containsKey(m)) {
diff --git a/src/main/kotlin/g1301_1400/s1357_apply_discount_every_n_orders/Cashier.kt b/src/main/kotlin/g1301_1400/s1357_apply_discount_every_n_orders/Cashier.kt
index 05b796ab5..f60c53e53 100644
--- a/src/main/kotlin/g1301_1400/s1357_apply_discount_every_n_orders/Cashier.kt
+++ b/src/main/kotlin/g1301_1400/s1357_apply_discount_every_n_orders/Cashier.kt
@@ -24,7 +24,9 @@ class Cashier(private val nthCustomer: Int, discount: Int, products: IntArray, p
         // discount customer
         return if (customerCountTrack % nthCustomer == 0) {
             sum - sum * discountPercent
-        } else sum
+        } else {
+            sum
+        }
     }
 }
 /*
diff --git a/src/main/kotlin/g1301_1400/s1360_number_of_days_between_two_dates/Solution.kt b/src/main/kotlin/g1301_1400/s1360_number_of_days_between_two_dates/Solution.kt
index ed40e893d..9cf57dbfa 100644
--- a/src/main/kotlin/g1301_1400/s1360_number_of_days_between_two_dates/Solution.kt
+++ b/src/main/kotlin/g1301_1400/s1360_number_of_days_between_two_dates/Solution.kt
@@ -8,7 +8,7 @@ class Solution {
         val strings2 = date2.split("-").dropLastWhile { it.isEmpty() }.toTypedArray()
         return Math.abs(
             julianDay(strings1[0].toInt(), strings1[1].toInt(), strings1[2].toInt()) -
-                julianDay(strings2[0].toInt(), strings2[1].toInt(), strings2[2].toInt())
+                julianDay(strings2[0].toInt(), strings2[1].toInt(), strings2[2].toInt()),
         )
     }
 
diff --git a/src/main/kotlin/g1301_1400/s1367_linked_list_in_binary_tree/Solution.kt b/src/main/kotlin/g1301_1400/s1367_linked_list_in_binary_tree/Solution.kt
index ec7afc1f9..075b1fa8f 100644
--- a/src/main/kotlin/g1301_1400/s1367_linked_list_in_binary_tree/Solution.kt
+++ b/src/main/kotlin/g1301_1400/s1367_linked_list_in_binary_tree/Solution.kt
@@ -29,11 +29,13 @@ class Solution {
     fun isSubPath(head: ListNode?, root: TreeNode?): Boolean {
         return if (root == null) {
             false
-        } else (
-            doesRootHaveList(head, root) ||
-                isSubPath(head, root.left) ||
-                isSubPath(head, root.right)
-            )
+        } else {
+            (
+                doesRootHaveList(head, root) ||
+                    isSubPath(head, root.left) ||
+                    isSubPath(head, root.right)
+                )
+        }
     }
 
     private fun doesRootHaveList(head: ListNode?, root: TreeNode?): Boolean {
@@ -42,12 +44,14 @@ class Solution {
         }
         return if (root == null) {
             false
-        } else (
-            head.`val` == root.`val` &&
-                (
-                    doesRootHaveList(head.next, root.left) ||
-                        doesRootHaveList(head.next, root.right)
-                    )
-            )
+        } else {
+            (
+                head.`val` == root.`val` &&
+                    (
+                        doesRootHaveList(head.next, root.left) ||
+                            doesRootHaveList(head.next, root.right)
+                        )
+                )
+        }
     }
 }
diff --git a/src/main/kotlin/g1301_1400/s1368_minimum_cost_to_make_at_least_one_valid_path_in_a_grid/Solution.kt b/src/main/kotlin/g1301_1400/s1368_minimum_cost_to_make_at_least_one_valid_path_in_a_grid/Solution.kt
index 14528f703..dd174230b 100644
--- a/src/main/kotlin/g1301_1400/s1368_minimum_cost_to_make_at_least_one_valid_path_in_a_grid/Solution.kt
+++ b/src/main/kotlin/g1301_1400/s1368_minimum_cost_to_make_at_least_one_valid_path_in_a_grid/Solution.kt
@@ -10,8 +10,11 @@ import java.util.Queue
 @Suppress("NAME_SHADOWING")
 class Solution {
     private val dir = arrayOf(
-        intArrayOf(0, 0), intArrayOf(0, 1),
-        intArrayOf(0, -1), intArrayOf(1, 0), intArrayOf(-1, 0)
+        intArrayOf(0, 0),
+        intArrayOf(0, 1),
+        intArrayOf(0, -1),
+        intArrayOf(1, 0),
+        intArrayOf(-1, 0),
     )
 
     fun minCost(grid: Array<IntArray>): Int {
@@ -45,7 +48,7 @@ class Solution {
         y: Int,
         grid: Array<IntArray>,
         queue: Queue<Pair>,
-        visited: Array<IntArray>
+        visited: Array<IntArray>,
     ) {
         var x = x
         var y = y
diff --git a/src/main/kotlin/g1301_1400/s1371_find_the_longest_substring_containing_vowels_in_even_counts/Solution.kt b/src/main/kotlin/g1301_1400/s1371_find_the_longest_substring_containing_vowels_in_even_counts/Solution.kt
index 71ab372e0..d2ae6e604 100644
--- a/src/main/kotlin/g1301_1400/s1371_find_the_longest_substring_containing_vowels_in_even_counts/Solution.kt
+++ b/src/main/kotlin/g1301_1400/s1371_find_the_longest_substring_containing_vowels_in_even_counts/Solution.kt
@@ -13,8 +13,11 @@ class Solution {
         for (i in 0 until s.length) {
             val c = s[i]
             if (set.contains(c)) {
-                sum = if (sum and (1 shl 'a'.code - c.code) == 0) sum or (1 shl 'a'.code - c.code) else
+                sum = if (sum and (1 shl 'a'.code - c.code) == 0) {
+                    sum or (1 shl 'a'.code - c.code)
+                } else {
                     sum and (1 shl 'a'.code - c.code).inv()
+                }
             }
             arr[i] = sum
         }
diff --git a/src/main/kotlin/g1301_1400/s1379_find_a_corresponding_node_of_a_binary_tree_in_a_clone_of_that_tree/Solution.kt b/src/main/kotlin/g1301_1400/s1379_find_a_corresponding_node_of_a_binary_tree_in_a_clone_of_that_tree/Solution.kt
index c4e295247..f3197f500 100644
--- a/src/main/kotlin/g1301_1400/s1379_find_a_corresponding_node_of_a_binary_tree_in_a_clone_of_that_tree/Solution.kt
+++ b/src/main/kotlin/g1301_1400/s1379_find_a_corresponding_node_of_a_binary_tree_in_a_clone_of_that_tree/Solution.kt
@@ -18,7 +18,7 @@ class Solution {
     fun getTargetCopy(
         original: TreeNode?,
         cloned: TreeNode?,
-        target: TreeNode
+        target: TreeNode,
     ): TreeNode? {
         if (original == null) {
             return null
@@ -29,6 +29,8 @@ class Solution {
         val left = getTargetCopy(original.left, cloned!!.left, target)
         return if (left != null && left.`val` == target.`val`) {
             left
-        } else getTargetCopy(original.right, cloned.right, target)
+        } else {
+            getTargetCopy(original.right, cloned.right, target)
+        }
     }
 }
diff --git a/src/main/kotlin/g1301_1400/s1388_pizza_with_3n_slices/Solution.kt b/src/main/kotlin/g1301_1400/s1388_pizza_with_3n_slices/Solution.kt
index 3025b050b..026302921 100644
--- a/src/main/kotlin/g1301_1400/s1388_pizza_with_3n_slices/Solution.kt
+++ b/src/main/kotlin/g1301_1400/s1388_pizza_with_3n_slices/Solution.kt
@@ -8,7 +8,8 @@ class Solution {
         val n = slices.size
         val third = n / 3
         return Math.max(
-            maxSizeSlices(slices, 0, n - 2, third), maxSizeSlices(slices, 1, n - 1, third)
+            maxSizeSlices(slices, 0, n - 2, third),
+            maxSizeSlices(slices, 1, n - 1, third),
         )
     }
 
diff --git a/src/main/kotlin/g1301_1400/s1391_check_if_there_is_a_valid_path_in_a_grid/Solution.kt b/src/main/kotlin/g1301_1400/s1391_check_if_there_is_a_valid_path_in_a_grid/Solution.kt
index 36c9e209d..15e80afa0 100644
--- a/src/main/kotlin/g1301_1400/s1391_check_if_there_is_a_valid_path_in_a_grid/Solution.kt
+++ b/src/main/kotlin/g1301_1400/s1391_check_if_there_is_a_valid_path_in_a_grid/Solution.kt
@@ -12,14 +12,14 @@ class Solution {
         arrayOf(intArrayOf(-1, 0), intArrayOf(1, 0)),
         arrayOf(
             intArrayOf(0, -1),
-            intArrayOf(1, 0)
+            intArrayOf(1, 0),
         ),
         arrayOf(intArrayOf(0, 1), intArrayOf(1, 0)),
         arrayOf(intArrayOf(0, -1), intArrayOf(-1, 0)),
         arrayOf(
             intArrayOf(0, 1),
-            intArrayOf(-1, 0)
-        )
+            intArrayOf(-1, 0),
+        ),
     )
 
     // the idea is you need to check port direction match, you can go to next cell and check whether
diff --git a/src/main/kotlin/g1301_1400/s1397_find_all_good_strings/Solution.kt b/src/main/kotlin/g1301_1400/s1397_find_all_good_strings/Solution.kt
index ba7db9165..7db2c16eb 100644
--- a/src/main/kotlin/g1301_1400/s1397_find_all_good_strings/Solution.kt
+++ b/src/main/kotlin/g1301_1400/s1397_find_all_good_strings/Solution.kt
@@ -23,7 +23,9 @@ class Solution {
         next = getNext(evil)
         return if (s1.compareTo(s2) > 0) {
             lessOrEqualThan(s2, evil)
-        } else (lessOrEqualThan(s2, evil) - lessOrEqualThan(s1, evil) + mod) % mod
+        } else {
+            (lessOrEqualThan(s2, evil) - lessOrEqualThan(s1, evil) + mod) % mod
+        }
     }
 
     private fun lessOrEqualThan(s: String, e: String): Int {
diff --git a/src/main/kotlin/g1401_1500/s1401_circle_and_rectangle_overlapping/Solution.kt b/src/main/kotlin/g1401_1500/s1401_circle_and_rectangle_overlapping/Solution.kt
index f0f32ecfe..8c75a1a71 100644
--- a/src/main/kotlin/g1401_1500/s1401_circle_and_rectangle_overlapping/Solution.kt
+++ b/src/main/kotlin/g1401_1500/s1401_circle_and_rectangle_overlapping/Solution.kt
@@ -10,7 +10,7 @@ class Solution {
         x1: Int,
         y1: Int,
         x2: Int,
-        y2: Int
+        y2: Int,
     ): Boolean {
         // Find the closest point to the circle within the rectangle
         val closestX = clamp(xCenter, x1, x2)
diff --git a/src/main/kotlin/g1401_1500/s1406_stone_game_iii/Solution.kt b/src/main/kotlin/g1401_1500/s1406_stone_game_iii/Solution.kt
index 9db8417a3..b17d9182a 100644
--- a/src/main/kotlin/g1401_1500/s1406_stone_game_iii/Solution.kt
+++ b/src/main/kotlin/g1401_1500/s1406_stone_game_iii/Solution.kt
@@ -17,7 +17,7 @@ class Solution {
             if (i + 2 < stoneValue.size) {
                 ans = Math.max(
                     ans,
-                    stoneValue[i] + stoneValue[i + 1] + stoneValue[i + 2] - dp[i + 3]
+                    stoneValue[i] + stoneValue[i + 1] + stoneValue[i + 2] - dp[i + 3],
                 )
             }
             dp[i] = ans
diff --git a/src/main/kotlin/g1401_1500/s1411_number_of_ways_to_paint_n_3_grid/Solution.kt b/src/main/kotlin/g1401_1500/s1411_number_of_ways_to_paint_n_3_grid/Solution.kt
index 45fbb1dd8..161d5e2ed 100644
--- a/src/main/kotlin/g1401_1500/s1411_number_of_ways_to_paint_n_3_grid/Solution.kt
+++ b/src/main/kotlin/g1401_1500/s1411_number_of_ways_to_paint_n_3_grid/Solution.kt
@@ -11,7 +11,7 @@ class Solution {
             intArrayOf(5, 6, 9, 10, 12), intArrayOf(6, 10, 11, 12, -1), intArrayOf(1, 2, 3, 11, 12),
             intArrayOf(1, 3, 4, 11, -1), intArrayOf(2, 9, 10, 12, -1), intArrayOf(1, 2, 10, 11, 12),
             intArrayOf(1, 2, 3, 7, -1), intArrayOf(1, 3, 4, 7, 8), intArrayOf(4, 5, 6, 8, -1),
-            intArrayOf(3, 4, 5, 7, 8)
+            intArrayOf(3, 4, 5, 7, 8),
         )
         for (i in 2..n) {
             for (j in 0..11) {
diff --git a/src/main/kotlin/g1401_1500/s1419_minimum_number_of_frogs_croaking/Solution.kt b/src/main/kotlin/g1401_1500/s1419_minimum_number_of_frogs_croaking/Solution.kt
index 2483b55f3..d1de22201 100644
--- a/src/main/kotlin/g1401_1500/s1419_minimum_number_of_frogs_croaking/Solution.kt
+++ b/src/main/kotlin/g1401_1500/s1419_minimum_number_of_frogs_croaking/Solution.kt
@@ -58,6 +58,8 @@ class Solution {
         }
         return if (f[0] > f['o'.code - 'a'.code]) {
             false
-        } else f['k'.code - 'a'.code] <= f[0]
+        } else {
+            f['k'.code - 'a'.code] <= f[0]
+        }
     }
 }
diff --git a/src/main/kotlin/g1401_1500/s1439_find_the_kth_smallest_sum_of_a_matrix_with_sorted_rows/Solution.kt b/src/main/kotlin/g1401_1500/s1439_find_the_kth_smallest_sum_of_a_matrix_with_sorted_rows/Solution.kt
index 7330eae1b..a0c214568 100644
--- a/src/main/kotlin/g1401_1500/s1439_find_the_kth_smallest_sum_of_a_matrix_with_sorted_rows/Solution.kt
+++ b/src/main/kotlin/g1401_1500/s1439_find_the_kth_smallest_sum_of_a_matrix_with_sorted_rows/Solution.kt
@@ -21,7 +21,7 @@ class Solution {
                     }
                     return@Comparator 0
                 }
-            }
+            },
         )
         val m = mat.size
         val n = mat[0].size
diff --git a/src/main/kotlin/g1401_1500/s1443_minimum_time_to_collect_all_apples_in_a_tree/Solution.kt b/src/main/kotlin/g1401_1500/s1443_minimum_time_to_collect_all_apples_in_a_tree/Solution.kt
index 6722db9da..a90b95e84 100644
--- a/src/main/kotlin/g1401_1500/s1443_minimum_time_to_collect_all_apples_in_a_tree/Solution.kt
+++ b/src/main/kotlin/g1401_1500/s1443_minimum_time_to_collect_all_apples_in_a_tree/Solution.kt
@@ -23,7 +23,7 @@ class Solution {
         graph: Map<Int, MutableList<Int>>,
         hasApple: List<Boolean>,
         node: Int,
-        visited: MutableSet<Int>
+        visited: MutableSet<Int>,
     ): Int {
         var steps = 0
         for (child in graph.getOrDefault(node, mutableListOf())) {
diff --git a/src/main/kotlin/g1401_1500/s1444_number_of_ways_of_cutting_a_pizza/Solution.kt b/src/main/kotlin/g1401_1500/s1444_number_of_ways_of_cutting_a_pizza/Solution.kt
index a8ba51c8f..1107f6b0d 100644
--- a/src/main/kotlin/g1401_1500/s1444_number_of_ways_of_cutting_a_pizza/Solution.kt
+++ b/src/main/kotlin/g1401_1500/s1444_number_of_ways_of_cutting_a_pizza/Solution.kt
@@ -41,7 +41,7 @@ class Solution {
         temp2: Int,
         k: Int,
         prefix: Array<IntArray>,
-        dp: Array<Array<IntArray>>
+        dp: Array<Array<IntArray>>,
     ): Int {
         if (k == 0) {
             return if (hasApple(prefix, m, n, temp1 - 1, temp2 - 1)) 1 else 0
@@ -77,7 +77,7 @@ class Solution {
     private fun hasApple(prefix: Array<IntArray>, x1: Int, y1: Int, x2: Int, y2: Int): Boolean {
         return (
             prefix[x2 + 1][y2 + 1] - prefix[x1][y2 + 1] - prefix[x2 + 1][y1] + prefix[x1][y1]
-            > 0
+                > 0
             )
     }
 
diff --git a/src/main/kotlin/g1401_1500/s1447_simplified_fractions/Solution.kt b/src/main/kotlin/g1401_1500/s1447_simplified_fractions/Solution.kt
index 98b246e5c..c8af70b9a 100644
--- a/src/main/kotlin/g1401_1500/s1447_simplified_fractions/Solution.kt
+++ b/src/main/kotlin/g1401_1500/s1447_simplified_fractions/Solution.kt
@@ -26,6 +26,8 @@ class Solution {
         }
         return if (a == b || a % b == 0 || b == 1) {
             b
-        } else checkGCD(a % b, b)
+        } else {
+            checkGCD(a % b, b)
+        }
     }
 }
diff --git a/src/main/kotlin/g1401_1500/s1452_people_whose_list_of_favorite_companies_is_not_a_subset_of_another_list/Solution.kt b/src/main/kotlin/g1401_1500/s1452_people_whose_list_of_favorite_companies_is_not_a_subset_of_another_list/Solution.kt
index 1ecd2709d..326fe6932 100644
--- a/src/main/kotlin/g1401_1500/s1452_people_whose_list_of_favorite_companies_is_not_a_subset_of_another_list/Solution.kt
+++ b/src/main/kotlin/g1401_1500/s1452_people_whose_list_of_favorite_companies_is_not_a_subset_of_another_list/Solution.kt
@@ -29,6 +29,8 @@ class Solution {
     private fun isSubset(subset: Set<String>, set: Set<String>): Boolean {
         return if (subset.size >= set.size) {
             false
-        } else set.containsAll(subset)
+        } else {
+            set.containsAll(subset)
+        }
     }
 }
diff --git a/src/main/kotlin/g1401_1500/s1453_maximum_number_of_darts_inside_of_a_circular_dartboard/Solution.kt b/src/main/kotlin/g1401_1500/s1453_maximum_number_of_darts_inside_of_a_circular_dartboard/Solution.kt
index 4e8c8029c..482374322 100644
--- a/src/main/kotlin/g1401_1500/s1453_maximum_number_of_darts_inside_of_a_circular_dartboard/Solution.kt
+++ b/src/main/kotlin/g1401_1500/s1453_maximum_number_of_darts_inside_of_a_circular_dartboard/Solution.kt
@@ -25,7 +25,7 @@ class Solution {
                 val b = Math.acos(dis[i][j] / (2 * r))
                 val a = Math.atan2(
                     points[j][1] - points[i][1] * 1.0,
-                    points[j][0] * 1.0 - points[i][0]
+                    points[j][0] * 1.0 - points[i][0],
                 )
                 val alpha = a - b
                 val beta = a + b
@@ -56,7 +56,7 @@ class Solution {
             for (j in i + 1 until n) {
                 dis[j][i] = Math.sqrt(
                     Math.pow(points[i][0] * 1.0 - points[j][0], 2.0) +
-                        Math.pow(points[i][1] * 1.0 - points[j][1], 2.0)
+                        Math.pow(points[i][1] * 1.0 - points[j][1], 2.0),
                 )
                 dis[i][j] = dis[j][i]
             }
diff --git a/src/main/kotlin/g1401_1500/s1462_course_schedule_iv/Solution.kt b/src/main/kotlin/g1401_1500/s1462_course_schedule_iv/Solution.kt
index 1503e82f0..247d53961 100644
--- a/src/main/kotlin/g1401_1500/s1462_course_schedule_iv/Solution.kt
+++ b/src/main/kotlin/g1401_1500/s1462_course_schedule_iv/Solution.kt
@@ -10,7 +10,7 @@ class Solution {
     fun checkIfPrerequisite(
         numCourses: Int,
         prerequisites: Array<IntArray>,
-        queries: Array<IntArray>
+        queries: Array<IntArray>,
     ): List<Boolean> {
         val m: MutableMap<Int, MutableList<Int>> = HashMap()
         val ind = IntArray(numCourses)
diff --git a/src/main/kotlin/g1401_1500/s1473_paint_house_iii/Solution.kt b/src/main/kotlin/g1401_1500/s1473_paint_house_iii/Solution.kt
index de712401f..bf9741d5c 100644
--- a/src/main/kotlin/g1401_1500/s1473_paint_house_iii/Solution.kt
+++ b/src/main/kotlin/g1401_1500/s1473_paint_house_iii/Solution.kt
@@ -20,11 +20,15 @@ class Solution {
     private fun calculate(house: Int, houses: IntArray, cost: Array<IntArray>, n: Int, target: Int) {
         swap()
         calculateMins(n, target)
-        if (houses[house] > 0) costInPaintedHouse(house, houses, cost, target) else costNotPaintedHouse(
-            house,
-            cost,
-            target
-        )
+        if (houses[house] > 0) {
+            costInPaintedHouse(house, houses, cost, target)
+        } else {
+            costNotPaintedHouse(
+                house,
+                cost,
+                target,
+            )
+        }
     }
 
     private fun costInPaintedHouse(house: Int, houses: IntArray, cost: Array<IntArray>, target: Int) {
@@ -38,7 +42,9 @@ class Solution {
                     curr[i][j] = if (mins[0][j - 1] == prev[i][j - 1]) mins[1][j - 1] else mins[0][j - 1]
                     curr[i][j] = if (newG && j == group) curr[i][j] else Math.min(curr[i][j], prev[i][j])
                 }
-            } else for (j in 0..group) curr[i][j] = Int.MAX_VALUE
+            } else {
+                for (j in 0..group) curr[i][j] = Int.MAX_VALUE
+            }
         }
     }
 
diff --git a/src/main/kotlin/g1401_1500/s1489_find_critical_and_pseudo_critical_edges_in_minimum_spanning_tree/Solution.kt b/src/main/kotlin/g1401_1500/s1489_find_critical_and_pseudo_critical_edges_in_minimum_spanning_tree/Solution.kt
index aa79fbb5e..252d1654e 100644
--- a/src/main/kotlin/g1401_1500/s1489_find_critical_and_pseudo_critical_edges_in_minimum_spanning_tree/Solution.kt
+++ b/src/main/kotlin/g1401_1500/s1489_find_critical_and_pseudo_critical_edges_in_minimum_spanning_tree/Solution.kt
@@ -26,7 +26,8 @@ class Solution {
         val mstSet = BooleanArray(edges.size)
         edges.sortWith { a: IntArray, b: IntArray ->
             Integer.compare(
-                a[2], b[2]
+                a[2],
+                b[2],
             )
         }
         buildMST(n, edges, mstSet, mst, g)
@@ -72,7 +73,7 @@ class Solution {
         p: Int,
         mst: Array<MutableList<Int>?>,
         g: Array<Array<IntArray>>,
-        ind: MutableSet<Int>
+        ind: MutableSet<Int>,
     ): Boolean {
         if (f == t) {
             return true
@@ -93,7 +94,7 @@ class Solution {
         edges: Array<IntArray>,
         mste: BooleanArray,
         mstg: Array<MutableList<Int>?>,
-        g: Array<Array<IntArray>>
+        g: Array<Array<IntArray>>,
     ) {
         val ds = DisjointSet(n)
         for (ints in edges) {
diff --git a/src/main/kotlin/g1401_1500/s1499_max_value_of_equation/Solution.kt b/src/main/kotlin/g1401_1500/s1499_max_value_of_equation/Solution.kt
index f205062a5..5b7d8d8b4 100644
--- a/src/main/kotlin/g1401_1500/s1499_max_value_of_equation/Solution.kt
+++ b/src/main/kotlin/g1401_1500/s1499_max_value_of_equation/Solution.kt
@@ -26,7 +26,7 @@ class Solution {
             if (points[rMax][0] - points[l][0] <= k) {
                 res = Math.max(
                     res,
-                    points[rMax][0] - points[l][0] + points[rMax][1] + points[l][1]
+                    points[rMax][0] - points[l][0] + points[rMax][1] + points[l][1],
                 )
             }
         }
diff --git a/src/main/kotlin/g1501_1600/s1503_last_moment_before_all_ants_fall_out_of_a_plank/Solution.kt b/src/main/kotlin/g1501_1600/s1503_last_moment_before_all_ants_fall_out_of_a_plank/Solution.kt
index 0e15c71ad..20f60dd7b 100644
--- a/src/main/kotlin/g1501_1600/s1503_last_moment_before_all_ants_fall_out_of_a_plank/Solution.kt
+++ b/src/main/kotlin/g1501_1600/s1503_last_moment_before_all_ants_fall_out_of_a_plank/Solution.kt
@@ -19,6 +19,8 @@ class Solution {
         }
         return if (right.isNotEmpty() && left.isEmpty()) {
             Math.abs(smallestRight - n)
-        } else Math.max(highestLeft, Math.abs(smallestRight - n))
+        } else {
+            Math.max(highestLeft, Math.abs(smallestRight - n))
+        }
     }
 }
diff --git a/src/main/kotlin/g1501_1600/s1519_number_of_nodes_in_the_sub_tree_with_the_same_label/Solution.kt b/src/main/kotlin/g1501_1600/s1519_number_of_nodes_in_the_sub_tree_with_the_same_label/Solution.kt
index 81d5d94d3..71eece72e 100644
--- a/src/main/kotlin/g1501_1600/s1519_number_of_nodes_in_the_sub_tree_with_the_same_label/Solution.kt
+++ b/src/main/kotlin/g1501_1600/s1519_number_of_nodes_in_the_sub_tree_with_the_same_label/Solution.kt
@@ -33,7 +33,7 @@ class Solution {
         graph: ArrayList<ArrayList<Int>>,
         labels: IntArray,
         labelsCount: IntArray,
-        parent: Int
+        parent: Int,
     ): IntArray {
         val labelsFrequency = IntArray(26)
         val rootLabel = labels[root]
diff --git a/src/main/kotlin/g1501_1600/s1523_count_odd_numbers_in_an_interval_range/Solution.kt b/src/main/kotlin/g1501_1600/s1523_count_odd_numbers_in_an_interval_range/Solution.kt
index bb4593189..57194f4bb 100644
--- a/src/main/kotlin/g1501_1600/s1523_count_odd_numbers_in_an_interval_range/Solution.kt
+++ b/src/main/kotlin/g1501_1600/s1523_count_odd_numbers_in_an_interval_range/Solution.kt
@@ -7,6 +7,8 @@ class Solution {
     fun countOdds(low: Int, high: Int): Int {
         return if (low % 2 != 0 || high % 2 != 0) {
             (high - low) / 2 + 1
-        } else (high - low) / 2
+        } else {
+            (high - low) / 2
+        }
     }
 }
diff --git a/src/main/kotlin/g1501_1600/s1530_number_of_good_leaf_nodes_pairs/Solution.kt b/src/main/kotlin/g1501_1600/s1530_number_of_good_leaf_nodes_pairs/Solution.kt
index 9a025fbcf..82e8248cc 100644
--- a/src/main/kotlin/g1501_1600/s1530_number_of_good_leaf_nodes_pairs/Solution.kt
+++ b/src/main/kotlin/g1501_1600/s1530_number_of_good_leaf_nodes_pairs/Solution.kt
@@ -19,7 +19,9 @@ class Solution {
     fun countPairs(root: TreeNode?, distance: Int): Int {
         return if (distance < 2) {
             0
-        } else pairsAndLeaves(root, distance)[0]
+        } else {
+            pairsAndLeaves(root, distance)[0]
+        }
     }
 
     private fun pairsAndLeaves(node: TreeNode?, distance: Int): IntArray {
diff --git a/src/main/kotlin/g1501_1600/s1531_string_compression_ii/Solution.kt b/src/main/kotlin/g1501_1600/s1531_string_compression_ii/Solution.kt
index ff87ba30e..190599225 100644
--- a/src/main/kotlin/g1501_1600/s1531_string_compression_ii/Solution.kt
+++ b/src/main/kotlin/g1501_1600/s1531_string_compression_ii/Solution.kt
@@ -16,7 +16,9 @@ class Solution {
         }
         return if (cnt < 100) {
             3
-        } else 4
+        } else {
+            4
+        }
     }
 
     fun getLengthOfOptimalCompression(s: String, k: Int): Int {
diff --git a/src/main/kotlin/g1501_1600/s1568_minimum_number_of_days_to_disconnect_island/Solution.kt b/src/main/kotlin/g1501_1600/s1568_minimum_number_of_days_to_disconnect_island/Solution.kt
index 9e3ae2229..4f3351e6c 100644
--- a/src/main/kotlin/g1501_1600/s1568_minimum_number_of_days_to_disconnect_island/Solution.kt
+++ b/src/main/kotlin/g1501_1600/s1568_minimum_number_of_days_to_disconnect_island/Solution.kt
@@ -53,7 +53,7 @@ class Solution {
         grid: Array<IntArray>,
         articulationPoints: MutableList<Int>,
         color: Int,
-        islandSize: IntArray
+        islandSize: IntArray,
     ) {
         times[x][y] = time
         lows[x][y] = time
@@ -79,7 +79,7 @@ class Solution {
                     grid,
                     articulationPoints,
                     color,
-                    islandSize
+                    islandSize,
                 )
                 lows[x][y] = Math.min(lows[x][y], lows[nx][ny])
                 if (prex != -1 && lows[nx][ny] >= time) {
diff --git a/src/main/kotlin/g1501_1600/s1569_number_of_ways_to_reorder_array_to_get_same_bst/Solution.kt b/src/main/kotlin/g1501_1600/s1569_number_of_ways_to_reorder_array_to_get_same_bst/Solution.kt
index 9d5b0ec08..374d43ea2 100644
--- a/src/main/kotlin/g1501_1600/s1569_number_of_ways_to_reorder_array_to_get_same_bst/Solution.kt
+++ b/src/main/kotlin/g1501_1600/s1569_number_of_ways_to_reorder_array_to_get_same_bst/Solution.kt
@@ -31,14 +31,14 @@ class Solution {
         val right: TreeInfo
         left = if (root!!.left != null) {
             calcPerms(
-                root.left, fact
+                root.left, fact,
             )
         } else {
             TreeInfo(0, 1)
         }
         right = if (root.right != null) {
             calcPerms(
-                root.right, fact
+                root.right, fact,
             )
         } else {
             TreeInfo(0, 1)
@@ -49,7 +49,7 @@ class Solution {
             fact[totNodes.toInt() - 1],
             fact[left.numOfNodes.toInt()],
             fact[right.numOfNodes.toInt()],
-            mod
+            mod,
         )
         val perms = if (totNodes == 1L) 1 else left.perm * right.perm % mod * modDiv % mod
         left.numOfNodes = totNodes
diff --git a/src/main/kotlin/g1501_1600/s1579_remove_max_number_of_edges_to_keep_graph_fully_traversable/Solution.kt b/src/main/kotlin/g1501_1600/s1579_remove_max_number_of_edges_to_keep_graph_fully_traversable/Solution.kt
index fe1ec6f16..430c8aab6 100644
--- a/src/main/kotlin/g1501_1600/s1579_remove_max_number_of_edges_to_keep_graph_fully_traversable/Solution.kt
+++ b/src/main/kotlin/g1501_1600/s1579_remove_max_number_of_edges_to_keep_graph_fully_traversable/Solution.kt
@@ -50,7 +50,9 @@ class Solution {
         }
         return if (countAlice != 1 || countBob != 1) {
             -1
-        } else remove
+        } else {
+            remove
+        }
     }
 
     fun union(x: Int, y: Int, arr: IntArray, rank: IntArray): Boolean {
diff --git a/src/main/kotlin/g1501_1600/s1583_count_unhappy_friends/Solution.kt b/src/main/kotlin/g1501_1600/s1583_count_unhappy_friends/Solution.kt
index 9f86fa7d3..f23eb144f 100644
--- a/src/main/kotlin/g1501_1600/s1583_count_unhappy_friends/Solution.kt
+++ b/src/main/kotlin/g1501_1600/s1583_count_unhappy_friends/Solution.kt
@@ -26,7 +26,7 @@ class Solution {
         self: Int,
         assignedFriend: Int,
         preferences: Array<IntArray>,
-        assignedPairs: Map<Int, Int>
+        assignedPairs: Map<Int, Int>,
     ): Boolean {
         val preference = preferences[self]
         val assignedFriendPreferenceIndex = findIndex(preference, assignedFriend)
diff --git a/src/main/kotlin/g1501_1600/s1584_min_cost_to_connect_all_points/Solution.kt b/src/main/kotlin/g1501_1600/s1584_min_cost_to_connect_all_points/Solution.kt
index 4c1d7f453..c64a7d740 100644
--- a/src/main/kotlin/g1501_1600/s1584_min_cost_to_connect_all_points/Solution.kt
+++ b/src/main/kotlin/g1501_1600/s1584_min_cost_to_connect_all_points/Solution.kt
@@ -35,7 +35,7 @@ class Solution {
         points: Array<IntArray>,
         mst: BooleanArray,
         pq: PriorityQueue<Pair>,
-        dist: IntArray
+        dist: IntArray,
     ) {
         if (!containsFalse(mst)) {
             return
diff --git a/src/main/kotlin/g1501_1600/s1591_strange_printer_ii/Solution.kt b/src/main/kotlin/g1501_1600/s1591_strange_printer_ii/Solution.kt
index be8adf8b7..91aa6ce62 100644
--- a/src/main/kotlin/g1501_1600/s1591_strange_printer_ii/Solution.kt
+++ b/src/main/kotlin/g1501_1600/s1591_strange_printer_ii/Solution.kt
@@ -48,7 +48,7 @@ class Solution {
         printed: BooleanArray,
         colorBound: Array<IntArray>,
         visited: Array<BooleanArray>,
-        color: Int
+        color: Int,
     ): Boolean {
         printed[color] = true
         for (i in colorBound[color][0]..colorBound[color][2]) {
diff --git a/src/main/kotlin/g1501_1600/s1594_maximum_non_negative_product_in_a_matrix/Solution.kt b/src/main/kotlin/g1501_1600/s1594_maximum_non_negative_product_in_a_matrix/Solution.kt
index d1166e8af..1ebe2e649 100644
--- a/src/main/kotlin/g1501_1600/s1594_maximum_non_negative_product_in_a_matrix/Solution.kt
+++ b/src/main/kotlin/g1501_1600/s1594_maximum_non_negative_product_in_a_matrix/Solution.kt
@@ -38,6 +38,8 @@ class Solution {
         }
         return if (dp[rows - 1][cols - 1].max < 0) {
             -1
-        } else (dp[rows - 1][cols - 1].max % (1e9 + 7)).toInt()
+        } else {
+            (dp[rows - 1][cols - 1].max % (1e9 + 7)).toInt()
+        }
     }
 }
diff --git a/src/main/kotlin/g1501_1600/s1595_minimum_cost_to_connect_two_groups_of_points/Solution.kt b/src/main/kotlin/g1501_1600/s1595_minimum_cost_to_connect_two_groups_of_points/Solution.kt
index 29c77b210..c6ce093e8 100644
--- a/src/main/kotlin/g1501_1600/s1595_minimum_cost_to_connect_two_groups_of_points/Solution.kt
+++ b/src/main/kotlin/g1501_1600/s1595_minimum_cost_to_connect_two_groups_of_points/Solution.kt
@@ -36,7 +36,7 @@ class Solution {
                     if (msk and (1 shl row) == 0 && tmpRecord[msk] != Int.MAX_VALUE) {
                         tmpRecord[newMask] = Math.min(
                             tmpRecord[newMask],
-                            tmpRecord[msk] + cost[row][col]
+                            tmpRecord[msk] + cost[row][col],
                         )
                     }
                 }
diff --git a/src/main/kotlin/g1501_1600/s1600_throne_inheritance/ThroneInheritance.kt b/src/main/kotlin/g1501_1600/s1600_throne_inheritance/ThroneInheritance.kt
index c8f8c74aa..14649429b 100644
--- a/src/main/kotlin/g1501_1600/s1600_throne_inheritance/ThroneInheritance.kt
+++ b/src/main/kotlin/g1501_1600/s1600_throne_inheritance/ThroneInheritance.kt
@@ -33,7 +33,7 @@ class ThroneInheritance(private val king: String) {
         graph: Map<String, LinkedHashSet<String>>,
         src: String,
         l: MutableList<String>,
-        visited: MutableSet<String>
+        visited: MutableSet<String>,
     ) {
         visited.add(src)
         if (!isDead.contains(src)) {
diff --git a/src/main/kotlin/g1601_1700/s1610_maximum_number_of_visible_points/Solution.kt b/src/main/kotlin/g1601_1700/s1610_maximum_number_of_visible_points/Solution.kt
index 5a454bead..62571e334 100644
--- a/src/main/kotlin/g1601_1700/s1610_maximum_number_of_visible_points/Solution.kt
+++ b/src/main/kotlin/g1601_1700/s1610_maximum_number_of_visible_points/Solution.kt
@@ -52,7 +52,9 @@ class Solution {
             }
             return if (y2 < y1) {
                 270.0
-            } else 360.0
+            } else {
+                360.0
+            }
         }
         var angle = Math.toDegrees(atan((y2 - y1).toDouble() / (x2 - x1)))
         if (x2 > x1) {
diff --git a/src/main/kotlin/g1601_1700/s1617_count_subtrees_with_max_distance_between_cities/Solution.kt b/src/main/kotlin/g1601_1700/s1617_count_subtrees_with_max_distance_between_cities/Solution.kt
index 46a35161b..2c06248fe 100644
--- a/src/main/kotlin/g1601_1700/s1617_count_subtrees_with_max_distance_between_cities/Solution.kt
+++ b/src/main/kotlin/g1601_1700/s1617_count_subtrees_with_max_distance_between_cities/Solution.kt
@@ -17,12 +17,12 @@ class Solution {
         for (i in edges) {
             graph.computeIfAbsent(1 shl i[0] - 1) { initialCapacity: Int? ->
                 ArrayList(
-                    initialCapacity!!
+                    initialCapacity!!,
                 )
             }.add(1 shl i[1] - 1)
             graph.computeIfAbsent(1 shl i[1] - 1) { initialCapacity: Int? ->
                 ArrayList(
-                    initialCapacity!!
+                    initialCapacity!!,
                 )
             }.add(1 shl i[0] - 1)
         }
diff --git a/src/main/kotlin/g1601_1700/s1622_fancy_sequence/Fancy.kt b/src/main/kotlin/g1601_1700/s1622_fancy_sequence/Fancy.kt
index 07774b8a8..f00cb70fc 100644
--- a/src/main/kotlin/g1601_1700/s1622_fancy_sequence/Fancy.kt
+++ b/src/main/kotlin/g1601_1700/s1622_fancy_sequence/Fancy.kt
@@ -30,7 +30,9 @@ class Fancy {
     fun getIndex(idx: Int): Int {
         return if (idx >= size) {
             -1
-        } else ((mult * values[idx] + add) % MOD).toInt()
+        } else {
+            ((mult * values[idx] + add) % MOD).toInt()
+        }
     }
 
     private fun multiplicativeInverse(x: Int): Int {
diff --git a/src/main/kotlin/g1601_1700/s1626_best_team_with_no_conflicts/Solution.kt b/src/main/kotlin/g1601_1700/s1626_best_team_with_no_conflicts/Solution.kt
index fe8fd4e46..796781bdc 100644
--- a/src/main/kotlin/g1601_1700/s1626_best_team_with_no_conflicts/Solution.kt
+++ b/src/main/kotlin/g1601_1700/s1626_best_team_with_no_conflicts/Solution.kt
@@ -6,7 +6,7 @@ package g1601_1700.s1626_best_team_with_no_conflicts
 class Solution {
     private class Player(
         val age: Int,
-        val score: Int
+        val score: Int,
     ) : Comparable<Player> {
         override fun compareTo(other: Player) =
             if (age == other.age) {
@@ -22,8 +22,8 @@ class Solution {
             playerList.add(
                 Player(
                     age = ages[it],
-                    score = scores[it]
-                )
+                    score = scores[it],
+                ),
             )
         }
 
diff --git a/src/main/kotlin/g1601_1700/s1631_path_with_minimum_effort/Solution.kt b/src/main/kotlin/g1601_1700/s1631_path_with_minimum_effort/Solution.kt
index 1c91e3b58..92e53fbd4 100644
--- a/src/main/kotlin/g1601_1700/s1631_path_with_minimum_effort/Solution.kt
+++ b/src/main/kotlin/g1601_1700/s1631_path_with_minimum_effort/Solution.kt
@@ -42,13 +42,14 @@ class Solution {
                 }
                 pq.add(
                     Pair(
-                        r, c,
+                        r,
+                        c,
                         diff.coerceAtLeast(
                             abs(
-                                heights[r][c] - heights[row][col]
-                            )
-                        )
-                    )
+                                heights[r][c] - heights[row][col],
+                            ),
+                        ),
+                    ),
                 )
             }
         }
diff --git a/src/main/kotlin/g1601_1700/s1632_rank_transform_of_a_matrix/Solution.kt b/src/main/kotlin/g1601_1700/s1632_rank_transform_of_a_matrix/Solution.kt
index 0aa00e2ac..856dd744b 100644
--- a/src/main/kotlin/g1601_1700/s1632_rank_transform_of_a_matrix/Solution.kt
+++ b/src/main/kotlin/g1601_1700/s1632_rank_transform_of_a_matrix/Solution.kt
@@ -36,7 +36,7 @@ class Solution {
         startIdx: Int,
         endIdx: Int,
         rows: IntArray,
-        cols: IntArray
+        cols: IntArray,
     ) {
         if (startIdx + 1 == endIdx) {
             val r = nums[startIdx].toInt() shr 16 and 0xFFFF
@@ -57,7 +57,7 @@ class Solution {
                     ufind[pr] = ufind[pr].coerceAtMost(ufind[pc])
                         .coerceAtMost(
                             -rows[r]
-                                .coerceAtLeast(cols[c]) - 1
+                                .coerceAtLeast(cols[c]) - 1,
                         )
                     ufind[pc] = pr
                 }
diff --git a/src/main/kotlin/g1601_1700/s1639_number_of_ways_to_form_a_target_string_given_a_dictionary/Solution.kt b/src/main/kotlin/g1601_1700/s1639_number_of_ways_to_form_a_target_string_given_a_dictionary/Solution.kt
index 9baa76978..162d456bd 100644
--- a/src/main/kotlin/g1601_1700/s1639_number_of_ways_to_form_a_target_string_given_a_dictionary/Solution.kt
+++ b/src/main/kotlin/g1601_1700/s1639_number_of_ways_to_form_a_target_string_given_a_dictionary/Solution.kt
@@ -26,7 +26,7 @@ class Solution {
         words: Array<String>,
         target: String,
         idx: Int,
-        len: Int
+        len: Int,
     ): Int {
         if (idx >= target.length) {
             return 1
@@ -47,7 +47,7 @@ class Solution {
                 words,
                 target,
                 idx + 1,
-                len + 1
+                len + 1,
             ).toLong() * counts[len][target[idx].code - 'a'.code] %
                 MOD
             ).toInt()
diff --git a/src/main/kotlin/g1601_1700/s1649_create_sorted_array_through_instructions/Solution.kt b/src/main/kotlin/g1601_1700/s1649_create_sorted_array_through_instructions/Solution.kt
index 313af45c5..bb04783c4 100644
--- a/src/main/kotlin/g1601_1700/s1649_create_sorted_array_through_instructions/Solution.kt
+++ b/src/main/kotlin/g1601_1700/s1649_create_sorted_array_through_instructions/Solution.kt
@@ -16,7 +16,7 @@ class Solution {
             updateBIT(bit, maxValue, instructions[i])
             cost += Math.min(
                 queryBIT(bit, instructions[i] - 1),
-                1 + i - queryBIT(bit, instructions[i])
+                1 + i - queryBIT(bit, instructions[i]),
             ).toLong()
         }
         return (cost % MODULO).toInt()
diff --git a/src/main/kotlin/g1701_1800/s1704_determine_if_string_halves_are_alike/Solution.kt b/src/main/kotlin/g1701_1800/s1704_determine_if_string_halves_are_alike/Solution.kt
index 535be03d3..de4cc5f96 100644
--- a/src/main/kotlin/g1701_1800/s1704_determine_if_string_halves_are_alike/Solution.kt
+++ b/src/main/kotlin/g1701_1800/s1704_determine_if_string_halves_are_alike/Solution.kt
@@ -6,7 +6,9 @@ class Solution {
     fun halvesAreAlike(s: String): Boolean {
         return if (s.isEmpty()) {
             false
-        } else countVowel(0, s.length / 2, s) == countVowel(s.length / 2, s.length, s)
+        } else {
+            countVowel(0, s.length / 2, s) == countVowel(s.length / 2, s.length, s)
+        }
     }
 
     private fun countVowel(start: Int, end: Int, s: String): Int {
diff --git a/src/main/kotlin/g1701_1800/s1719_number_of_ways_to_reconstruct_a_tree/Solution.kt b/src/main/kotlin/g1701_1800/s1719_number_of_ways_to_reconstruct_a_tree/Solution.kt
index 16f969921..d39ad544b 100644
--- a/src/main/kotlin/g1701_1800/s1719_number_of_ways_to_reconstruct_a_tree/Solution.kt
+++ b/src/main/kotlin/g1701_1800/s1719_number_of_ways_to_reconstruct_a_tree/Solution.kt
@@ -45,7 +45,9 @@ class Solution {
         val res = search(adj, num, set)
         return if (res == 1 && c > 1) {
             2
-        } else res
+        } else {
+            res
+        }
     }
 
     private fun search(adj: Array<IntArray>, num: IntArray, vals: HashSet<Int>): Int {
@@ -99,6 +101,8 @@ class Solution {
         }
         return if (res1 == 2 || res2 == 2 || c) {
             2
-        } else 1
+        } else {
+            1
+        }
     }
 }
diff --git a/src/main/kotlin/g1701_1800/s1754_largest_merge_of_two_strings/Solution.kt b/src/main/kotlin/g1701_1800/s1754_largest_merge_of_two_strings/Solution.kt
index 84ffa7952..042ec19f8 100644
--- a/src/main/kotlin/g1701_1800/s1754_largest_merge_of_two_strings/Solution.kt
+++ b/src/main/kotlin/g1701_1800/s1754_largest_merge_of_two_strings/Solution.kt
@@ -51,6 +51,8 @@ class Solution {
         }
         return if (j == b.size) {
             true
-        } else a[i] > b[j]
+        } else {
+            a[i] > b[j]
+        }
     }
 }
diff --git a/src/main/kotlin/g1701_1800/s1766_tree_of_coprimes/Solution.kt b/src/main/kotlin/g1701_1800/s1766_tree_of_coprimes/Solution.kt
index 0289607d0..9487062a0 100644
--- a/src/main/kotlin/g1701_1800/s1766_tree_of_coprimes/Solution.kt
+++ b/src/main/kotlin/g1701_1800/s1766_tree_of_coprimes/Solution.kt
@@ -13,7 +13,7 @@ class Solution {
         node: Int,
         ans: IntArray,
         nums: IntArray,
-        neighbors: Array<ArrayList<Int>>
+        neighbors: Array<ArrayList<Int>>,
     ) {
         var d = Int.MIN_VALUE
         var n = -1
diff --git a/src/main/kotlin/g1701_1800/s1770_maximum_score_from_performing_multiplication_operations/Solution.kt b/src/main/kotlin/g1701_1800/s1770_maximum_score_from_performing_multiplication_operations/Solution.kt
index 3440a85b7..80f08c9ac 100644
--- a/src/main/kotlin/g1701_1800/s1770_maximum_score_from_performing_multiplication_operations/Solution.kt
+++ b/src/main/kotlin/g1701_1800/s1770_maximum_score_from_performing_multiplication_operations/Solution.kt
@@ -13,7 +13,7 @@ class Solution {
             for (i in 0..row) {
                 dp[i] = Math.max(
                     prev[i] + multipliers[row] * nums[n - row + i - 1],
-                    prev[i + 1] + multipliers[row] * nums[i]
+                    prev[i + 1] + multipliers[row] * nums[i],
                 )
             }
             prev = dp
diff --git a/src/main/kotlin/g1701_1800/s1790_check_if_one_string_swap_can_make_strings_equal/Solution.kt b/src/main/kotlin/g1701_1800/s1790_check_if_one_string_swap_can_make_strings_equal/Solution.kt
index 268dce063..f54eebdb1 100644
--- a/src/main/kotlin/g1701_1800/s1790_check_if_one_string_swap_can_make_strings_equal/Solution.kt
+++ b/src/main/kotlin/g1701_1800/s1790_check_if_one_string_swap_can_make_strings_equal/Solution.kt
@@ -32,7 +32,9 @@ class Solution {
         // When there is 1 char different, we return false;
         return if (i2 == -1) {
             false
-        } else s1[i1] == s2[i2] && s1[i2] == s2[i1]
+        } else {
+            s1[i1] == s2[i2] && s1[i2] == s2[i1]
+        }
         // When there are 2 char different, and swap them can make two string equal, we return true;
     }
 }
diff --git a/src/main/kotlin/g1701_1800/s1791_find_center_of_star_graph/Solution.kt b/src/main/kotlin/g1701_1800/s1791_find_center_of_star_graph/Solution.kt
index 9ecc2a127..cf5d29393 100644
--- a/src/main/kotlin/g1701_1800/s1791_find_center_of_star_graph/Solution.kt
+++ b/src/main/kotlin/g1701_1800/s1791_find_center_of_star_graph/Solution.kt
@@ -6,6 +6,8 @@ class Solution {
     fun findCenter(edges: Array<IntArray>): Int {
         return if (edges[0][0] == edges[1][0] || edges[0][0] == edges[1][1]) {
             edges[0][0]
-        } else edges[0][1]
+        } else {
+            edges[0][1]
+        }
     }
 }
diff --git a/src/main/kotlin/g1701_1800/s1799_maximize_score_after_n_operations/Solution.kt b/src/main/kotlin/g1701_1800/s1799_maximize_score_after_n_operations/Solution.kt
index 3b4f73e20..23e80f943 100644
--- a/src/main/kotlin/g1701_1800/s1799_maximize_score_after_n_operations/Solution.kt
+++ b/src/main/kotlin/g1701_1800/s1799_maximize_score_after_n_operations/Solution.kt
@@ -37,6 +37,8 @@ class Solution {
     private fun gcd(a: Int, b: Int): Int {
         return if (b == 0) {
             a
-        } else gcd(b, a % b)
+        } else {
+            gcd(b, a % b)
+        }
     }
 }
diff --git a/src/main/kotlin/g1801_1900/s1801_number_of_orders_in_the_backlog/Solution.kt b/src/main/kotlin/g1801_1900/s1801_number_of_orders_in_the_backlog/Solution.kt
index dcfc9f7ef..f5764d4cf 100644
--- a/src/main/kotlin/g1801_1900/s1801_number_of_orders_in_the_backlog/Solution.kt
+++ b/src/main/kotlin/g1801_1900/s1801_number_of_orders_in_the_backlog/Solution.kt
@@ -10,7 +10,7 @@ class Solution {
 
     fun getNumberOfBacklogOrders(orders: Array<IntArray>): Int {
         val sell = PriorityQueue(
-            compareBy { a: Order -> a.price }
+            compareBy { a: Order -> a.price },
         )
         val buy = PriorityQueue { a: Order, b: Order -> b.price - a.price }
         for (order in orders) {
diff --git a/src/main/kotlin/g1801_1900/s1819_number_of_different_subsequences_gcds/Solution.kt b/src/main/kotlin/g1801_1900/s1819_number_of_different_subsequences_gcds/Solution.kt
index 55f048818..3197600f5 100644
--- a/src/main/kotlin/g1801_1900/s1819_number_of_different_subsequences_gcds/Solution.kt
+++ b/src/main/kotlin/g1801_1900/s1819_number_of_different_subsequences_gcds/Solution.kt
@@ -39,6 +39,8 @@ class Solution {
     private fun gcd(a: Int, b: Int): Int {
         return if (b == 0) {
             a
-        } else gcd(b, a % b)
+        } else {
+            gcd(b, a % b)
+        }
     }
 }
diff --git a/src/main/kotlin/g1801_1900/s1825_finding_mk_average/MKAverage.kt b/src/main/kotlin/g1801_1900/s1825_finding_mk_average/MKAverage.kt
index d22178bd9..8cae4c3e5 100644
--- a/src/main/kotlin/g1801_1900/s1825_finding_mk_average/MKAverage.kt
+++ b/src/main/kotlin/g1801_1900/s1825_finding_mk_average/MKAverage.kt
@@ -79,7 +79,9 @@ class MKAverage(m: Int, k: Int) {
     fun calculateMKAverage(): Int {
         return if (q.size < m) {
             -1
-        } else avg.toInt()
+        } else {
+            avg.toInt()
+        }
     }
 
     internal class Bst {
diff --git a/src/main/kotlin/g1801_1900/s1830_minimum_number_of_operations_to_make_string_sorted/Solution.kt b/src/main/kotlin/g1801_1900/s1830_minimum_number_of_operations_to_make_string_sorted/Solution.kt
index d1f026a83..f2ff1c449 100644
--- a/src/main/kotlin/g1801_1900/s1830_minimum_number_of_operations_to_make_string_sorted/Solution.kt
+++ b/src/main/kotlin/g1801_1900/s1830_minimum_number_of_operations_to_make_string_sorted/Solution.kt
@@ -32,10 +32,10 @@ class Solution {
             ans = (
                 ans % mod +
                     (
-                    first * fact[len] % mod
-                        * modPow(rev, mod.toLong() - 2, mod) %
-                        mod
-                    ) %
+                        first * fact[len] % mod
+                            * modPow(rev, mod.toLong() - 2, mod) %
+                            mod
+                        ) %
                     mod
                 )
             ans %= mod
diff --git a/src/main/kotlin/g1801_1900/s1834_single_threaded_cpu/Solution.kt b/src/main/kotlin/g1801_1900/s1834_single_threaded_cpu/Solution.kt
index 1d503e8fc..ab70120af 100644
--- a/src/main/kotlin/g1801_1900/s1834_single_threaded_cpu/Solution.kt
+++ b/src/main/kotlin/g1801_1900/s1834_single_threaded_cpu/Solution.kt
@@ -20,7 +20,7 @@ class Solution {
                 } else {
                     a[1] - b[1]
                 }
-            }
+            },
         )
         var time = tasks[0][0]
         val taskOrderResult = IntArray(n)
diff --git a/src/main/kotlin/g1801_1900/s1857_largest_color_value_in_a_directed_graph/Solution.kt b/src/main/kotlin/g1801_1900/s1857_largest_color_value_in_a_directed_graph/Solution.kt
index 2be10dd89..eb3fdd832 100644
--- a/src/main/kotlin/g1801_1900/s1857_largest_color_value_in_a_directed_graph/Solution.kt
+++ b/src/main/kotlin/g1801_1900/s1857_largest_color_value_in_a_directed_graph/Solution.kt
@@ -36,7 +36,7 @@ class Solution {
         node: Int,
         calculatedFrequencies: HashMap<Int, IntArray>,
         status: IntArray,
-        colors: String
+        colors: String,
     ): IntArray? {
         if (calculatedFrequencies.containsKey(node)) {
             return calculatedFrequencies[node]
diff --git a/src/main/kotlin/g1801_1900/s1863_sum_of_all_subset_xor_totals/Solution.kt b/src/main/kotlin/g1801_1900/s1863_sum_of_all_subset_xor_totals/Solution.kt
index 90a91191e..91d80649b 100644
--- a/src/main/kotlin/g1801_1900/s1863_sum_of_all_subset_xor_totals/Solution.kt
+++ b/src/main/kotlin/g1801_1900/s1863_sum_of_all_subset_xor_totals/Solution.kt
@@ -7,7 +7,9 @@ class Solution {
     fun subsetXORSum(nums: IntArray): Int {
         return if (nums.isEmpty()) {
             0
-        } else subsetXORSum(nums, 0, 0)
+        } else {
+            subsetXORSum(nums, 0, 0)
+        }
     }
 
     private fun subsetXORSum(nums: IntArray, currIndex: Int, res: Int): Int {
diff --git a/src/main/kotlin/g1801_1900/s1871_jump_game_vii/Solution.kt b/src/main/kotlin/g1801_1900/s1871_jump_game_vii/Solution.kt
index 8df29427c..4931e6ba9 100644
--- a/src/main/kotlin/g1801_1900/s1871_jump_game_vii/Solution.kt
+++ b/src/main/kotlin/g1801_1900/s1871_jump_game_vii/Solution.kt
@@ -10,7 +10,6 @@ class Solution {
         val li = s.toCharArray()
         var i = 0
         while (i < n) {
-
             // o == ok
             if (i == 0 || li[i] == 'o') {
                 j = Math.max(j, i + minJump)
diff --git a/src/main/kotlin/g1801_1900/s1883_minimum_skips_to_arrive_at_meeting_on_time/Solution.kt b/src/main/kotlin/g1801_1900/s1883_minimum_skips_to_arrive_at_meeting_on_time/Solution.kt
index 9fdd50936..0437d57ab 100644
--- a/src/main/kotlin/g1801_1900/s1883_minimum_skips_to_arrive_at_meeting_on_time/Solution.kt
+++ b/src/main/kotlin/g1801_1900/s1883_minimum_skips_to_arrive_at_meeting_on_time/Solution.kt
@@ -18,7 +18,7 @@ class Solution {
                 }
                 if (j <= i - 1) {
                     dp[i][j] = Math.min(
-                        dp[i][j], (dp[i - 1][j] + speed - 1) / speed * speed + dist[i]
+                        dp[i][j], (dp[i - 1][j] + speed - 1) / speed * speed + dist[i],
                     )
                 }
             }
diff --git a/src/main/kotlin/g1801_1900/s1895_largest_magic_square/Solution.kt b/src/main/kotlin/g1801_1900/s1895_largest_magic_square/Solution.kt
index 7a4a50e11..91106ea8b 100644
--- a/src/main/kotlin/g1801_1900/s1895_largest_magic_square/Solution.kt
+++ b/src/main/kotlin/g1801_1900/s1895_largest_magic_square/Solution.kt
@@ -37,7 +37,7 @@ class Solution {
         cols: Array<IntArray>,
         r: Int,
         c: Int,
-        side: Int
+        side: Int,
     ): Boolean {
         val sum = rows[r][c + side] - rows[r][c]
         var d1 = 0
diff --git a/src/main/kotlin/g1801_1900/s1896_minimum_cost_to_change_the_final_value_of_expression/Solution.kt b/src/main/kotlin/g1801_1900/s1896_minimum_cost_to_change_the_final_value_of_expression/Solution.kt
index 7ee204a7a..7a273a151 100644
--- a/src/main/kotlin/g1801_1900/s1896_minimum_cost_to_change_the_final_value_of_expression/Solution.kt
+++ b/src/main/kotlin/g1801_1900/s1896_minimum_cost_to_change_the_final_value_of_expression/Solution.kt
@@ -51,12 +51,12 @@ class Solution {
         return if (res1.`val` + res2.`val` == 0) {
             Result(
                 0,
-                Math.min(res1.minFlips, res2.minFlips)
+                Math.min(res1.minFlips, res2.minFlips),
             )
         } else if (res1.`val` + res2.`val` == 2) {
             Result(
                 1,
-                1 + Math.min(res1.minFlips, res2.minFlips)
+                1 + Math.min(res1.minFlips, res2.minFlips),
             )
         } else {
             Result(1, 1)
@@ -67,12 +67,12 @@ class Solution {
         return if (res1.`val` + res2.`val` == 0) {
             Result(
                 0,
-                1 + Math.min(res1.minFlips, res2.minFlips)
+                1 + Math.min(res1.minFlips, res2.minFlips),
             )
         } else if (res1.`val` + res2.`val` == 2) {
             Result(
                 1,
-                Math.min(res1.minFlips, res2.minFlips)
+                Math.min(res1.minFlips, res2.minFlips),
             )
         } else {
             Result(0, 1)
diff --git a/src/main/kotlin/g1901_2000/s1904_the_number_of_full_rounds_you_have_played/Solution.kt b/src/main/kotlin/g1901_2000/s1904_the_number_of_full_rounds_you_have_played/Solution.kt
index f89c1723f..0e19c7db0 100644
--- a/src/main/kotlin/g1901_2000/s1904_the_number_of_full_rounds_you_have_played/Solution.kt
+++ b/src/main/kotlin/g1901_2000/s1904_the_number_of_full_rounds_you_have_played/Solution.kt
@@ -21,7 +21,9 @@ class Solution {
                 calculateFullRounds(loginSerializeTime, MID_NIGHT_END) +
                     calculateFullRounds(MID_NIGHT_START, logoutSerializeTime)
                 )
-        } else calculateFullRounds(loginSerializeTime, logoutSerializeTime)
+        } else {
+            calculateFullRounds(loginSerializeTime, logoutSerializeTime)
+        }
     }
 
     private fun maskSerializeTime(serializeTime: Int, mask: Int): Int {
diff --git a/src/main/kotlin/g1901_2000/s1931_painting_a_grid_with_three_different_colors/Solution.kt b/src/main/kotlin/g1901_2000/s1931_painting_a_grid_with_three_different_colors/Solution.kt
index c370dd176..3463e2ace 100644
--- a/src/main/kotlin/g1901_2000/s1931_painting_a_grid_with_three_different_colors/Solution.kt
+++ b/src/main/kotlin/g1901_2000/s1931_painting_a_grid_with_three_different_colors/Solution.kt
@@ -30,7 +30,7 @@ class Solution {
             paintingToTemplate,
             paintingCountForTemplate,
             templateToIndex,
-            templateCounter
+            templateCounter,
         )
         extracted(m, totalPaintings, paintingToTemplate, templateEdgeCount)
         for (i in 0 until totalTemplates) {
@@ -56,7 +56,7 @@ class Solution {
         m: Int,
         totalPaintings: Int,
         paintingToTemplate: IntArray,
-        templateEdgeCount: Array<LongArray>
+        templateEdgeCount: Array<LongArray>,
     ) {
         for (i in 0 until totalPaintings) {
             if (paintingToTemplate[i] == -1) {
@@ -80,7 +80,7 @@ class Solution {
         paintingToTemplate: IntArray,
         paintingCountForTemplate: LongArray,
         templateToIndex: MutableMap<Int, Int>,
-        templateCounter: Int
+        templateCounter: Int,
     ) {
         var templateCounter = templateCounter
         for (i in 0 until totalPaintings) {
diff --git a/src/main/kotlin/g1901_2000/s1932_merge_bsts_to_create_single_bst/Solution.kt b/src/main/kotlin/g1901_2000/s1932_merge_bsts_to_create_single_bst/Solution.kt
index 3206cce39..925240b90 100644
--- a/src/main/kotlin/g1901_2000/s1932_merge_bsts_to_create_single_bst/Solution.kt
+++ b/src/main/kotlin/g1901_2000/s1932_merge_bsts_to_create_single_bst/Solution.kt
@@ -22,31 +22,45 @@ class Solution {
         for (tree in trees) {
             valToNode[tree.`val`] = tree
             count.merge(
-                tree.`val`, 1
+                tree.`val`,
+                1,
             ) { a: Int?, b: Int? ->
                 Integer.sum(
-                    a!!, b!!
+                    a!!,
+                    b!!,
                 )
             }
-            if (tree.left != null) count.merge(
-                tree.left!!.`val`, 1
-            ) { a: Int?, b: Int? ->
-                Integer.sum(
-                    a!!, b!!
-                )
+            if (tree.left != null) {
+                count.merge(
+                    tree.left!!.`val`,
+                    1,
+                ) { a: Int?, b: Int? ->
+                    Integer.sum(
+                        a!!,
+                        b!!,
+                    )
+                }
             }
-            if (tree.right != null) count.merge(
-                tree.right!!.`val`, 1
-            ) { a: Int?, b: Int? ->
-                Integer.sum(
-                    a!!, b!!
-                )
+            if (tree.right != null) {
+                count.merge(
+                    tree.right!!.`val`,
+                    1,
+                ) { a: Int?, b: Int? ->
+                    Integer.sum(
+                        a!!,
+                        b!!,
+                    )
+                }
             }
         }
         for (tree in trees) if (count[tree.`val`] == 1) {
             return if (isValidBST(tree, null, null, valToNode) &&
                 valToNode.size <= 1
-            ) tree else null
+            ) {
+                tree
+            } else {
+                null
+            }
         }
         return null
     }
@@ -55,7 +69,7 @@ class Solution {
         tree: TreeNode?,
         minNode: TreeNode?,
         maxNode: TreeNode?,
-        valToNode: MutableMap<Int, TreeNode>
+        valToNode: MutableMap<Int, TreeNode>,
     ): Boolean {
         if (tree == null) return true
         if (minNode != null && tree.`val` <= minNode.`val`) return false
diff --git a/src/main/kotlin/g1901_2000/s1958_check_if_move_is_legal/Solution.kt b/src/main/kotlin/g1901_2000/s1958_check_if_move_is_legal/Solution.kt
index 0153c9ee3..f4e0353d3 100644
--- a/src/main/kotlin/g1901_2000/s1958_check_if_move_is_legal/Solution.kt
+++ b/src/main/kotlin/g1901_2000/s1958_check_if_move_is_legal/Solution.kt
@@ -39,7 +39,7 @@ class Solution {
             intArrayOf(0, 1),
             intArrayOf(1, -1),
             intArrayOf(1, 0),
-            intArrayOf(1, 1)
+            intArrayOf(1, 1),
         )
     }
 }
diff --git a/src/main/kotlin/g1901_2000/s1977_number_of_ways_to_separate_numbers/Solution.kt b/src/main/kotlin/g1901_2000/s1977_number_of_ways_to_separate_numbers/Solution.kt
index 0ed6e0fd5..4778a2007 100644
--- a/src/main/kotlin/g1901_2000/s1977_number_of_ways_to_separate_numbers/Solution.kt
+++ b/src/main/kotlin/g1901_2000/s1977_number_of_ways_to_separate_numbers/Solution.kt
@@ -28,13 +28,18 @@ class Solution {
                 val len = j - i + 1
                 val prevStart = i - 1 - (len - 1)
                 var count: Long
-                if (prevStart < 0) count = pref[i - 1][i - 1] else {
+                if (prevStart < 0) {
+                    count = pref[i - 1][i - 1]
+                } else {
                     count = (pref[i - 1][i - 1] - pref[prevStart][i - 1] + mod) % mod
                     if (compare(prevStart, i, len, dp, num)) {
                         val cnt =
                             (
-                                if (prevStart == 0) pref[prevStart][i - 1] else
+                                if (prevStart == 0) {
+                                    pref[prevStart][i - 1]
+                                } else {
                                     pref[prevStart][i - 1] - pref[prevStart - 1][i - 1] + mod
+                                }
                                 ) % mod
                         count = (count + cnt + mod) % mod
                     }
diff --git a/src/main/kotlin/g1901_2000/s1991_find_the_middle_index_in_array/Solution.kt b/src/main/kotlin/g1901_2000/s1991_find_the_middle_index_in_array/Solution.kt
index ee9957eaf..2df372fe4 100644
--- a/src/main/kotlin/g1901_2000/s1991_find_the_middle_index_in_array/Solution.kt
+++ b/src/main/kotlin/g1901_2000/s1991_find_the_middle_index_in_array/Solution.kt
@@ -17,7 +17,7 @@ class Solution {
          Traverse the array: At each index, subtract the element from rightSum and
          check if leftSum equals rightSum. If they do, return the index.
          Otherwise, add the number at current index to the leftSum and traverse further.
-        */for (i in nums.indices) {
+         */for (i in nums.indices) {
             rightSum -= nums[i]
             if (leftSum == rightSum) {
                 return i
diff --git a/src/main/kotlin/g2001_2100/s2008_maximum_earnings_from_taxi/Solution.kt b/src/main/kotlin/g2001_2100/s2008_maximum_earnings_from_taxi/Solution.kt
index 76e34089b..9e82c616e 100644
--- a/src/main/kotlin/g2001_2100/s2008_maximum_earnings_from_taxi/Solution.kt
+++ b/src/main/kotlin/g2001_2100/s2008_maximum_earnings_from_taxi/Solution.kt
@@ -19,7 +19,7 @@ class Solution {
         val myQueue = PriorityQueue { a: LongArray, b: LongArray ->
             java.lang.Long.compare(
                 a[0],
-                b[0]
+                b[0],
             )
         }
         for (i in rides.indices) {
diff --git a/src/main/kotlin/g2001_2100/s2029_stone_game_ix/Solution.kt b/src/main/kotlin/g2001_2100/s2029_stone_game_ix/Solution.kt
index aadf2bc7f..a2134f5a8 100644
--- a/src/main/kotlin/g2001_2100/s2029_stone_game_ix/Solution.kt
+++ b/src/main/kotlin/g2001_2100/s2029_stone_game_ix/Solution.kt
@@ -27,6 +27,8 @@ class Solution {
         }
         return if (zero % 2 == 1) {
             max - 2 > min
-        } else false
+        } else {
+            false
+        }
     }
 }
diff --git a/src/main/kotlin/g2001_2100/s2035_partition_array_into_two_arrays_to_minimize_sum_difference/Solution.kt b/src/main/kotlin/g2001_2100/s2035_partition_array_into_two_arrays_to_minimize_sum_difference/Solution.kt
index b9ef87e53..4cbfb2c11 100644
--- a/src/main/kotlin/g2001_2100/s2035_partition_array_into_two_arrays_to_minimize_sum_difference/Solution.kt
+++ b/src/main/kotlin/g2001_2100/s2035_partition_array_into_two_arrays_to_minimize_sum_difference/Solution.kt
@@ -51,7 +51,7 @@ class Solution {
                 if (idx < sums1.size) {
                     min = Math.min(
                         min,
-                        Math.abs(sum - s1 - sums2[idx] - (sums2[idx] + s1))
+                        Math.abs(sum - s1 - sums2[idx] - (sums2[idx] + s1)),
                     )
                 }
                 if (idx - 1 >= 0) {
@@ -59,8 +59,8 @@ class Solution {
                         min,
                         Math.abs(
                             sum - s1 - sums2[idx - 1] -
-                                (sums2[idx - 1] + s1)
-                        )
+                                (sums2[idx - 1] + s1),
+                        ),
                     )
                 }
             }
diff --git a/src/main/kotlin/g2001_2100/s2039_the_time_when_the_network_becomes_idle/Solution.kt b/src/main/kotlin/g2001_2100/s2039_the_time_when_the_network_becomes_idle/Solution.kt
index f84b1eb3a..007446e3d 100644
--- a/src/main/kotlin/g2001_2100/s2039_the_time_when_the_network_becomes_idle/Solution.kt
+++ b/src/main/kotlin/g2001_2100/s2039_the_time_when_the_network_becomes_idle/Solution.kt
@@ -21,7 +21,8 @@ class Solution {
         distance[0] = 0
         val pq = PriorityQueue { a1: IntArray, a2: IntArray ->
             Integer.compare(
-                a1[1], a2[1]
+                a1[1],
+                a2[1],
             )
         }
         pq.add(intArrayOf(0, 0))
diff --git a/src/main/kotlin/g2001_2100/s2056_number_of_valid_move_combinations_on_chessboard/Solution.kt b/src/main/kotlin/g2001_2100/s2056_number_of_valid_move_combinations_on_chessboard/Solution.kt
index 98ca9eabd..239722649 100644
--- a/src/main/kotlin/g2001_2100/s2056_number_of_valid_move_combinations_on_chessboard/Solution.kt
+++ b/src/main/kotlin/g2001_2100/s2056_number_of_valid_move_combinations_on_chessboard/Solution.kt
@@ -15,9 +15,9 @@ class Solution {
             intArrayOf(1, 1),
             intArrayOf(-1, -1),
             intArrayOf(-1, 1),
-            intArrayOf(1, -1)
+            intArrayOf(1, -1),
         ),
-        arrayOf(intArrayOf(1, 1), intArrayOf(-1, -1), intArrayOf(-1, 1), intArrayOf(1, -1))
+        arrayOf(intArrayOf(1, 1), intArrayOf(-1, -1), intArrayOf(-1, 1), intArrayOf(1, -1)),
     )
 
     fun countCombinations(pieces: Array<String?>, positions: Array<IntArray>): Int {
diff --git a/src/main/kotlin/g2001_2100/s2060_check_if_an_original_string_exists_given_two_encoded_strings/Solution.kt b/src/main/kotlin/g2001_2100/s2060_check_if_an_original_string_exists_given_two_encoded_strings/Solution.kt
index 2ac9cdca7..44ac9d887 100644
--- a/src/main/kotlin/g2001_2100/s2060_check_if_an_original_string_exists_given_two_encoded_strings/Solution.kt
+++ b/src/main/kotlin/g2001_2100/s2060_check_if_an_original_string_exists_given_two_encoded_strings/Solution.kt
@@ -81,7 +81,7 @@ class Solution {
         i2: Int,
         diff: Int,
         indexNums1: List<IntArray>,
-        indexNums2: List<IntArray>
+        indexNums2: List<IntArray>,
     ): Boolean {
         val c1 = s1!![i1]
         val c2 = s2!![i2]
diff --git a/src/main/kotlin/g2001_2100/s2065_maximum_path_quality_of_a_graph/Solution.kt b/src/main/kotlin/g2001_2100/s2065_maximum_path_quality_of_a_graph/Solution.kt
index acc907e4d..ed2e96358 100644
--- a/src/main/kotlin/g2001_2100/s2065_maximum_path_quality_of_a_graph/Solution.kt
+++ b/src/main/kotlin/g2001_2100/s2065_maximum_path_quality_of_a_graph/Solution.kt
@@ -32,7 +32,7 @@ class Solution {
         curTime: Int,
         maxTime: Int,
         curValue: Int,
-        values: IntArray
+        values: IntArray,
     ) {
         if (curTime > maxTime) {
             return
diff --git a/src/main/kotlin/g2001_2100/s2097_valid_arrangement_of_pairs/Solution.kt b/src/main/kotlin/g2001_2100/s2097_valid_arrangement_of_pairs/Solution.kt
index 02b92e1db..54ee37a6e 100644
--- a/src/main/kotlin/g2001_2100/s2097_valid_arrangement_of_pairs/Solution.kt
+++ b/src/main/kotlin/g2001_2100/s2097_valid_arrangement_of_pairs/Solution.kt
@@ -19,7 +19,7 @@ class Solution {
 
     private fun getAdList(
         pairs: Array<IntArray>,
-        inOutEdge: HashMap<Int, IntArray>
+        inOutEdge: HashMap<Int, IntArray>,
     ): HashMap<Int, Queue<Int>> {
         val adList = HashMap<Int, Queue<Int>>()
         for (pair in pairs) {
diff --git a/src/main/kotlin/g2101_2200/s2102_sequentially_ordinal_rank_tracker/SORTracker.kt b/src/main/kotlin/g2101_2200/s2102_sequentially_ordinal_rank_tracker/SORTracker.kt
index 0605339bf..5ee10dd3c 100644
--- a/src/main/kotlin/g2101_2200/s2102_sequentially_ordinal_rank_tracker/SORTracker.kt
+++ b/src/main/kotlin/g2101_2200/s2102_sequentially_ordinal_rank_tracker/SORTracker.kt
@@ -19,7 +19,7 @@ class SORTracker {
                 } else {
                     a.name.compareTo(b.name)
                 }
-            }
+            },
         )
         tSet2 = TreeSet(
             Comparator { a: Location?, b: Location? ->
@@ -28,7 +28,7 @@ class SORTracker {
                 } else {
                     a.name.compareTo(b.name)
                 }
-            }
+            },
         )
     }
 
diff --git a/src/main/kotlin/g2101_2200/s2115_find_all_possible_recipes_from_given_supplies/Solution.kt b/src/main/kotlin/g2101_2200/s2115_find_all_possible_recipes_from_given_supplies/Solution.kt
index d2014853a..6bf09f747 100644
--- a/src/main/kotlin/g2101_2200/s2115_find_all_possible_recipes_from_given_supplies/Solution.kt
+++ b/src/main/kotlin/g2101_2200/s2115_find_all_possible_recipes_from_given_supplies/Solution.kt
@@ -10,7 +10,7 @@ class Solution {
     fun findAllRecipes(
         recipes: Array<String>,
         ingredients: List<List<String>>,
-        supplies: Array<String>
+        supplies: Array<String>,
     ): List<String> {
         val indegree: MutableMap<String, Int> = HashMap()
         val supplySet: MutableSet<String> = HashSet()
diff --git a/src/main/kotlin/g2101_2200/s2119_a_number_after_a_double_reversal/Solution.kt b/src/main/kotlin/g2101_2200/s2119_a_number_after_a_double_reversal/Solution.kt
index 15945e8bd..f1d4c9a8c 100644
--- a/src/main/kotlin/g2101_2200/s2119_a_number_after_a_double_reversal/Solution.kt
+++ b/src/main/kotlin/g2101_2200/s2119_a_number_after_a_double_reversal/Solution.kt
@@ -6,6 +6,8 @@ class Solution {
     fun isSameAfterReversals(num: Int): Boolean {
         return if (num == 0) {
             true
-        } else num % 10 != 0
+        } else {
+            num % 10 != 0
+        }
     }
 }
diff --git a/src/main/kotlin/g2101_2200/s2124_check_if_all_as_appears_before_all_bs/Solution.kt b/src/main/kotlin/g2101_2200/s2124_check_if_all_as_appears_before_all_bs/Solution.kt
index 74faa21cb..e6c4d0183 100644
--- a/src/main/kotlin/g2101_2200/s2124_check_if_all_as_appears_before_all_bs/Solution.kt
+++ b/src/main/kotlin/g2101_2200/s2124_check_if_all_as_appears_before_all_bs/Solution.kt
@@ -23,6 +23,8 @@ class Solution {
         }
         return if (aEndIndex == -1 || bStartIndex == -1) {
             true
-        } else bStartIndex > aEndIndex
+        } else {
+            bStartIndex > aEndIndex
+        }
     }
 }
diff --git a/src/main/kotlin/g2101_2200/s2132_stamping_the_grid/Solution.kt b/src/main/kotlin/g2101_2200/s2132_stamping_the_grid/Solution.kt
index ebfe4c124..0b78571bd 100644
--- a/src/main/kotlin/g2101_2200/s2132_stamping_the_grid/Solution.kt
+++ b/src/main/kotlin/g2101_2200/s2132_stamping_the_grid/Solution.kt
@@ -24,12 +24,12 @@ class Solution {
                 if (row[j] == 0) {
                     if (j + 1 < rl && row[j + 1] == 1 && j - w + 1 >= 0 &&
                         i + 1 < grid.size && grid[i + 1][j] == 1 && i - h + 1 >= 0 && canPaved(
-                                grid,
-                                i - h + 1,
-                                j - w + 1,
-                                i,
-                                j
-                            )
+                            grid,
+                            i - h + 1,
+                            j - w + 1,
+                            i,
+                            j,
+                        )
                     ) {
                         return false
                     }
diff --git a/src/main/kotlin/g2101_2200/s2145_count_the_hidden_sequences/Solution.kt b/src/main/kotlin/g2101_2200/s2145_count_the_hidden_sequences/Solution.kt
index 12afb8962..985829252 100644
--- a/src/main/kotlin/g2101_2200/s2145_count_the_hidden_sequences/Solution.kt
+++ b/src/main/kotlin/g2101_2200/s2145_count_the_hidden_sequences/Solution.kt
@@ -31,6 +31,8 @@ class Solution {
         val high = upper - max
         return if (low > high) {
             0
-        } else high - low + 1
+        } else {
+            high - low + 1
+        }
     }
 }
diff --git a/src/main/kotlin/g2101_2200/s2151_maximum_good_people_based_on_statements/Solution.kt b/src/main/kotlin/g2101_2200/s2151_maximum_good_people_based_on_statements/Solution.kt
index 88936e014..0952bf5f5 100644
--- a/src/main/kotlin/g2101_2200/s2151_maximum_good_people_based_on_statements/Solution.kt
+++ b/src/main/kotlin/g2101_2200/s2151_maximum_good_people_based_on_statements/Solution.kt
@@ -13,13 +13,15 @@ class Solution {
     private fun max(statements: Array<IntArray>, known: IntArray, position: Int): Int {
         return if (position == statements.size) {
             known.asSequence().filter { a: Int -> a == 1 }.count()
-        } else when (known[position]) {
-            0 -> assumeBad(statements, known, position)
-            1 -> assumeGood(statements, known, position)
-            else -> Math.max(
-                assumeBad(statements, known, position),
-                assumeGood(statements, known, position)
-            )
+        } else {
+            when (known[position]) {
+                0 -> assumeBad(statements, known, position)
+                1 -> assumeGood(statements, known, position)
+                else -> Math.max(
+                    assumeBad(statements, known, position),
+                    assumeGood(statements, known, position),
+                )
+            }
         }
     }
 
diff --git a/src/main/kotlin/g2101_2200/s2162_minimum_cost_to_set_cooking_time/Solution.kt b/src/main/kotlin/g2101_2200/s2162_minimum_cost_to_set_cooking_time/Solution.kt
index 1d7e95170..aa2e58e52 100644
--- a/src/main/kotlin/g2101_2200/s2162_minimum_cost_to_set_cooking_time/Solution.kt
+++ b/src/main/kotlin/g2101_2200/s2162_minimum_cost_to_set_cooking_time/Solution.kt
@@ -8,7 +8,7 @@ class Solution {
         val secs = targetSeconds % 60
         return Math.min(
             cost(mins, secs, startAt, moveCost, pushCost),
-            cost(mins - 1, secs + 60, startAt, moveCost, pushCost)
+            cost(mins - 1, secs + 60, startAt, moveCost, pushCost),
         )
     }
 
diff --git a/src/main/kotlin/g2101_2200/s2170_minimum_operations_to_make_the_array_alternating/Solution.kt b/src/main/kotlin/g2101_2200/s2170_minimum_operations_to_make_the_array_alternating/Solution.kt
index 5572ddc48..e9653dd2d 100644
--- a/src/main/kotlin/g2101_2200/s2170_minimum_operations_to_make_the_array_alternating/Solution.kt
+++ b/src/main/kotlin/g2101_2200/s2170_minimum_operations_to_make_the_array_alternating/Solution.kt
@@ -47,7 +47,7 @@ class Solution {
             }
             ans = Math.min(
                 n / 2 + n % 2 - maxEven + (n / 2 - secondOdd),
-                n / 2 + n % 2 - secondEven + (n / 2 - maxOdd)
+                n / 2 + n % 2 - secondEven + (n / 2 - maxOdd),
             )
         } else {
             ans = n / 2 + n % 2 - maxEven + n / 2 - maxOdd
diff --git a/src/main/kotlin/g2101_2200/s2172_maximum_and_sum_of_array/Solution.kt b/src/main/kotlin/g2101_2200/s2172_maximum_and_sum_of_array/Solution.kt
index 3669e3ecd..01d342092 100644
--- a/src/main/kotlin/g2101_2200/s2172_maximum_and_sum_of_array/Solution.kt
+++ b/src/main/kotlin/g2101_2200/s2172_maximum_and_sum_of_array/Solution.kt
@@ -23,7 +23,7 @@ class Solution {
             if (mask / bit % 3 > 0) {
                 memo[mask] = Math.max(
                     memo[mask],
-                    (ints[i] and slot) + dp(i - 1, mask - bit, numSlots, memo, ints)
+                    (ints[i] and slot) + dp(i - 1, mask - bit, numSlots, memo, ints),
                 )
             }
             ++slot
diff --git a/src/main/kotlin/g2101_2200/s2177_find_three_consecutive_integers_that_sum_to_a_given_number/Solution.kt b/src/main/kotlin/g2101_2200/s2177_find_three_consecutive_integers_that_sum_to_a_given_number/Solution.kt
index 364a63157..35b0f9828 100644
--- a/src/main/kotlin/g2101_2200/s2177_find_three_consecutive_integers_that_sum_to_a_given_number/Solution.kt
+++ b/src/main/kotlin/g2101_2200/s2177_find_three_consecutive_integers_that_sum_to_a_given_number/Solution.kt
@@ -6,6 +6,8 @@ class Solution {
     fun sumOfThree(num: Long): LongArray {
         return if (num % 3 == 0L) {
             longArrayOf(num / 3 - 1, num / 3, num / 3 + 1)
-        } else LongArray(0)
+        } else {
+            LongArray(0)
+        }
     }
 }
diff --git a/src/main/kotlin/g2101_2200/s2178_maximum_split_of_positive_even_integers/Solution.kt b/src/main/kotlin/g2101_2200/s2178_maximum_split_of_positive_even_integers/Solution.kt
index 148185b05..1e5f55d31 100644
--- a/src/main/kotlin/g2101_2200/s2178_maximum_split_of_positive_even_integers/Solution.kt
+++ b/src/main/kotlin/g2101_2200/s2178_maximum_split_of_positive_even_integers/Solution.kt
@@ -23,7 +23,7 @@ class Solution {
         result = [2,4,6]
         so remove 6 from list and add it to remainigSum and insert to list
         result = [2,4,10]
-        */
+         */
         val lastSum = result[result.size - 1]
         result.removeAt(result.size - 1)
         result.add(lastSum + remainingSum)
diff --git a/src/main/kotlin/g2101_2200/s2183_count_array_pairs_divisible_by_k/Solution.kt b/src/main/kotlin/g2101_2200/s2183_count_array_pairs_divisible_by_k/Solution.kt
index 99f94126a..dce49fe17 100644
--- a/src/main/kotlin/g2101_2200/s2183_count_array_pairs_divisible_by_k/Solution.kt
+++ b/src/main/kotlin/g2101_2200/s2183_count_array_pairs_divisible_by_k/Solution.kt
@@ -25,6 +25,8 @@ class Solution {
         }
         return if (a == 0) {
             b
-        } else gcd(a, b % a)
+        } else {
+            gcd(a, b % a)
+        }
     }
 }
diff --git a/src/main/kotlin/g2101_2200/s2187_minimum_time_to_complete_trips/Solution.kt b/src/main/kotlin/g2101_2200/s2187_minimum_time_to_complete_trips/Solution.kt
index a0ef0f9de..4822d6d1a 100644
--- a/src/main/kotlin/g2101_2200/s2187_minimum_time_to_complete_trips/Solution.kt
+++ b/src/main/kotlin/g2101_2200/s2187_minimum_time_to_complete_trips/Solution.kt
@@ -12,10 +12,14 @@ class Solution {
             return Long.MAX_VALUE
         }
         val mid = left + right shr 1
-        return if (isPossible(time, mid, totalTrips)) Math.min(
-            mid,
-            bs(left, mid - 1, time, totalTrips)
-        ) else bs(mid + 1, right, time, totalTrips)
+        return if (isPossible(time, mid, totalTrips)) {
+            Math.min(
+                mid,
+                bs(left, mid - 1, time, totalTrips),
+            )
+        } else {
+            bs(mid + 1, right, time, totalTrips)
+        }
     }
 
     private fun isPossible(time: IntArray, mid: Long, totalTrips: Long): Boolean {
diff --git a/src/main/kotlin/g2101_2200/s2197_replace_non_coprime_numbers_in_array/Solution.kt b/src/main/kotlin/g2101_2200/s2197_replace_non_coprime_numbers_in_array/Solution.kt
index 34e6657b6..b32ddbef7 100644
--- a/src/main/kotlin/g2101_2200/s2197_replace_non_coprime_numbers_in_array/Solution.kt
+++ b/src/main/kotlin/g2101_2200/s2197_replace_non_coprime_numbers_in_array/Solution.kt
@@ -33,7 +33,9 @@ class Solution {
         }
         return if (b % a == 0) {
             a
-        } else gcd(b % a, a)
+        } else {
+            gcd(b % a, a)
+        }
     }
 
     private fun recursivelyCheck(list: ArrayList<Int>) {
diff --git a/src/main/kotlin/g2201_2300/s2232_minimize_result_by_adding_parentheses_to_expression/Solution.kt b/src/main/kotlin/g2201_2300/s2232_minimize_result_by_adding_parentheses_to_expression/Solution.kt
index 17d45bdca..33f6c3971 100644
--- a/src/main/kotlin/g2201_2300/s2232_minimize_result_by_adding_parentheses_to_expression/Solution.kt
+++ b/src/main/kotlin/g2201_2300/s2232_minimize_result_by_adding_parentheses_to_expression/Solution.kt
@@ -59,7 +59,7 @@ class Solution {
     a = (0, left) // from the start of the expression to the first parentheses
     b = (left, right) // between parentheses, include plus sign
     c = (right, end of expression) // from the last parentheses to the end
-    */
+     */
     private fun evaluate(left: Int, right: Int, expression: String): Int {
         // This means that the parentheses are at the beginning or end of the expression and are
         // equal to the range of the expression to be evaluated. Return 1 to avoid zero factors in
diff --git a/src/main/kotlin/g2201_2300/s2260_minimum_consecutive_cards_to_pick_up/Solution.kt b/src/main/kotlin/g2201_2300/s2260_minimum_consecutive_cards_to_pick_up/Solution.kt
index 99e9f6c32..2f44395a5 100644
--- a/src/main/kotlin/g2201_2300/s2260_minimum_consecutive_cards_to_pick_up/Solution.kt
+++ b/src/main/kotlin/g2201_2300/s2260_minimum_consecutive_cards_to_pick_up/Solution.kt
@@ -16,6 +16,8 @@ class Solution {
         }
         return if (mindiff == Int.MAX_VALUE) {
             -1
-        } else mindiff
+        } else {
+            mindiff
+        }
     }
 }
diff --git a/src/main/kotlin/g2201_2300/s2264_largest_3_same_digit_number_in_string/Solution.kt b/src/main/kotlin/g2201_2300/s2264_largest_3_same_digit_number_in_string/Solution.kt
index bd72995f7..1c89a1155 100644
--- a/src/main/kotlin/g2201_2300/s2264_largest_3_same_digit_number_in_string/Solution.kt
+++ b/src/main/kotlin/g2201_2300/s2264_largest_3_same_digit_number_in_string/Solution.kt
@@ -17,6 +17,8 @@ class Solution {
         }
         return if (c == 0) {
             ""
-        } else maxi
+        } else {
+            maxi
+        }
     }
 }
diff --git a/src/main/kotlin/g2201_2300/s2267_check_if_there_is_a_valid_parentheses_string_path/Solution.kt b/src/main/kotlin/g2201_2300/s2267_check_if_there_is_a_valid_parentheses_string_path/Solution.kt
index b6f1646c2..9b6406a85 100644
--- a/src/main/kotlin/g2201_2300/s2267_check_if_there_is_a_valid_parentheses_string_path/Solution.kt
+++ b/src/main/kotlin/g2201_2300/s2267_check_if_there_is_a_valid_parentheses_string_path/Solution.kt
@@ -19,7 +19,9 @@ class Solution {
         }
         return if ((m + n) % 2 == 0) {
             false
-        } else dfs(0, 0, 0, 0, dp)
+        } else {
+            dfs(0, 0, 0, 0, dp)
+        }
     }
 
     private fun dfs(u: Int, v: Int, open: Int, close: Int, dp: Array<Array<Array<Boolean?>>>): Boolean {
diff --git a/src/main/kotlin/g2201_2300/s2273_find_resultant_array_after_removing_anagrams/Solution.kt b/src/main/kotlin/g2201_2300/s2273_find_resultant_array_after_removing_anagrams/Solution.kt
index 500d319b6..407db6618 100644
--- a/src/main/kotlin/g2201_2300/s2273_find_resultant_array_after_removing_anagrams/Solution.kt
+++ b/src/main/kotlin/g2201_2300/s2273_find_resultant_array_after_removing_anagrams/Solution.kt
@@ -23,7 +23,7 @@ class Solution {
 
     /*
     Utility to check if the 2 words are anagrams or not
-    */
+     */
     private fun isAnagram(word1: String, word2: String): Boolean {
         val charMap = IntArray(26)
         val word1Arr = word1.toCharArray()
diff --git a/src/main/kotlin/g2201_2300/s2281_sum_of_total_strength_of_wizards/Solution.kt b/src/main/kotlin/g2201_2300/s2281_sum_of_total_strength_of_wizards/Solution.kt
index 0a4c081b4..777c89998 100644
--- a/src/main/kotlin/g2201_2300/s2281_sum_of_total_strength_of_wizards/Solution.kt
+++ b/src/main/kotlin/g2201_2300/s2281_sum_of_total_strength_of_wizards/Solution.kt
@@ -41,9 +41,9 @@ class Solution {
                         res +
                             getSum(
                                 nums, forward, prefix, backward, suffix,
-                                prev, cur, i
+                                prev, cur, i,
                             ) *
-                                nums[cur]
+                            nums[cur]
                         ) %
                         mod
                     )
@@ -57,7 +57,7 @@ class Solution {
                 (
                     res +
                         getSum(nums, forward, prefix, backward, suffix, prev, cur, n) *
-                            nums[cur]
+                        nums[cur]
                     ) %
                     mod
                 )
@@ -73,7 +73,7 @@ class Solution {
         suffix: LongArray,
         prev: Int,
         cur: Int,
-        next: Int
+        next: Int,
     ): Long {
         val sum = (cur - prev) * nums[cur].toLong() % mod * (next - cur) % mod
         val preSum = getPresum(backward, suffix, prev + 1, cur - 1, next - cur)
diff --git a/src/main/kotlin/g2201_2300/s2286_booking_concert_tickets_in_groups/BookMyShow.kt b/src/main/kotlin/g2201_2300/s2286_booking_concert_tickets_in_groups/BookMyShow.kt
index c9614f79f..0c6f23b6d 100644
--- a/src/main/kotlin/g2201_2300/s2286_booking_concert_tickets_in_groups/BookMyShow.kt
+++ b/src/main/kotlin/g2201_2300/s2286_booking_concert_tickets_in_groups/BookMyShow.kt
@@ -81,7 +81,9 @@ class BookMyShow(n: Int, private val m: Int) {
         val left = mostLeft(v * 2 + 1, l, mid, k, qr)
         return if (left != -1) {
             left
-        } else mostLeft(v * 2 + 2, mid, r, k, qr)
+        } else {
+            mostLeft(v * 2 + 2, mid, r, k, qr)
+        }
     }
 
     fun scatter(k: Int, maxRow: Int): Boolean {
@@ -146,7 +148,9 @@ class BookMyShow(n: Int, private val m: Int) {
         private fun nextPow2(n: Int): Int {
             return if (n and n - 1 == 0) {
                 n
-            } else Integer.highestOneBit(n) shl 1
+            } else {
+                Integer.highestOneBit(n) shl 1
+            }
         }
     }
 }
diff --git a/src/main/kotlin/g2201_2300/s2288_apply_discount_to_prices/Solution.kt b/src/main/kotlin/g2201_2300/s2288_apply_discount_to_prices/Solution.kt
index ec3ed1069..5e1006ff1 100644
--- a/src/main/kotlin/g2201_2300/s2288_apply_discount_to_prices/Solution.kt
+++ b/src/main/kotlin/g2201_2300/s2288_apply_discount_to_prices/Solution.kt
@@ -31,12 +31,14 @@ class Solution {
             }
             return if (price < 100) {
                 "$0.$stringPrice"
-            } else (
-                "$" +
-                    stringPrice.substring(0, stringPrice.length - 2) +
-                    "." +
-                    stringPrice.substring(stringPrice.length - 2)
-                )
+            } else {
+                (
+                    "$" +
+                        stringPrice.substring(0, stringPrice.length - 2) +
+                        "." +
+                        stringPrice.substring(stringPrice.length - 2)
+                    )
+            }
         }
         return s
     }
diff --git a/src/main/kotlin/g2301_2400/s2318_number_of_distinct_roll_sequences/Solution.kt b/src/main/kotlin/g2301_2400/s2318_number_of_distinct_roll_sequences/Solution.kt
index 309f7981e..61963621f 100644
--- a/src/main/kotlin/g2301_2400/s2318_number_of_distinct_roll_sequences/Solution.kt
+++ b/src/main/kotlin/g2301_2400/s2318_number_of_distinct_roll_sequences/Solution.kt
@@ -12,7 +12,7 @@ class Solution {
         intArrayOf(1, 2, 4, 5),
         intArrayOf(1, 3, 5),
         intArrayOf(1, 2, 3, 4, 6),
-        intArrayOf(1, 5)
+        intArrayOf(1, 5),
     )
 
     fun distinctSequences(n: Int): Int {
diff --git a/src/main/kotlin/g2301_2400/s2322_minimum_score_after_removals_on_a_tree/Solution.kt b/src/main/kotlin/g2301_2400/s2322_minimum_score_after_removals_on_a_tree/Solution.kt
index 118c93d8f..572431e86 100644
--- a/src/main/kotlin/g2301_2400/s2322_minimum_score_after_removals_on_a_tree/Solution.kt
+++ b/src/main/kotlin/g2301_2400/s2322_minimum_score_after_removals_on_a_tree/Solution.kt
@@ -14,7 +14,7 @@ class Solution {
         par: Int,
         block: Int,
         xor1: Int,
-        tot: Int
+        tot: Int,
     ): Int {
         // Setting the value for the current subtree's XOR value
         var myXOR = arr[src]
diff --git a/src/main/kotlin/g2301_2400/s2349_design_a_number_container_system/NumberContainers.kt b/src/main/kotlin/g2301_2400/s2349_design_a_number_container_system/NumberContainers.kt
index f65ac8f16..24ef6c32a 100644
--- a/src/main/kotlin/g2301_2400/s2349_design_a_number_container_system/NumberContainers.kt
+++ b/src/main/kotlin/g2301_2400/s2349_design_a_number_container_system/NumberContainers.kt
@@ -23,7 +23,9 @@ class NumberContainers {
     fun find(number: Int): Int {
         return if (indices.containsKey(number)) {
             indices[number]!!.first()
-        } else -1
+        } else {
+            -1
+        }
     }
 }
 /*
diff --git a/src/main/kotlin/g2301_2400/s2353_design_a_food_rating_system/FoodRatings.kt b/src/main/kotlin/g2301_2400/s2353_design_a_food_rating_system/FoodRatings.kt
index 89c8428fb..7aae72386 100644
--- a/src/main/kotlin/g2301_2400/s2353_design_a_food_rating_system/FoodRatings.kt
+++ b/src/main/kotlin/g2301_2400/s2353_design_a_food_rating_system/FoodRatings.kt
@@ -39,7 +39,9 @@ class FoodRatings(foods: Array<String>, cuisines: Array<String>, ratings: IntArr
         override fun compare(f1: Food, f2: Food): Int {
             return if (f1.rating == f2.rating) {
                 f1.foodItem.compareTo(f2.foodItem)
-            } else Integer.compare(f2.rating, f1.rating)
+            } else {
+                Integer.compare(f2.rating, f1.rating)
+            }
         }
     }
 
diff --git a/src/main/kotlin/g2301_2400/s2360_longest_cycle_in_a_graph/Solution.kt b/src/main/kotlin/g2301_2400/s2360_longest_cycle_in_a_graph/Solution.kt
index cd6964318..da227cf9f 100644
--- a/src/main/kotlin/g2301_2400/s2360_longest_cycle_in_a_graph/Solution.kt
+++ b/src/main/kotlin/g2301_2400/s2360_longest_cycle_in_a_graph/Solution.kt
@@ -25,7 +25,7 @@ class Solution {
         path: IntArray,
         vis: BooleanArray,
         dfsvis: BooleanArray,
-        edges: IntArray
+        edges: IntArray,
     ): Int {
         vis[node] = true
         dfsvis[node] = true
diff --git a/src/main/kotlin/g2301_2400/s2374_node_with_highest_edge_score/Solution.kt b/src/main/kotlin/g2301_2400/s2374_node_with_highest_edge_score/Solution.kt
index 236a43e36..d8417707b 100644
--- a/src/main/kotlin/g2301_2400/s2374_node_with_highest_edge_score/Solution.kt
+++ b/src/main/kotlin/g2301_2400/s2374_node_with_highest_edge_score/Solution.kt
@@ -8,8 +8,9 @@ class Solution {
         var max = 0
         for (i in edges.indices) {
             a[edges[i]] += i.toLong()
-            if (a[edges[i]] > a[max]) max = edges[i]
-            else if (a[edges[i]] == a[max] && edges[i] < max) max = edges[i]
+            if (a[edges[i]] > a[max]) {
+                max = edges[i]
+            } else if (a[edges[i]] == a[max] && edges[i] < max) max = edges[i]
         }
         return max
     }
diff --git a/src/main/kotlin/g2301_2400/s2376_count_special_integers/Solution.kt b/src/main/kotlin/g2301_2400/s2376_count_special_integers/Solution.kt
index 0667fd0d8..7b0cabb5b 100644
--- a/src/main/kotlin/g2301_2400/s2376_count_special_integers/Solution.kt
+++ b/src/main/kotlin/g2301_2400/s2376_count_special_integers/Solution.kt
@@ -5,6 +5,7 @@ package g2301_2400.s2376_count_special_integers
 @Suppress("NAME_SHADOWING")
 class Solution {
     private lateinit var cntMap: IntArray
+
     // number n as an array, splitted by each digit
     private lateinit var digits: IntArray
 
@@ -48,7 +49,9 @@ class Solution {
     private fun count(i: Int, max: Int): Int {
         return if (i == 0) {
             max
-        } else (max - i) * count(i - 1, max)
+        } else {
+            (max - i) * count(i - 1, max)
+        }
     }
 
     private fun countUnbounded(len: Int): Int {
diff --git a/src/main/kotlin/g2301_2400/s2383_minimum_hours_of_training_to_win_a_competition/Solution.kt b/src/main/kotlin/g2301_2400/s2383_minimum_hours_of_training_to_win_a_competition/Solution.kt
index eb6edb918..32a31de9e 100644
--- a/src/main/kotlin/g2301_2400/s2383_minimum_hours_of_training_to_win_a_competition/Solution.kt
+++ b/src/main/kotlin/g2301_2400/s2383_minimum_hours_of_training_to_win_a_competition/Solution.kt
@@ -7,7 +7,7 @@ class Solution {
         initialEnergy: Int,
         initialExperience: Int,
         energy: IntArray,
-        experience: IntArray
+        experience: IntArray,
     ): Int {
         var totalEnergy = 0
         for (e in energy) {
diff --git a/src/main/kotlin/g2301_2400/s2398_maximum_number_of_robots_within_budget/Solution.kt b/src/main/kotlin/g2301_2400/s2398_maximum_number_of_robots_within_budget/Solution.kt
index af1436ba0..73ac2b748 100644
--- a/src/main/kotlin/g2301_2400/s2398_maximum_number_of_robots_within_budget/Solution.kt
+++ b/src/main/kotlin/g2301_2400/s2398_maximum_number_of_robots_within_budget/Solution.kt
@@ -21,7 +21,6 @@ class Solution {
         var left = 0
         var right = 0
         while (right < n) {
-
             // add right into the sliding window, so the window becomes [left, right].
             // update sliding window max and window sum.
             while (end - front > 0 && chargeTimes[deque[end - 1]] <= chargeTimes[right]) {
diff --git a/src/main/kotlin/g2401_2500/s2404_most_frequent_even_element/Solution.kt b/src/main/kotlin/g2401_2500/s2404_most_frequent_even_element/Solution.kt
index 88b171934..deca6d26d 100644
--- a/src/main/kotlin/g2401_2500/s2404_most_frequent_even_element/Solution.kt
+++ b/src/main/kotlin/g2401_2500/s2404_most_frequent_even_element/Solution.kt
@@ -9,8 +9,11 @@ class Solution {
         var small = Int.MAX_VALUE
 
         if (nums.size == 1) {
-            return if (nums[0] % 2 == 0) nums[0]
-            else -1
+            return if (nums[0] % 2 == 0) {
+                nums[0]
+            } else {
+                -1
+            }
         }
 
         for (i in nums.indices) {
diff --git a/src/main/kotlin/g2401_2500/s2409_count_days_spent_together/Solution.kt b/src/main/kotlin/g2401_2500/s2409_count_days_spent_together/Solution.kt
index 9a2ca18d0..9db5b9315 100644
--- a/src/main/kotlin/g2401_2500/s2409_count_days_spent_together/Solution.kt
+++ b/src/main/kotlin/g2401_2500/s2409_count_days_spent_together/Solution.kt
@@ -9,7 +9,7 @@ class Solution {
         arriveAlice: String,
         leaveAlice: String,
         arriveBob: String,
-        leaveBob: String
+        leaveBob: String,
     ): Int {
         if (leaveAlice < arriveBob || leaveBob < arriveAlice) {
             return 0
diff --git a/src/main/kotlin/g2401_2500/s2435_paths_in_matrix_whose_sum_is_divisible_by_k/Solution.kt b/src/main/kotlin/g2401_2500/s2435_paths_in_matrix_whose_sum_is_divisible_by_k/Solution.kt
index 00c269d5b..ee1e1cb56 100644
--- a/src/main/kotlin/g2401_2500/s2435_paths_in_matrix_whose_sum_is_divisible_by_k/Solution.kt
+++ b/src/main/kotlin/g2401_2500/s2435_paths_in_matrix_whose_sum_is_divisible_by_k/Solution.kt
@@ -21,8 +21,9 @@ class Solution {
     private fun numberOfPaths(grid: Array<IntArray>, r: Int, c: Int, k: Int, remainder: Int): Int {
         if (r to c !in grid) return 0
         if (cache[r][c][remainder] != -1) return cache[r][c][remainder]
-        if (r == row - 1 && c == col - 1)
+        if (r == row - 1 && c == col - 1) {
             return if (grid[r][c] % k == remainder) 1 else 0
+        }
 
         return ((remainder - grid[r][c] + 100 * k) % k).let {
             (numberOfPaths(grid, r + 1, c, k, it) + numberOfPaths(grid, r, c + 1, k, it)) % mod
diff --git a/src/main/kotlin/g2401_2500/s2440_create_components_with_same_value/Solution.kt b/src/main/kotlin/g2401_2500/s2440_create_components_with_same_value/Solution.kt
index 45f9beb5d..f3299655c 100644
--- a/src/main/kotlin/g2401_2500/s2440_create_components_with_same_value/Solution.kt
+++ b/src/main/kotlin/g2401_2500/s2440_create_components_with_same_value/Solution.kt
@@ -37,7 +37,9 @@ class Solution {
             }
             return if (nums[i] == target) {
                 0
-            } else nums[i]
+            } else {
+                nums[i]
+            }
         }
         var sum = nums[i]
         for (k in graph[i]) {
@@ -55,6 +57,8 @@ class Solution {
         }
         return if (sum == target) {
             0
-        } else sum
+        } else {
+            sum
+        }
     }
 }
diff --git a/src/main/kotlin/g2401_2500/s2447_number_of_subarrays_with_gcd_equal_to_k/Solution.kt b/src/main/kotlin/g2401_2500/s2447_number_of_subarrays_with_gcd_equal_to_k/Solution.kt
index 4766ca9c4..b0f5c4678 100644
--- a/src/main/kotlin/g2401_2500/s2447_number_of_subarrays_with_gcd_equal_to_k/Solution.kt
+++ b/src/main/kotlin/g2401_2500/s2447_number_of_subarrays_with_gcd_equal_to_k/Solution.kt
@@ -6,7 +6,9 @@ class Solution {
     private fun sol(a: Int, b: Int): Int {
         return if (b == 0) {
             a
-        } else sol(b, a % b)
+        } else {
+            sol(b, a % b)
+        }
     }
 
     fun subarrayGCD(nums: IntArray, k: Int): Int {
diff --git a/src/main/kotlin/g2401_2500/s2452_words_within_two_edits_of_dictionary/Solution.kt b/src/main/kotlin/g2401_2500/s2452_words_within_two_edits_of_dictionary/Solution.kt
index 48133164f..04ff57650 100644
--- a/src/main/kotlin/g2401_2500/s2452_words_within_two_edits_of_dictionary/Solution.kt
+++ b/src/main/kotlin/g2401_2500/s2452_words_within_two_edits_of_dictionary/Solution.kt
@@ -36,7 +36,7 @@ class Solution {
                 word,
                 curr.childs[ch],
                 i + 1,
-                if (ch == word[i]) edits else edits + 1
+                if (ch == word[i]) edits else edits + 1,
             )
         }
         return ans
diff --git a/src/main/kotlin/g2401_2500/s2455_average_value_of_even_numbers_that_are_divisible_by_three/Solution.kt b/src/main/kotlin/g2401_2500/s2455_average_value_of_even_numbers_that_are_divisible_by_three/Solution.kt
index d9757b444..5c13e386f 100644
--- a/src/main/kotlin/g2401_2500/s2455_average_value_of_even_numbers_that_are_divisible_by_three/Solution.kt
+++ b/src/main/kotlin/g2401_2500/s2455_average_value_of_even_numbers_that_are_divisible_by_three/Solution.kt
@@ -14,6 +14,8 @@ class Solution {
         }
         return if (count == 0) {
             0
-        } else sum / count
+        } else {
+            sum / count
+        }
     }
 }
diff --git a/src/main/kotlin/g2401_2500/s2456_most_popular_video_creator/Solution.kt b/src/main/kotlin/g2401_2500/s2456_most_popular_video_creator/Solution.kt
index 02a8e1961..8173cc4cb 100644
--- a/src/main/kotlin/g2401_2500/s2456_most_popular_video_creator/Solution.kt
+++ b/src/main/kotlin/g2401_2500/s2456_most_popular_video_creator/Solution.kt
@@ -15,8 +15,8 @@ class Solution {
             val lastIndex = maxView.getOrDefault(creators[i], -1)
             if (!maxView.containsKey(creators[i]) || views[lastIndex] < views[i] ||
                 views[lastIndex] == views[i] && ids[lastIndex].compareTo(
-                        ids[i]
-                    ) > 0
+                    ids[i],
+                ) > 0
             ) {
                 maxView[creators[i]] = i
             }
diff --git a/src/main/kotlin/g2401_2500/s2458_height_of_binary_tree_after_subtree_removal_queries/Solution.kt b/src/main/kotlin/g2401_2500/s2458_height_of_binary_tree_after_subtree_removal_queries/Solution.kt
index 269576f85..1b9586721 100644
--- a/src/main/kotlin/g2401_2500/s2458_height_of_binary_tree_after_subtree_removal_queries/Solution.kt
+++ b/src/main/kotlin/g2401_2500/s2458_height_of_binary_tree_after_subtree_removal_queries/Solution.kt
@@ -34,7 +34,7 @@ class Solution {
         root: TreeNode?,
         level: Int,
         map: MutableMap<Int, IntArray>,
-        levels: MutableMap<Int, IntArray>
+        levels: MutableMap<Int, IntArray>,
     ): Int {
         if (root == null) {
             return 0
diff --git a/src/main/kotlin/g2401_2500/s2463_minimum_total_distance_traveled/Solution.kt b/src/main/kotlin/g2401_2500/s2463_minimum_total_distance_traveled/Solution.kt
index c93031e70..34506eb71 100644
--- a/src/main/kotlin/g2401_2500/s2463_minimum_total_distance_traveled/Solution.kt
+++ b/src/main/kotlin/g2401_2500/s2463_minimum_total_distance_traveled/Solution.kt
@@ -36,7 +36,6 @@ class Solution {
         // try assigning robot to each factory starting from the leftmost
         var j = 0
         while (j < d.size) {
-
             // cost of adding robot to the current factory
             var t = Math.abs(r[i] - f[j][0]).toLong()
             var tj = j
diff --git a/src/main/kotlin/g2401_2500/s2467_most_profitable_path_in_a_tree/Solution.kt b/src/main/kotlin/g2401_2500/s2467_most_profitable_path_in_a_tree/Solution.kt
index 3f8b98fbe..89a06cad6 100644
--- a/src/main/kotlin/g2401_2500/s2467_most_profitable_path_in_a_tree/Solution.kt
+++ b/src/main/kotlin/g2401_2500/s2467_most_profitable_path_in_a_tree/Solution.kt
@@ -22,7 +22,7 @@ class Solution {
         bob: Int,
         amount: IntArray,
         seen: BooleanArray,
-        height: Int
+        height: Int,
     ): IntArray {
         var res = Int.MIN_VALUE
         seen[node] = true
diff --git a/src/main/kotlin/g2401_2500/s2497_maximum_star_sum_of_a_graph/Solution.kt b/src/main/kotlin/g2401_2500/s2497_maximum_star_sum_of_a_graph/Solution.kt
index effd88716..30a53fc42 100644
--- a/src/main/kotlin/g2401_2500/s2497_maximum_star_sum_of_a_graph/Solution.kt
+++ b/src/main/kotlin/g2401_2500/s2497_maximum_star_sum_of_a_graph/Solution.kt
@@ -25,7 +25,7 @@ class Solution {
         nodeValues: IntArray,
         fromNode: Int,
         toNode: Int,
-        maxNumberOfEdges: Int
+        maxNumberOfEdges: Int,
     ) {
         if (nodeValues[toNode] > 0 && graphNodeIdToNodeValues[fromNode]!!.size < maxNumberOfEdges) {
             graphNodeIdToNodeValues[fromNode]!!.add(nodeValues[toNode])
diff --git a/src/main/kotlin/g2401_2500/s2499_minimum_total_cost_to_make_arrays_unequal/Solution.kt b/src/main/kotlin/g2401_2500/s2499_minimum_total_cost_to_make_arrays_unequal/Solution.kt
index fb714b66d..79194541c 100644
--- a/src/main/kotlin/g2401_2500/s2499_minimum_total_cost_to_make_arrays_unequal/Solution.kt
+++ b/src/main/kotlin/g2401_2500/s2499_minimum_total_cost_to_make_arrays_unequal/Solution.kt
@@ -38,6 +38,8 @@ class Solution {
         }
         return if (lackBucket > 0) {
             -1
-        } else cost
+        } else {
+            cost
+        }
     }
 }
diff --git a/src/main/kotlin/g2501_2600/s2508_add_edges_to_make_degrees_of_all_nodes_even/Solution.kt b/src/main/kotlin/g2501_2600/s2508_add_edges_to_make_degrees_of_all_nodes_even/Solution.kt
index 6f58fd6b0..9e1c71a34 100644
--- a/src/main/kotlin/g2501_2600/s2508_add_edges_to_make_degrees_of_all_nodes_even/Solution.kt
+++ b/src/main/kotlin/g2501_2600/s2508_add_edges_to_make_degrees_of_all_nodes_even/Solution.kt
@@ -49,7 +49,9 @@ class Solution {
         }
         return if (isNotConnected(a, c, g) && isNotConnected(b, d, g)) {
             true
-        } else isNotConnected(a, d, g) && isNotConnected(b, c, g)
+        } else {
+            isNotConnected(a, d, g) && isNotConnected(b, c, g)
+        }
     }
 
     private fun isNotConnected(x: Int, y: Int, g: Array<ArrayList<Int>?>): Boolean {
diff --git a/src/main/kotlin/g2501_2600/s2512_reward_top_k_students/Solution.kt b/src/main/kotlin/g2501_2600/s2512_reward_top_k_students/Solution.kt
index a483f8b4c..b8f406c02 100644
--- a/src/main/kotlin/g2501_2600/s2512_reward_top_k_students/Solution.kt
+++ b/src/main/kotlin/g2501_2600/s2512_reward_top_k_students/Solution.kt
@@ -12,7 +12,7 @@ class Solution {
         negativeFeedback: Array<String>,
         report: Array<String>,
         studentId: IntArray,
-        k: Int
+        k: Int,
     ): List<Int> {
         var k = k
         val feedback = HashMap<String, Int>()
diff --git a/src/main/kotlin/g2501_2600/s2513_minimize_the_maximum_of_two_arrays/Solution.kt b/src/main/kotlin/g2501_2600/s2513_minimize_the_maximum_of_two_arrays/Solution.kt
index d62b4cbd2..b2646b34e 100644
--- a/src/main/kotlin/g2501_2600/s2513_minimize_the_maximum_of_two_arrays/Solution.kt
+++ b/src/main/kotlin/g2501_2600/s2513_minimize_the_maximum_of_two_arrays/Solution.kt
@@ -8,7 +8,9 @@ class Solution {
     private fun gcd(a: Int, b: Int): Int {
         return if (b == 0) {
             a
-        } else gcd(b, a % b)
+        } else {
+            gcd(b, a % b)
+        }
     }
 
     fun minimizeSet(divisor1: Int, divisor2: Int, uniqueCnt1: Int, uniqueCnt2: Int): Int {
diff --git a/src/main/kotlin/g2501_2600/s2515_shortest_distance_to_target_string_in_a_circular_array/Solution.kt b/src/main/kotlin/g2501_2600/s2515_shortest_distance_to_target_string_in_a_circular_array/Solution.kt
index 326154c97..00d966214 100644
--- a/src/main/kotlin/g2501_2600/s2515_shortest_distance_to_target_string_in_a_circular_array/Solution.kt
+++ b/src/main/kotlin/g2501_2600/s2515_shortest_distance_to_target_string_in_a_circular_array/Solution.kt
@@ -22,6 +22,8 @@ class Solution {
         }
         return if (ld == -1) {
             -1
-        } else ans
+        } else {
+            ans
+        }
     }
 }
diff --git a/src/main/kotlin/g2501_2600/s2541_minimum_operations_to_make_array_equal_ii/Solution.kt b/src/main/kotlin/g2501_2600/s2541_minimum_operations_to_make_array_equal_ii/Solution.kt
index 247b83fc5..bc89110e0 100644
--- a/src/main/kotlin/g2501_2600/s2541_minimum_operations_to_make_array_equal_ii/Solution.kt
+++ b/src/main/kotlin/g2501_2600/s2541_minimum_operations_to_make_array_equal_ii/Solution.kt
@@ -27,6 +27,8 @@ class Solution {
         }
         return if (pcnt + ncnt != 0L) {
             -1
-        } else pcnt / k
+        } else {
+            pcnt / k
+        }
     }
 }
diff --git a/src/main/kotlin/g2501_2600/s2551_put_marbles_in_bags/Solution.kt b/src/main/kotlin/g2501_2600/s2551_put_marbles_in_bags/Solution.kt
index ff08918d9..173ed8300 100644
--- a/src/main/kotlin/g2501_2600/s2551_put_marbles_in_bags/Solution.kt
+++ b/src/main/kotlin/g2501_2600/s2551_put_marbles_in_bags/Solution.kt
@@ -14,7 +14,8 @@ class Solution {
         val min = PriorityQueue<Long>()
         val max = PriorityQueue { a: Long?, b: Long? ->
             java.lang.Long.compare(
-                b!!, a!!
+                b!!,
+                a!!,
             )
         }
         for (i in 0 until weights.size - 1) {
diff --git a/src/main/kotlin/g2501_2600/s2562_find_the_array_concatenation_value/Solution.kt b/src/main/kotlin/g2501_2600/s2562_find_the_array_concatenation_value/Solution.kt
index 3286d5d18..2b976976b 100644
--- a/src/main/kotlin/g2501_2600/s2562_find_the_array_concatenation_value/Solution.kt
+++ b/src/main/kotlin/g2501_2600/s2562_find_the_array_concatenation_value/Solution.kt
@@ -10,7 +10,9 @@ class Solution {
             result += if (i < n - 1 - i) {
                 val concat = "" + nums[i] + nums[n - 1 - i]
                 concat.toLong()
-            } else nums[i].toLong()
+            } else {
+                nums[i].toLong()
+            }
         }
         return result
     }
diff --git a/src/main/kotlin/g2501_2600/s2564_substring_xor_queries/Solution.kt b/src/main/kotlin/g2501_2600/s2564_substring_xor_queries/Solution.kt
index bbb43d653..6a6b7b458 100644
--- a/src/main/kotlin/g2501_2600/s2564_substring_xor_queries/Solution.kt
+++ b/src/main/kotlin/g2501_2600/s2564_substring_xor_queries/Solution.kt
@@ -8,7 +8,7 @@ class Solution {
         val n = s.length
         val indices = queries.withIndex().groupBy(
             keySelector = { it.value[0] xor it.value[1] },
-            valueTransform = { it.index }
+            valueTransform = { it.index },
         ).toMutableMap()
         val res = Array(queries.size) { IntArray(2) { -1 } }
         fun helper(value: Int, left: Int, right: Int) {
diff --git a/src/main/kotlin/g2501_2600/s2566_maximum_difference_by_remapping_a_digit/Solution.kt b/src/main/kotlin/g2501_2600/s2566_maximum_difference_by_remapping_a_digit/Solution.kt
index 54b342221..998e68c0b 100644
--- a/src/main/kotlin/g2501_2600/s2566_maximum_difference_by_remapping_a_digit/Solution.kt
+++ b/src/main/kotlin/g2501_2600/s2566_maximum_difference_by_remapping_a_digit/Solution.kt
@@ -10,8 +10,11 @@ class Solution {
             val firstCharNot = org.firstOrNull {
                 it != want
             }
-            if (firstCharNot == null) num
-            else org.replace(firstCharNot, want).toInt()
+            if (firstCharNot == null) {
+                num
+            } else {
+                org.replace(firstCharNot, want).toInt()
+            }
         }
 
         return helper('9') - helper('0')
diff --git a/src/main/kotlin/g2501_2600/s2572_count_the_number_of_square_free_subsets/Solution.kt b/src/main/kotlin/g2501_2600/s2572_count_the_number_of_square_free_subsets/Solution.kt
index 40f87805a..7feb65a73 100644
--- a/src/main/kotlin/g2501_2600/s2572_count_the_number_of_square_free_subsets/Solution.kt
+++ b/src/main/kotlin/g2501_2600/s2572_count_the_number_of_square_free_subsets/Solution.kt
@@ -23,8 +23,9 @@ class Solution {
             val prev = HashMap(dp)
             dp[v] = (dp[v] ?: 0) + howmany
             for ((product, quantity) in prev)
-                if (gcd(product, v) == 1)
+                if (gcd(product, v) == 1) {
                     dp[product * v] = ((dp[product * v] ?: 0L) + quantity * howmany.toLong()) % mod
+                }
         }
         for (v in primes) {
             if (v !in freqMap) continue
diff --git a/src/main/kotlin/g2501_2600/s2592_maximize_greatness_of_an_array/Solution.kt b/src/main/kotlin/g2501_2600/s2592_maximize_greatness_of_an_array/Solution.kt
index 3f73cdbf6..19ddf09d7 100644
--- a/src/main/kotlin/g2501_2600/s2592_maximize_greatness_of_an_array/Solution.kt
+++ b/src/main/kotlin/g2501_2600/s2592_maximize_greatness_of_an_array/Solution.kt
@@ -15,8 +15,11 @@ class Solution {
             val entry = map.higherEntry(num)
             if (entry != null && entry.key != num) {
                 count++
-                if (entry.value - 1 == 0) map.remove(entry.key)
-                else map[entry.key] = entry.value - 1
+                if (entry.value - 1 == 0) {
+                    map.remove(entry.key)
+                } else {
+                    map[entry.key] = entry.value - 1
+                }
             }
         }
 
diff --git a/src/main/kotlin/g2501_2600/s2593_find_score_of_an_array_after_marking_all_elements/Solution.kt b/src/main/kotlin/g2501_2600/s2593_find_score_of_an_array_after_marking_all_elements/Solution.kt
index c624b5a6e..8af526715 100644
--- a/src/main/kotlin/g2501_2600/s2593_find_score_of_an_array_after_marking_all_elements/Solution.kt
+++ b/src/main/kotlin/g2501_2600/s2593_find_score_of_an_array_after_marking_all_elements/Solution.kt
@@ -10,7 +10,11 @@ class Solution {
         var ans: Long = 0
         val pq = PriorityQueue { a: IntArray, b: IntArray ->
             if (a[0] == b[0]
-            ) a[1] - b[1] else a[0] - b[0]
+            ) {
+                a[1] - b[1]
+            } else {
+                a[0] - b[0]
+            }
         }
         val vis = BooleanArray(nums.size)
         for (i in nums.indices) {
diff --git a/src/main/kotlin/g2601_2700/s2616_minimize_the_maximum_difference_of_pairs/Solution.kt b/src/main/kotlin/g2601_2700/s2616_minimize_the_maximum_difference_of_pairs/Solution.kt
index 7c13f3cf7..ea917d0d6 100644
--- a/src/main/kotlin/g2601_2700/s2616_minimize_the_maximum_difference_of_pairs/Solution.kt
+++ b/src/main/kotlin/g2601_2700/s2616_minimize_the_maximum_difference_of_pairs/Solution.kt
@@ -29,7 +29,9 @@ class Solution {
             if (ispossible(nums, p, mid)) {
                 ans = mid
                 right = mid - 1
-            } else left = mid + 1
+            } else {
+                left = mid + 1
+            }
         }
         return ans
     }
diff --git a/src/main/kotlin/g2601_2700/s2644_find_the_maximum_divisibility_score/Solution.kt b/src/main/kotlin/g2601_2700/s2644_find_the_maximum_divisibility_score/Solution.kt
index c60556f96..e8f95caf1 100644
--- a/src/main/kotlin/g2601_2700/s2644_find_the_maximum_divisibility_score/Solution.kt
+++ b/src/main/kotlin/g2601_2700/s2644_find_the_maximum_divisibility_score/Solution.kt
@@ -9,15 +9,17 @@ class Solution {
         for (divisor in divisors) {
             var dividedNums = 0
             for (num in nums) {
-                if (num % divisor == 0)
+                if (num % divisor == 0) {
                     dividedNums++
+                }
             }
             if (dividedNums > maxDividedNums) {
                 maxDividedNums = dividedNums
                 maxDivisor = divisor
             }
-            if (dividedNums == maxDividedNums && divisor < maxDivisor)
+            if (dividedNums == maxDividedNums && divisor < maxDivisor) {
                 maxDivisor = divisor
+            }
         }
         return maxDivisor
     }
diff --git a/src/main/kotlin/g2601_2700/s2646_minimize_the_total_price_of_the_trips/Solution.kt b/src/main/kotlin/g2601_2700/s2646_minimize_the_total_price_of_the_trips/Solution.kt
index e5d411fa1..7a04815f8 100644
--- a/src/main/kotlin/g2601_2700/s2646_minimize_the_total_price_of_the_trips/Solution.kt
+++ b/src/main/kotlin/g2601_2700/s2646_minimize_the_total_price_of_the_trips/Solution.kt
@@ -29,7 +29,7 @@ class Solution {
         tgt: Int,
         counts: IntArray,
         adj: MutableList<MutableList<Int?>?>,
-        vis: BooleanArray
+        vis: BooleanArray,
     ): Boolean {
         if (vis[start]) return false
         vis[start] = true
@@ -53,7 +53,7 @@ class Solution {
         adj: MutableList<MutableList<Int?>?>,
         paths: BooleanArray,
         prices: IntArray,
-        counts: IntArray
+        counts: IntArray,
     ): Int {
         if (paths[node]) return 0
         if (dp[node] != -1) return dp[node]
diff --git a/src/main/kotlin/g2601_2700/s2658_maximum_number_of_fish_in_a_grid/Solution.kt b/src/main/kotlin/g2601_2700/s2658_maximum_number_of_fish_in_a_grid/Solution.kt
index d11a54386..65270a587 100644
--- a/src/main/kotlin/g2601_2700/s2658_maximum_number_of_fish_in_a_grid/Solution.kt
+++ b/src/main/kotlin/g2601_2700/s2658_maximum_number_of_fish_in_a_grid/Solution.kt
@@ -10,7 +10,7 @@ class Solution {
             intArrayOf(0, 1),
             intArrayOf(0, -1),
             intArrayOf(1, 0),
-            intArrayOf(-1, 0)
+            intArrayOf(-1, 0),
         )
 
         fun isValid(x: Int, y: Int) = x in (0..grid.lastIndex) && y in (0..grid[0].lastIndex) &&
@@ -31,8 +31,9 @@ class Solution {
         var res = 0
         for (i in grid.indices) {
             for (j in grid[0].indices) {
-                if (grid[i][j] != 0)
+                if (grid[i][j] != 0) {
                     res = maxOf(res, dfs(i, j))
+                }
             }
         }
 
diff --git a/src/main/kotlin/g2601_2700/s2659_make_array_empty/Solution.kt b/src/main/kotlin/g2601_2700/s2659_make_array_empty/Solution.kt
index 912206e0b..332550f17 100644
--- a/src/main/kotlin/g2601_2700/s2659_make_array_empty/Solution.kt
+++ b/src/main/kotlin/g2601_2700/s2659_make_array_empty/Solution.kt
@@ -13,8 +13,9 @@ class Solution {
         sortNums.sortBy { it[0] }
         var res = 0L + nums.size
         for (i in 1..sortNums.lastIndex) {
-            if (sortNums[i - 1][1] > sortNums[i][1])
+            if (sortNums[i - 1][1] > sortNums[i][1]) {
                 res += nums.size - i
+            }
         }
         return res
     }
diff --git a/src/main/kotlin/g2601_2700/s2680_maximum_or/Solution.kt b/src/main/kotlin/g2601_2700/s2680_maximum_or/Solution.kt
index 3a91f37b9..95b70e4df 100644
--- a/src/main/kotlin/g2601_2700/s2680_maximum_or/Solution.kt
+++ b/src/main/kotlin/g2601_2700/s2680_maximum_or/Solution.kt
@@ -15,7 +15,7 @@ class Solution {
             val num = nums[i].toLong()
             max = maxOf(
                 max,
-                prefix or (num shl k) or suffix[i].toLong()
+                prefix or (num shl k) or suffix[i].toLong(),
             )
             prefix = prefix or num
         }
diff --git a/src/main/kotlin/g2601_2700/s2685_count_the_number_of_complete_components/Solution.kt b/src/main/kotlin/g2601_2700/s2685_count_the_number_of_complete_components/Solution.kt
index 93a30fa0b..e8a5e26a4 100644
--- a/src/main/kotlin/g2601_2700/s2685_count_the_number_of_complete_components/Solution.kt
+++ b/src/main/kotlin/g2601_2700/s2685_count_the_number_of_complete_components/Solution.kt
@@ -29,8 +29,9 @@ class Solution {
         for (i in 0 until n) {
             if (!visited[i]) {
                 val (nodes, edges) = bfs(i)
-                if ((nodes * (nodes - 1)) == edges)
+                if ((nodes * (nodes - 1)) == edges) {
                     res++
+                }
             }
         }
         return res
diff --git a/src/main/kotlin/g2601_2700/s2697_lexicographically_smallest_palindrome/Solution.kt b/src/main/kotlin/g2601_2700/s2697_lexicographically_smallest_palindrome/Solution.kt
index 45dfbf9b2..35cb1c65f 100644
--- a/src/main/kotlin/g2601_2700/s2697_lexicographically_smallest_palindrome/Solution.kt
+++ b/src/main/kotlin/g2601_2700/s2697_lexicographically_smallest_palindrome/Solution.kt
@@ -8,10 +8,11 @@ class Solution {
         var r = s.lastIndex
         val res = s.toCharArray()
         while (l <= r) {
-            if (s[l] < s[r])
+            if (s[l] < s[r]) {
                 res[r] = s[l]
-            else
+            } else {
                 res[l] = s[r]
+            }
             l++
             r--
         }
diff --git a/src/main/kotlin/g2601_2700/s2698_find_the_punishment_number_of_an_integer/Solution.kt b/src/main/kotlin/g2601_2700/s2698_find_the_punishment_number_of_an_integer/Solution.kt
index 0f663d477..df7eabd7b 100644
--- a/src/main/kotlin/g2601_2700/s2698_find_the_punishment_number_of_an_integer/Solution.kt
+++ b/src/main/kotlin/g2601_2700/s2698_find_the_punishment_number_of_an_integer/Solution.kt
@@ -14,8 +14,9 @@ class Solution {
         var res = 0
         for (i in 1..n) {
             val iSq = i * i
-            if (partition(iSq, i))
+            if (partition(iSq, i)) {
                 res += iSq
+            }
         }
         return res
     }
diff --git a/src/main/kotlin/g2601_2700/s2699_modify_graph_edge_weights/Solution.kt b/src/main/kotlin/g2601_2700/s2699_modify_graph_edge_weights/Solution.kt
index c06952b3b..ab85ecf8e 100644
--- a/src/main/kotlin/g2601_2700/s2699_modify_graph_edge_weights/Solution.kt
+++ b/src/main/kotlin/g2601_2700/s2699_modify_graph_edge_weights/Solution.kt
@@ -15,7 +15,7 @@ class Solution {
         edges: Array<IntArray>,
         source: Int,
         destination: Int,
-        target: Int
+        target: Int,
     ): Array<IntArray> {
         this.n = n
         g = arrayOfNulls(n)
diff --git a/src/main/kotlin/g2701_2800/s2719_count_of_integers/Solution.kt b/src/main/kotlin/g2701_2800/s2719_count_of_integers/Solution.kt
index 8d8e39a3a..5768a7cfa 100644
--- a/src/main/kotlin/g2701_2800/s2719_count_of_integers/Solution.kt
+++ b/src/main/kotlin/g2701_2800/s2719_count_of_integers/Solution.kt
@@ -7,8 +7,9 @@ class Solution {
     private fun countStrings(i: Int, tight1: Boolean, tight2: Boolean, sum: Int, num1: String, num2: String): Int {
         if (sum < 0) return 0
         if (i == num2.length) return 1
-        if (dp[i][if (tight1) 1 else 0][if (tight2) 1 else 0][sum] != -1)
+        if (dp[i][if (tight1) 1 else 0][if (tight2) 1 else 0][sum] != -1) {
             return dp[i][if (tight1) 1 else 0][if (tight2) 1 else 0][sum]
+        }
         val lo = if (tight1) num1[i].code - '0'.code else 0
         val hi = if (tight2) num2[i].code - '0'.code else 9
         var count = 0
@@ -17,7 +18,7 @@ class Solution {
                 count % MOD + countStrings(
                     i + 1,
                     tight1 and (idx == lo), tight2 and (idx == hi),
-                    sum - idx, num1, num2
+                    sum - idx, num1, num2,
                 ) % MOD
                 ) % MOD
         }
diff --git a/src/main/kotlin/g2701_2800/s2729_check_if_the_number_is_fascinating/Solution.kt b/src/main/kotlin/g2701_2800/s2729_check_if_the_number_is_fascinating/Solution.kt
index 0970c7104..716928550 100644
--- a/src/main/kotlin/g2701_2800/s2729_check_if_the_number_is_fascinating/Solution.kt
+++ b/src/main/kotlin/g2701_2800/s2729_check_if_the_number_is_fascinating/Solution.kt
@@ -10,16 +10,18 @@ class Solution {
             var cur = _cur
             while (cur > 0) {
                 val n = cur % 10
-                if (n == 0 || set.contains(n))
+                if (n == 0 || set.contains(n)) {
                     return false
+                }
                 set.add(n)
                 cur /= 10
             }
             return true
         }
 
-        if (!add(n) || !add(2 * n) || !add(3 * n))
+        if (!add(n) || !add(2 * n) || !add(3 * n)) {
             return false
+        }
         return true
     }
 }
diff --git a/src/main/kotlin/g2701_2800/s2736_maximum_sum_queries/Solution.kt b/src/main/kotlin/g2701_2800/s2736_maximum_sum_queries/Solution.kt
index 42d9d4ee1..7e2da4f87 100644
--- a/src/main/kotlin/g2701_2800/s2736_maximum_sum_queries/Solution.kt
+++ b/src/main/kotlin/g2701_2800/s2736_maximum_sum_queries/Solution.kt
@@ -32,7 +32,7 @@ class Solution {
         v.sortWith(
             Comparator { a: IntArray, b: IntArray ->
                 a[0] - b[0]
-            }
+            },
         )
         val ind: MutableList<Int> = ArrayList()
         for (i in 0 until m) ind.add(i)
diff --git a/src/main/kotlin/g2701_2800/s2746_decremental_string_concatenation/Solution.kt b/src/main/kotlin/g2701_2800/s2746_decremental_string_concatenation/Solution.kt
index f97585bef..39f065982 100644
--- a/src/main/kotlin/g2701_2800/s2746_decremental_string_concatenation/Solution.kt
+++ b/src/main/kotlin/g2701_2800/s2746_decremental_string_concatenation/Solution.kt
@@ -12,7 +12,7 @@ class Solution {
         dp = Array(n) {
             Array(26) {
                 arrayOfNulls(
-                    26
+                    26,
                 )
             }
         }
diff --git a/src/main/kotlin/g2701_2800/s2747_count_zero_request_servers/Solution.kt b/src/main/kotlin/g2701_2800/s2747_count_zero_request_servers/Solution.kt
index 5eae529d6..055f99f85 100644
--- a/src/main/kotlin/g2701_2800/s2747_count_zero_request_servers/Solution.kt
+++ b/src/main/kotlin/g2701_2800/s2747_count_zero_request_servers/Solution.kt
@@ -25,7 +25,7 @@ class Solution {
             while (r < logs.size && logs[r][1] <= rVal) servCount.merge(logs[r++][0], 1) { a: Int, b: Int ->
                 Integer.sum(
                     a,
-                    b
+                    b,
                 )
             }
             while (l < r && logs[l][1] < lVal) {
diff --git a/src/main/kotlin/g2701_2800/s2767_partition_string_into_minimum_beautiful_substrings/Solution.kt b/src/main/kotlin/g2701_2800/s2767_partition_string_into_minimum_beautiful_substrings/Solution.kt
index b25d5a67a..33e9363c1 100644
--- a/src/main/kotlin/g2701_2800/s2767_partition_string_into_minimum_beautiful_substrings/Solution.kt
+++ b/src/main/kotlin/g2701_2800/s2767_partition_string_into_minimum_beautiful_substrings/Solution.kt
@@ -16,7 +16,9 @@ class Solution {
         val result = minimumBeautifulSubstringsHelper(s, 0, set, 0)
         return if (result == Int.MAX_VALUE) {
             -1
-        } else result
+        } else {
+            result
+        }
     }
 
     private fun minimumBeautifulSubstringsHelper(s: String, index: Int, set: Set<String>, count: Int): Int {
diff --git a/src/main/kotlin/g2701_2800/s2768_number_of_black_blocks/Solution.kt b/src/main/kotlin/g2701_2800/s2768_number_of_black_blocks/Solution.kt
index 30d4cb5ad..b61c49dd9 100644
--- a/src/main/kotlin/g2701_2800/s2768_number_of_black_blocks/Solution.kt
+++ b/src/main/kotlin/g2701_2800/s2768_number_of_black_blocks/Solution.kt
@@ -13,7 +13,8 @@ class Solution {
                 for (j in y until y + 2) {
                     if (i - 1 >= 0 && i < m && j - 1 >= 0 && j < n) {
                         count.merge(
-                            i * n + j, 1
+                            i * n + j,
+                            1,
                         ) { a: Int?, b: Int? -> Integer.sum(a!!, b!!) }
                     }
                 }
diff --git a/src/main/kotlin/g2701_2800/s2785_sort_vowels_in_a_string/Solution.kt b/src/main/kotlin/g2701_2800/s2785_sort_vowels_in_a_string/Solution.kt
index a85c93610..16f8d1c73 100644
--- a/src/main/kotlin/g2701_2800/s2785_sort_vowels_in_a_string/Solution.kt
+++ b/src/main/kotlin/g2701_2800/s2785_sort_vowels_in_a_string/Solution.kt
@@ -18,12 +18,16 @@ class Solution {
         var j = 1
         var i = 0
         while (j < vowelCount.size) {
-            if (vowelCount[j] > 0) while (i < result.size) {
-                if (countIndexMap[result[i++].code] == 0) continue
-                vowelCount[j]--
-                result[i - 1] = charMap[j - 1]
-                break
-            } else j++
+            if (vowelCount[j] > 0) {
+                while (i < result.size) {
+                    if (countIndexMap[result[i++].code] == 0) continue
+                    vowelCount[j]--
+                    result[i - 1] = charMap[j - 1]
+                    break
+                }
+            } else {
+                j++
+            }
         }
         return String(result)
     }
diff --git a/src/main/kotlin/g2701_2800/s2799_count_complete_subarrays_in_an_array/Solution.kt b/src/main/kotlin/g2701_2800/s2799_count_complete_subarrays_in_an_array/Solution.kt
index ee7323904..222ddc796 100644
--- a/src/main/kotlin/g2701_2800/s2799_count_complete_subarrays_in_an_array/Solution.kt
+++ b/src/main/kotlin/g2701_2800/s2799_count_complete_subarrays_in_an_array/Solution.kt
@@ -32,7 +32,9 @@ class Solution {
                 }
                 last = if (map[nums[i]] > 0) {
                     possLast
-                } else break
+                } else {
+                    break
+                }
             }
         }
         return ans
diff --git a/src/main/kotlin/g2701_2800/s2800_shortest_string_that_contains_three_strings/Solution.kt b/src/main/kotlin/g2701_2800/s2800_shortest_string_that_contains_three_strings/Solution.kt
index 132a79bf0..9e91d9ef4 100644
--- a/src/main/kotlin/g2701_2800/s2800_shortest_string_that_contains_three_strings/Solution.kt
+++ b/src/main/kotlin/g2701_2800/s2800_shortest_string_that_contains_three_strings/Solution.kt
@@ -16,11 +16,11 @@ class Solution {
                         combine(br, ar, cr),
                         getSmaller(
                             combine(br, cr, ar),
-                            getSmaller(combine(cr, ar, br), combine(cr, br, ar))
-                        )
-                    )
-                )
-            )
+                            getSmaller(combine(cr, ar, br), combine(cr, br, ar)),
+                        ),
+                    ),
+                ),
+            ),
         )
     }
 
@@ -55,7 +55,11 @@ class Solution {
     }
 
     private fun getSmaller(res: CharArray, test: CharArray): CharArray {
-        if (res.size > test.size) return test else if (res.size < test.size) return res else {
+        if (res.size > test.size) {
+            return test
+        } else if (res.size < test.size) {
+            return res
+        } else {
             for (i in res.indices) {
                 if (res[i] > test[i]) return test else if (res[i] < test[i]) return res
             }
diff --git a/src/main/kotlin/g2801_2900/s2807_insert_greatest_common_divisors_in_linked_list/Solution.kt b/src/main/kotlin/g2801_2900/s2807_insert_greatest_common_divisors_in_linked_list/Solution.kt
index 39913114a..93de2c5b8 100644
--- a/src/main/kotlin/g2801_2900/s2807_insert_greatest_common_divisors_in_linked_list/Solution.kt
+++ b/src/main/kotlin/g2801_2900/s2807_insert_greatest_common_divisors_in_linked_list/Solution.kt
@@ -31,6 +31,8 @@ class Solution {
     private fun greatestCommonDivisor(val1: Int, val2: Int): Int {
         return if (val2 == 0) {
             val1
-        } else greatestCommonDivisor(val2, val1 % val2)
+        } else {
+            greatestCommonDivisor(val2, val1 % val2)
+        }
     }
 }
diff --git a/src/main/kotlin/g2801_2900/s2812_find_the_safest_path_in_a_grid/Solution.kt b/src/main/kotlin/g2801_2900/s2812_find_the_safest_path_in_a_grid/Solution.kt
index 429fd21aa..c5684aa1c 100644
--- a/src/main/kotlin/g2801_2900/s2812_find_the_safest_path_in_a_grid/Solution.kt
+++ b/src/main/kotlin/g2801_2900/s2812_find_the_safest_path_in_a_grid/Solution.kt
@@ -35,7 +35,7 @@ class Solution {
         cost: Array<IntArray>,
         mid: Int,
         n: Int,
-        visited: Array<BooleanArray>
+        visited: Array<BooleanArray>,
     ): Boolean {
         if (i < 0 || j < 0 || i >= n || j >= n) return false
         if (cost[i][j] == Int.MAX_VALUE || cost[i][j] < mid) return false
diff --git a/src/main/kotlin/g2801_2900/s2818_apply_operations_to_maximize_score/Solution.kt b/src/main/kotlin/g2801_2900/s2818_apply_operations_to_maximize_score/Solution.kt
index 09cd7a92f..be44362c1 100644
--- a/src/main/kotlin/g2801_2900/s2818_apply_operations_to_maximize_score/Solution.kt
+++ b/src/main/kotlin/g2801_2900/s2818_apply_operations_to_maximize_score/Solution.kt
@@ -17,7 +17,8 @@ class Solution {
         // [val, index]
         val pq = PriorityQueue { o1: IntArray, o2: IntArray ->
             Integer.compare(
-                o2[0], o1[0]
+                o2[0],
+                o1[0],
             )
         }
         val monoStack: Deque<IntArray> = ArrayDeque()
diff --git a/src/main/kotlin/g2801_2900/s2827_number_of_beautiful_integers_in_the_range/Solution.kt b/src/main/kotlin/g2801_2900/s2827_number_of_beautiful_integers_in_the_range/Solution.kt
index 095b946ff..d7d9fe68b 100644
--- a/src/main/kotlin/g2801_2900/s2827_number_of_beautiful_integers_in_the_range/Solution.kt
+++ b/src/main/kotlin/g2801_2900/s2827_number_of_beautiful_integers_in_the_range/Solution.kt
@@ -35,7 +35,7 @@ class Solution {
         even: Int,
         num: Int,
         rem: Int,
-        k: Int
+        k: Int,
     ): Int {
         if (i == maxLength) {
             return if (num % k == 0 && odd == even) 1 else 0
@@ -77,7 +77,7 @@ class Solution {
                     newEven,
                     num * 10 + j,
                     (num * 10 + j) % k,
-                    k
+                    k,
                 )
         }
         dp[mode][i][odd][even][rem] = res
diff --git a/src/main/kotlin/g2801_2900/s2830_maximize_the_profit_as_the_salesman/Solution.kt b/src/main/kotlin/g2801_2900/s2830_maximize_the_profit_as_the_salesman/Solution.kt
index 6bbfe5919..2480bc992 100644
--- a/src/main/kotlin/g2801_2900/s2830_maximize_the_profit_as_the_salesman/Solution.kt
+++ b/src/main/kotlin/g2801_2900/s2830_maximize_the_profit_as_the_salesman/Solution.kt
@@ -28,10 +28,14 @@ class Solution {
             for (l in temp) {
                 dp[l[1]] =
                     if ((i != 0)
-                    ) max(dp[l[1]], (dp[i - 1] + l[2])) else max(
-                        dp[l[1]],
-                        l[2]
-                    )
+                    ) {
+                        max(dp[l[1]], (dp[i - 1] + l[2]))
+                    } else {
+                        max(
+                            dp[l[1]],
+                            l[2],
+                        )
+                    }
             }
             i++
         }
diff --git a/src/main/kotlin/g2801_2900/s2846_minimum_edge_weight_equilibrium_queries_in_a_tree/Solution.kt b/src/main/kotlin/g2801_2900/s2846_minimum_edge_weight_equilibrium_queries_in_a_tree/Solution.kt
index 427041d2b..3df7d06c0 100644
--- a/src/main/kotlin/g2801_2900/s2846_minimum_edge_weight_equilibrium_queries_in_a_tree/Solution.kt
+++ b/src/main/kotlin/g2801_2900/s2846_minimum_edge_weight_equilibrium_queries_in_a_tree/Solution.kt
@@ -113,7 +113,7 @@ class Solution {
         parent: IntArray,
         level: IntArray,
         weightFreq: Array<IntArray>,
-        freq: IntArray
+        freq: IntArray,
     ) {
         parent[src] = p
         level[src] = currlevel
diff --git a/src/main/kotlin/g2801_2900/s2850_minimum_moves_to_spread_stones_over_grid/Solution.kt b/src/main/kotlin/g2801_2900/s2850_minimum_moves_to_spread_stones_over_grid/Solution.kt
index c153dbe32..f99a63437 100644
--- a/src/main/kotlin/g2801_2900/s2850_minimum_moves_to_spread_stones_over_grid/Solution.kt
+++ b/src/main/kotlin/g2801_2900/s2850_minimum_moves_to_spread_stones_over_grid/Solution.kt
@@ -24,9 +24,9 @@ class Solution {
                     for (t in min(g, 0)..max(g, 0)) {
                         val cost: Int =
                             abs(x) + abs(y) + abs(z) + abs(t) + abs((x - a)) + abs(
-                                (y - c)
+                                (y - c),
                             ) + abs((z - i)) + abs((t - g)) + abs((x - y + b + c)) + abs(
-                                (y - z + i + f)
+                                (y - z + i + f),
                             ) + abs((z - t + g + h)) + abs((t - x + a + d))
                         if (cost < minCost) {
                             minCost = cost
diff --git a/src/main/kotlin/g2801_2900/s2861_maximum_number_of_alloys/Solution.kt b/src/main/kotlin/g2801_2900/s2861_maximum_number_of_alloys/Solution.kt
index a6627c102..260356a1e 100644
--- a/src/main/kotlin/g2801_2900/s2861_maximum_number_of_alloys/Solution.kt
+++ b/src/main/kotlin/g2801_2900/s2861_maximum_number_of_alloys/Solution.kt
@@ -11,7 +11,7 @@ class Solution {
         budget: Int,
         composition: List<List<Int>>,
         stock: List<Int>,
-        cost: List<Int>
+        cost: List<Int>,
     ): Int {
         var ans = 0
         var max = 0
@@ -44,7 +44,7 @@ class Solution {
         budget: Int,
         composition: List<List<Int>>,
         stock: List<Int>,
-        cost: List<Int>
+        cost: List<Int>,
     ): Boolean {
         var paiSa = 0L
         for (i in 0 until n) {
diff --git a/src/main/kotlin/g2801_2900/s2865_beautiful_towers_i/Solution.kt b/src/main/kotlin/g2801_2900/s2865_beautiful_towers_i/Solution.kt
index 2f0c4867c..b1bb0e9c3 100644
--- a/src/main/kotlin/g2801_2900/s2865_beautiful_towers_i/Solution.kt
+++ b/src/main/kotlin/g2801_2900/s2865_beautiful_towers_i/Solution.kt
@@ -26,9 +26,9 @@ class Solution {
         var ans: Long = 0
         for (i in 0 until n) {
             if (i == 0 || i == n - 1 || (
-                maxHeights[i] >= maxHeights[i - 1] &&
-                    maxHeights[i] >= maxHeights[i + 1]
-                )
+                    maxHeights[i] >= maxHeights[i - 1] &&
+                        maxHeights[i] >= maxHeights[i + 1]
+                    )
             ) {
                 ans = max(ans.toDouble(), `fun`(maxHeights, i).toDouble()).toLong()
             }
diff --git a/src/main/kotlin/g2801_2900/s2872_maximum_number_of_k_divisible_components/Solution.kt b/src/main/kotlin/g2801_2900/s2872_maximum_number_of_k_divisible_components/Solution.kt
index cf2a281d0..474335127 100644
--- a/src/main/kotlin/g2801_2900/s2872_maximum_number_of_k_divisible_components/Solution.kt
+++ b/src/main/kotlin/g2801_2900/s2872_maximum_number_of_k_divisible_components/Solution.kt
@@ -29,7 +29,7 @@ class Solution {
         adj: List<MutableList<Int>>,
         isVis: BooleanArray,
         values: IntArray,
-        k: Long
+        k: Long,
     ): Long {
         var sum = values[curNode].toLong()
         for (ele in adj[curNode]) {
diff --git a/src/main/kotlin/g2801_2900/s2873_maximum_value_of_an_ordered_triplet_i/Solution.kt b/src/main/kotlin/g2801_2900/s2873_maximum_value_of_an_ordered_triplet_i/Solution.kt
index 8c2a931a7..32023a7e9 100644
--- a/src/main/kotlin/g2801_2900/s2873_maximum_value_of_an_ordered_triplet_i/Solution.kt
+++ b/src/main/kotlin/g2801_2900/s2873_maximum_value_of_an_ordered_triplet_i/Solution.kt
@@ -22,7 +22,7 @@ class Solution {
         for (j in n - 2 downTo 1) {
             result = max(
                 result.toDouble(),
-                ((iNumMaxs[j - 1] - nums[j]).toLong() * kNumMax).toDouble()
+                ((iNumMaxs[j - 1] - nums[j]).toLong() * kNumMax).toDouble(),
             ).toLong()
             if (nums[j] > kNumMax) {
                 kNumMax = nums[j]
diff --git a/src/main/kotlin/g2801_2900/s2876_count_visited_nodes_in_a_directed_graph/Solution.kt b/src/main/kotlin/g2801_2900/s2876_count_visited_nodes_in_a_directed_graph/Solution.kt
index 7b6884b3a..d3510e75b 100644
--- a/src/main/kotlin/g2801_2900/s2876_count_visited_nodes_in_a_directed_graph/Solution.kt
+++ b/src/main/kotlin/g2801_2900/s2876_count_visited_nodes_in_a_directed_graph/Solution.kt
@@ -23,7 +23,7 @@ class Solution {
         curr: Int,
         ans: IntArray,
         visited: BooleanArray,
-        level: IntArray
+        level: IntArray,
     ): IntArray {
         if (ans[curr] != 0) {
             return intArrayOf(-1, ans[curr])
diff --git a/src/main/kotlin/g2901_3000/s2910_minimum_number_of_groups_to_create_a_valid_assignment/Solution.kt b/src/main/kotlin/g2901_3000/s2910_minimum_number_of_groups_to_create_a_valid_assignment/Solution.kt
index 617368990..7e53495d8 100644
--- a/src/main/kotlin/g2901_3000/s2910_minimum_number_of_groups_to_create_a_valid_assignment/Solution.kt
+++ b/src/main/kotlin/g2901_3000/s2910_minimum_number_of_groups_to_create_a_valid_assignment/Solution.kt
@@ -21,7 +21,8 @@ class Solution {
         for (num in nums) {
             count.merge(num, 1) { a: Int?, b: Int? ->
                 Integer.sum(
-                    a!!, b!!
+                    a!!,
+                    b!!,
                 )
             }
         }
@@ -33,7 +34,8 @@ class Solution {
         for (c in count.values) {
             countFreq.merge(c, 1) { a: Int?, b: Int? ->
                 Integer.sum(
-                    a!!, b!!
+                    a!!,
+                    b!!,
                 )
             }
         }
diff --git a/src/main/kotlin/g2901_3000/s2919_minimum_increment_operations_to_make_array_beautiful/Solution.kt b/src/main/kotlin/g2901_3000/s2919_minimum_increment_operations_to_make_array_beautiful/Solution.kt
index 5eedfe9d9..383d58c07 100644
--- a/src/main/kotlin/g2901_3000/s2919_minimum_increment_operations_to_make_array_beautiful/Solution.kt
+++ b/src/main/kotlin/g2901_3000/s2919_minimum_increment_operations_to_make_array_beautiful/Solution.kt
@@ -16,15 +16,15 @@ class Solution {
                 max(0, k - nums[i]) + min(
                     min(
                         dp[i - 3],
-                        dp[i - 2]
+                        dp[i - 2],
                     ),
-                    dp[i - 1]
+                    dp[i - 1],
                 )
                 )
         }
         return min(
             min(dp[nums.size - 3], dp[nums.size - 2]),
-            dp[nums.size - 1]
+            dp[nums.size - 1],
         )
     }
 }
diff --git a/src/main/kotlin/g2901_3000/s2948_make_lexicographically_smallest_array_by_swapping_elements/Solution.kt b/src/main/kotlin/g2901_3000/s2948_make_lexicographically_smallest_array_by_swapping_elements/Solution.kt
index b180172fc..a32b6f2b8 100644
--- a/src/main/kotlin/g2901_3000/s2948_make_lexicographically_smallest_array_by_swapping_elements/Solution.kt
+++ b/src/main/kotlin/g2901_3000/s2948_make_lexicographically_smallest_array_by_swapping_elements/Solution.kt
@@ -10,7 +10,7 @@ class Solution {
         val nodes = Array(n) { i -> Node(i, nums[i]) }
         nodes.sortWith { a: Node, b: Node ->
             Integer.signum(
-                a.value - b.value
+                a.value - b.value,
             )
         }
         var group = 1
diff --git a/src/main/kotlin/g2901_3000/s2954_count_the_number_of_infection_sequences/Solution.kt b/src/main/kotlin/g2901_3000/s2954_count_the_number_of_infection_sequences/Solution.kt
index ba7e95986..a5028fd81 100644
--- a/src/main/kotlin/g2901_3000/s2954_count_the_number_of_infection_sequences/Solution.kt
+++ b/src/main/kotlin/g2901_3000/s2954_count_the_number_of_infection_sequences/Solution.kt
@@ -21,7 +21,7 @@ class Solution {
     private fun binomCoeff(n: Int, k: Int): Long {
         return max(
             1.0,
-            (fact[n] * invFact[k] % MOD * invFact[n - k] % MOD).toDouble()
+            (fact[n] * invFact[k] % MOD * invFact[n - k] % MOD).toDouble(),
         ).toLong()
     }
 
diff --git a/src/main/kotlin/g2901_3000/s2957_remove_adjacent_almost_equal_characters/Solution.kt b/src/main/kotlin/g2901_3000/s2957_remove_adjacent_almost_equal_characters/Solution.kt
index 98de4ce8a..f2719187d 100644
--- a/src/main/kotlin/g2901_3000/s2957_remove_adjacent_almost_equal_characters/Solution.kt
+++ b/src/main/kotlin/g2901_3000/s2957_remove_adjacent_almost_equal_characters/Solution.kt
@@ -17,8 +17,11 @@ class Solution {
                         i + 1 < wordArray.size &&
                             (wordArray[i + 1] != 'a' && wordArray[i + 1] != 'b')
                         )
-                    ) 'a'
-                    else 'z'
+                    ) {
+                        'a'
+                    } else {
+                        'z'
+                    }
             }
         }
         return count
diff --git a/src/main/kotlin/g2901_3000/s2968_apply_operations_to_maximize_frequency_score/Solution.kt b/src/main/kotlin/g2901_3000/s2968_apply_operations_to_maximize_frequency_score/Solution.kt
index 1b7e8bd42..d8ff4d328 100644
--- a/src/main/kotlin/g2901_3000/s2968_apply_operations_to_maximize_frequency_score/Solution.kt
+++ b/src/main/kotlin/g2901_3000/s2968_apply_operations_to_maximize_frequency_score/Solution.kt
@@ -16,7 +16,7 @@ class Solution {
         for (right in 1 until nums.size) {
             cost += abs(median - nums[right])
             median = nums[(right + left + 1) / 2]
-            while (cost> k) {
+            while (cost > k) {
                 cost -= abs(median - nums[left])
                 left++
                 median = nums[(right + left + 1) / 2]
diff --git a/src/main/kotlin/g2901_3000/s2975_maximum_square_area_by_removing_fences_from_a_field/Solution.kt b/src/main/kotlin/g2901_3000/s2975_maximum_square_area_by_removing_fences_from_a_field/Solution.kt
index 7e0c7179c..666dec9de 100644
--- a/src/main/kotlin/g2901_3000/s2975_maximum_square_area_by_removing_fences_from_a_field/Solution.kt
+++ b/src/main/kotlin/g2901_3000/s2975_maximum_square_area_by_removing_fences_from_a_field/Solution.kt
@@ -7,7 +7,7 @@ class Solution {
         m: Int,
         n: Int,
         hFences: IntArray,
-        vFences: IntArray
+        vFences: IntArray,
     ): Int {
         val hFencesWithBorder = IntArray(hFences.size + 2)
         System.arraycopy(hFences, 0, hFencesWithBorder, 0, hFences.size)
diff --git a/src/main/kotlin/g2901_3000/s2976_minimum_cost_to_convert_string_i/Solution.kt b/src/main/kotlin/g2901_3000/s2976_minimum_cost_to_convert_string_i/Solution.kt
index 51e1d75f0..8315ac0f4 100644
--- a/src/main/kotlin/g2901_3000/s2976_minimum_cost_to_convert_string_i/Solution.kt
+++ b/src/main/kotlin/g2901_3000/s2976_minimum_cost_to_convert_string_i/Solution.kt
@@ -11,7 +11,7 @@ class Solution {
         desiredText: String,
         fromLetters: CharArray,
         toLetters: CharArray,
-        transformationCost: IntArray
+        transformationCost: IntArray,
     ): Long {
         val alphabetSize = 26
         val transformationMatrix = Array(alphabetSize) { IntArray(alphabetSize) }
@@ -40,7 +40,7 @@ class Solution {
                             (
                                 transformationMatrix[row][k] +
                                     transformationMatrix[k][col]
-                                )
+                                ),
                         )
                     }
                 }
diff --git a/src/main/kotlin/g2901_3000/s2977_minimum_cost_to_convert_string_ii/Solution.kt b/src/main/kotlin/g2901_3000/s2977_minimum_cost_to_convert_string_ii/Solution.kt
index 1d4315a2f..ac3c6f05d 100644
--- a/src/main/kotlin/g2901_3000/s2977_minimum_cost_to_convert_string_ii/Solution.kt
+++ b/src/main/kotlin/g2901_3000/s2977_minimum_cost_to_convert_string_ii/Solution.kt
@@ -11,7 +11,7 @@ class Solution {
         target: String,
         original: Array<String>,
         changed: Array<String>,
-        cost: IntArray
+        cost: IntArray,
     ): Long {
         val index = HashMap<String, Int>()
         for (o in original) {
diff --git a/src/main/kotlin/g2901_3000/s2999_count_the_number_of_powerful_integers/Solution.kt b/src/main/kotlin/g2901_3000/s2999_count_the_number_of_powerful_integers/Solution.kt
index 1d11a037f..5d4d20cc1 100644
--- a/src/main/kotlin/g2901_3000/s2999_count_the_number_of_powerful_integers/Solution.kt
+++ b/src/main/kotlin/g2901_3000/s2999_count_the_number_of_powerful_integers/Solution.kt
@@ -22,11 +22,14 @@ class Solution {
         val lx = (finish - sn) / factor
 
         return if (sx == 0L
-        ) indexOfLimitIntSmallerThanOrEqual(lx, limit) + 1
-        else (
-            indexOfLimitIntSmallerThanOrEqual(lx, limit) -
-                indexOfLimitIntSmallerThanOrEqual(sx - 1, limit)
-            )
+        ) {
+            indexOfLimitIntSmallerThanOrEqual(lx, limit) + 1
+        } else {
+            (
+                indexOfLimitIntSmallerThanOrEqual(lx, limit) -
+                    indexOfLimitIntSmallerThanOrEqual(sx - 1, limit)
+                )
+        }
     }
 
     private fun indexOfLimitIntSmallerThanOrEqual(target: Long, limit: Int): Long {
diff --git a/src/main/kotlin/g3001_3100/s3013_divide_an_array_into_subarrays_with_minimum_cost_ii/Solution.kt b/src/main/kotlin/g3001_3100/s3013_divide_an_array_into_subarrays_with_minimum_cost_ii/Solution.kt
index de5d15fa5..068ba24bf 100644
--- a/src/main/kotlin/g3001_3100/s3013_divide_an_array_into_subarrays_with_minimum_cost_ii/Solution.kt
+++ b/src/main/kotlin/g3001_3100/s3013_divide_an_array_into_subarrays_with_minimum_cost_ii/Solution.kt
@@ -13,8 +13,11 @@ class Solution {
         val comparator =
             Comparator { i: Int?, j: Int? ->
                 if (nums[i!!] == nums[j!!]
-                ) Integer.compare(i, j)
-                else nums[i].compareTo(nums[j])
+                ) {
+                    Integer.compare(i, j)
+                } else {
+                    nums[i].compareTo(nums[j])
+                }
             }
         val used = TreeSet(comparator)
         val unused = TreeSet(comparator)
diff --git a/src/main/kotlin/g3001_3100/s3026_maximum_good_subarray_sum/Solution.kt b/src/main/kotlin/g3001_3100/s3026_maximum_good_subarray_sum/Solution.kt
index 831f07134..d434c4af4 100644
--- a/src/main/kotlin/g3001_3100/s3026_maximum_good_subarray_sum/Solution.kt
+++ b/src/main/kotlin/g3001_3100/s3026_maximum_good_subarray_sum/Solution.kt
@@ -17,7 +17,7 @@ class Solution {
                         prefixSum +
                             value -
                             valueToMinPrefixSum[value + targetDifference]!!
-                        )
+                        ),
                 )
             }
             if (valueToMinPrefixSum.containsKey(value - targetDifference)) {
@@ -27,7 +27,7 @@ class Solution {
                         prefixSum +
                             value -
                             valueToMinPrefixSum[value - targetDifference]!!
-                        )
+                        ),
                 )
             }
             if (!valueToMinPrefixSum.containsKey(value) ||
diff --git a/src/main/kotlin/g3001_3100/s3030_find_the_grid_of_region_average/Solution.kt b/src/main/kotlin/g3001_3100/s3030_find_the_grid_of_region_average/Solution.kt
index 439e815f7..f9b5eafe8 100644
--- a/src/main/kotlin/g3001_3100/s3030_find_the_grid_of_region_average/Solution.kt
+++ b/src/main/kotlin/g3001_3100/s3030_find_the_grid_of_region_average/Solution.kt
@@ -25,16 +25,16 @@ class Solution {
                 val r2c2 = image[i + 1][j + 1]
                 regionSum += (r0c0 + r0c1 + r0c2 + r1c0 + r1c1 + r1c2 + r2c0 + r2c1 + r2c2)
                 if (abs((r0c0 - r0c1)) > threshold || abs((r0c0 - r1c0)) > threshold || abs(
-                        (r0c1 - r0c0)
+                        (r0c1 - r0c0),
                     ) > threshold || abs((r0c1 - r1c1)) > threshold || abs((r0c1 - r0c2)) > threshold || abs(
-                            (r0c2 - r0c1)
-                        ) > threshold || abs((r0c2 - r1c2)) > threshold || abs((r1c0 - r1c1)) > threshold || abs(
-                            (r1c2 - r1c1)
-                        ) > threshold || abs((r2c0 - r2c1)) > threshold || abs((r2c0 - r1c0)) > threshold || abs(
-                            (r2c1 - r2c0)
-                        ) > threshold || abs((r2c1 - r1c1)) > threshold || abs((r2c1 - r2c2)) > threshold || abs(
-                            (r2c2 - r2c1)
-                        ) > threshold || abs((r2c2 - r1c2)) > threshold
+                        (r0c2 - r0c1),
+                    ) > threshold || abs((r0c2 - r1c2)) > threshold || abs((r1c0 - r1c1)) > threshold || abs(
+                        (r1c2 - r1c1),
+                    ) > threshold || abs((r2c0 - r2c1)) > threshold || abs((r2c0 - r1c0)) > threshold || abs(
+                        (r2c1 - r2c0),
+                    ) > threshold || abs((r2c1 - r1c1)) > threshold || abs((r2c1 - r2c2)) > threshold || abs(
+                        (r2c2 - r2c1),
+                    ) > threshold || abs((r2c2 - r1c2)) > threshold
                 ) {
                     regionPossible = false
                 }
diff --git a/src/main/kotlin/g3001_3100/s3044_most_frequent_prime/Solution.kt b/src/main/kotlin/g3001_3100/s3044_most_frequent_prime/Solution.kt
index 659019096..0b2861b1b 100644
--- a/src/main/kotlin/g3001_3100/s3044_most_frequent_prime/Solution.kt
+++ b/src/main/kotlin/g3001_3100/s3044_most_frequent_prime/Solution.kt
@@ -21,7 +21,7 @@ class Solution {
                 intArrayOf(0, 1),
                 intArrayOf(0, -1),
                 intArrayOf(1, 0),
-                intArrayOf(-1, 0)
+                intArrayOf(-1, 0),
             )
         val m = mat.size
         val n = mat[0].size
@@ -42,7 +42,7 @@ class Solution {
         mat: Array<IntArray>,
         num: Int,
         next: IntArray,
-        primeFreq: MutableMap<Int, Int>
+        primeFreq: MutableMap<Int, Int>,
     ) {
         var num = num
         val m = mat.size
diff --git a/src/main/kotlin/g3001_3100/s3076_shortest_uncommon_substring_in_an_array/Solution.kt b/src/main/kotlin/g3001_3100/s3076_shortest_uncommon_substring_in_an_array/Solution.kt
index aee30a5ce..8c51f72f2 100644
--- a/src/main/kotlin/g3001_3100/s3076_shortest_uncommon_substring_in_an_array/Solution.kt
+++ b/src/main/kotlin/g3001_3100/s3076_shortest_uncommon_substring_in_an_array/Solution.kt
@@ -26,10 +26,11 @@ class Solution {
             var resultLen = m + 1
             for (i in 0 until m) {
                 val curLen = search(
-                    cs, i,
+                    cs,
+                    i,
                     min(m.toDouble(), (i + resultLen).toDouble())
                         .toInt(),
-                    k
+                    k,
                 )
                 if (curLen != -1) {
                     val sub = String(cs, i, curLen)
diff --git a/src/main/kotlin/g3001_3100/s3077_maximum_strength_of_k_disjoint_subarrays/Solution.kt b/src/main/kotlin/g3001_3100/s3077_maximum_strength_of_k_disjoint_subarrays/Solution.kt
index fac41afb2..2a2434811 100644
--- a/src/main/kotlin/g3001_3100/s3077_maximum_strength_of_k_disjoint_subarrays/Solution.kt
+++ b/src/main/kotlin/g3001_3100/s3077_maximum_strength_of_k_disjoint_subarrays/Solution.kt
@@ -19,7 +19,7 @@ class Solution {
                 dp[i][j] = (
                     max(
                         dp[i - 1][j],
-                        dp[i - 1][j - 1]
+                        dp[i - 1][j - 1],
                     ) + (k.toLong() - j) * n[i] * pm
                     )
                 pm = -pm
@@ -35,7 +35,7 @@ class Solution {
                 dp[i][j] = (
                     max(
                         dp[i - 1][j],
-                        dp[i - 1][j - 1]
+                        dp[i - 1][j - 1],
                     ) + (k.toLong() - j) * n[i] * pm
                     )
             }
diff --git a/src/main/kotlin/g3001_3100/s3098_find_the_sum_of_subsequence_powers/Solution.kt b/src/main/kotlin/g3001_3100/s3098_find_the_sum_of_subsequence_powers/Solution.kt
index 976ae57d7..f09485131 100644
--- a/src/main/kotlin/g3001_3100/s3098_find_the_sum_of_subsequence_powers/Solution.kt
+++ b/src/main/kotlin/g3001_3100/s3098_find_the_sum_of_subsequence_powers/Solution.kt
@@ -19,7 +19,7 @@ class Solution {
         for (i in lastIdx + 1..len - k) {
             res = (
                 res + dfs(
-                    i, k - 1, min(minDiff, (nums[i] - nums[lastIdx])), dp, nums
+                    i, k - 1, min(minDiff, (nums[i] - nums[lastIdx])), dp, nums,
                 )
                 ) % MOD
         }
diff --git a/src/main/kotlin/g3101_3200/s3102_minimize_manhattan_distances/Solution.kt b/src/main/kotlin/g3101_3200/s3102_minimize_manhattan_distances/Solution.kt
index e8aa86599..310d503ee 100644
--- a/src/main/kotlin/g3101_3200/s3102_minimize_manhattan_distances/Solution.kt
+++ b/src/main/kotlin/g3101_3200/s3102_minimize_manhattan_distances/Solution.kt
@@ -10,7 +10,7 @@ class Solution {
     private fun manhattan(points: Array<IntArray>, i: Int, j: Int): Int {
         return (
             abs(points[i][0] - points[j][0]) + abs(
-                points[i][1] - points[j][1]
+                points[i][1] - points[j][1],
             )
             )
     }
@@ -48,8 +48,11 @@ class Solution {
             }
         }
         return if (max(maxSum - minSum, maxDiff - minDiff) == maxSum - minSum
-        ) intArrayOf(maxSumIndex, minSumIndex)
-        else intArrayOf(maxDiffIndex, minDiffIndex)
+        ) {
+            intArrayOf(maxSumIndex, minSumIndex)
+        } else {
+            intArrayOf(maxDiffIndex, minDiffIndex)
+        }
     }
 
     fun minimumDistance(points: Array<IntArray>): Int {
@@ -58,7 +61,7 @@ class Solution {
         val m2 = maxManhattanDistance(points, m[1])
         return min(
             manhattan(points, m1[0], m1[1]),
-            manhattan(points, m2[0], m2[1])
+            manhattan(points, m2[0], m2[1]),
         )
     }
 }
diff --git a/src/main/kotlin/g3101_3200/s3130_find_all_possible_stable_binary_arrays_ii/Solution.kt b/src/main/kotlin/g3101_3200/s3130_find_all_possible_stable_binary_arrays_ii/Solution.kt
index d1628b065..c3fcc7dd6 100644
--- a/src/main/kotlin/g3101_3200/s3130_find_all_possible_stable_binary_arrays_ii/Solution.kt
+++ b/src/main/kotlin/g3101_3200/s3130_find_all_possible_stable_binary_arrays_ii/Solution.kt
@@ -26,15 +26,15 @@ class Solution {
         val s = LongArray(one + 1)
         val n = (min(zero, one) + 1).toInt()
         for (
-            groups0 in (zero + limit - 1) / limit..min(zero, n)
-                .toInt()
+        groups0 in (zero + limit - 1) / limit..min(zero, n)
+            .toInt()
         ) {
             val s0 = calc(groups0, zero, limit)
             for (
-                groups1 in max(
-                    groups0 - 1,
-                    (one + limit - 1) / limit
-                )..min((groups0 + 1), one)
+            groups1 in max(
+                groups0 - 1,
+                (one + limit - 1) / limit,
+            )..min((groups0 + 1), one)
             ) {
                 var s1: Long
                 if (s[groups1] != 0L) {
diff --git a/src/main/kotlin/g3101_3200/s3136_valid_word/Solution.kt b/src/main/kotlin/g3101_3200/s3136_valid_word/Solution.kt
index 5c52f2735..b496fd674 100644
--- a/src/main/kotlin/g3101_3200/s3136_valid_word/Solution.kt
+++ b/src/main/kotlin/g3101_3200/s3136_valid_word/Solution.kt
@@ -14,7 +14,7 @@ class Solution {
         val consonants = charArrayOf(
             'b', 'c', 'd', 'f', 'g', 'h', 'j', 'k', 'l', 'm', 'n', 'p', 'q', 'r', 's', 't', 'v',
             'w', 'x', 'y', 'z', 'B', 'C', 'D', 'F', 'G', 'H', 'J', 'K', 'L', 'M', 'N', 'P', 'Q',
-            'R', 'S', 'T', 'V', 'W', 'X', 'Y', 'Z'
+            'R', 'S', 'T', 'V', 'W', 'X', 'Y', 'Z',
         )
         var flag1 = false
         var flag2 = false
diff --git a/src/main/kotlin/g3101_3200/s3149_find_the_minimum_cost_array_permutation/Solution.kt b/src/main/kotlin/g3101_3200/s3149_find_the_minimum_cost_array_permutation/Solution.kt
index 6cd49da85..b2c323bff 100644
--- a/src/main/kotlin/g3101_3200/s3149_find_the_minimum_cost_array_permutation/Solution.kt
+++ b/src/main/kotlin/g3101_3200/s3149_find_the_minimum_cost_array_permutation/Solution.kt
@@ -24,7 +24,7 @@ class Solution {
                         mask or (1 shl currNum),
                         currNum,
                         nums,
-                        dp
+                        dp,
                     )
                     )
                 minScore = min(minScore, currScore)
diff --git a/src/main/kotlin/g3101_3200/s3165_maximum_sum_of_subsequence_with_non_adjacent_elements/Solution.kt b/src/main/kotlin/g3101_3200/s3165_maximum_sum_of_subsequence_with_non_adjacent_elements/Solution.kt
index 818d31c2f..0a91b87e4 100644
--- a/src/main/kotlin/g3101_3200/s3165_maximum_sum_of_subsequence_with_non_adjacent_elements/Solution.kt
+++ b/src/main/kotlin/g3101_3200/s3165_maximum_sum_of_subsequence_with_non_adjacent_elements/Solution.kt
@@ -39,36 +39,36 @@ class Solution {
                     (
                         tree[2 * i]!![YN] + max(
                             tree[2 * i + 1]!![YY],
-                            tree[2 * i + 1]!![NY]
-                        )
+                            tree[2 * i + 1]!![NY],
                         )
+                        ),
                 )
                 tree[i]!![YN] = max(
                     (tree[2 * i]!![YY] + tree[2 * i + 1]!![NN]),
                     (
                         tree[2 * i]!![YN] + max(
                             tree[2 * i + 1]!![YN],
-                            tree[2 * i + 1]!![NN]
-                        )
+                            tree[2 * i + 1]!![NN],
                         )
+                        ),
                 )
                 tree[i]!![NY] = max(
                     (tree[2 * i]!![NY] + tree[2 * i + 1]!![NY]),
                     (
                         tree[2 * i]!![NN] + max(
                             tree[2 * i + 1]!![YY],
-                            tree[2 * i + 1]!![NY]
-                        )
+                            tree[2 * i + 1]!![NY],
                         )
+                        ),
                 )
                 tree[i]!![NN] = max(
                     (tree[2 * i]!![NY] + tree[2 * i + 1]!![NN]),
                     (
                         tree[2 * i]!![NN] + max(
                             tree[2 * i + 1]!![YN],
-                            tree[2 * i + 1]!![NN]
-                        )
+                            tree[2 * i + 1]!![NN],
                         )
+                        ),
                 )
             }
             return tree
@@ -84,42 +84,42 @@ class Solution {
                     (
                         tree[2 * i]!![YN] + max(
                             tree[2 * i + 1]!![YY],
-                            tree[2 * i + 1]!![NY]
-                        )
+                            tree[2 * i + 1]!![NY],
                         )
+                        ),
                 )
                 tree[i]!![YN] = max(
                     (tree[2 * i]!![YY] + tree[2 * i + 1]!![NN]),
                     (
                         tree[2 * i]!![YN] + max(
                             tree[2 * i + 1]!![YN],
-                            tree[2 * i + 1]!![NN]
-                        )
+                            tree[2 * i + 1]!![NN],
                         )
+                        ),
                 )
                 tree[i]!![NY] = max(
                     (tree[2 * i]!![NY] + tree[2 * i + 1]!![NY]),
                     (
                         tree[2 * i]!![NN] + max(
                             tree[2 * i + 1]!![YY],
-                            tree[2 * i + 1]!![NY]
-                        )
+                            tree[2 * i + 1]!![NY],
                         )
+                        ),
                 )
                 tree[i]!![NN] = max(
                     (tree[2 * i]!![NY] + tree[2 * i + 1]!![NN]),
                     (
                         tree[2 * i]!![NN] + max(
                             tree[2 * i + 1]!![YN],
-                            tree[2 * i + 1]!![NN]
-                        )
+                            tree[2 * i + 1]!![NN],
                         )
+                        ),
                 )
                 i /= 2
             }
             return max(
                 tree[1]!![YY],
-                max(tree[1]!![YN], max(tree[1]!![NY], tree[1]!![NN]))
+                max(tree[1]!![YN], max(tree[1]!![NY], tree[1]!![NN])),
             )
         }
     }
diff --git a/src/main/kotlin/g3101_3200/s3181_maximum_total_reward_using_operations_ii/Solution.kt b/src/main/kotlin/g3101_3200/s3181_maximum_total_reward_using_operations_ii/Solution.kt
index 52cb68337..53d38f66d 100644
--- a/src/main/kotlin/g3101_3200/s3181_maximum_total_reward_using_operations_ii/Solution.kt
+++ b/src/main/kotlin/g3101_3200/s3181_maximum_total_reward_using_operations_ii/Solution.kt
@@ -44,9 +44,9 @@ class Solution {
                         getAns(
                             rewards,
                             j,
-                            min((validLimit - rewards[j]), (rewards[j] - 1))
+                            min((validLimit - rewards[j]), (rewards[j] - 1)),
                         )
-                    )
+                    ),
             )
             j--
         }
diff --git a/src/main/kotlin/g3101_3200/s3186_maximum_total_damage_with_spell_casting/Solution.kt b/src/main/kotlin/g3101_3200/s3186_maximum_total_damage_with_spell_casting/Solution.kt
index 9c6b9eff8..36d8ea68c 100644
--- a/src/main/kotlin/g3101_3200/s3186_maximum_total_damage_with_spell_casting/Solution.kt
+++ b/src/main/kotlin/g3101_3200/s3186_maximum_total_damage_with_spell_casting/Solution.kt
@@ -46,13 +46,17 @@ class Solution {
             } else {
                 val curVal = max(
                     (curPower.toLong() * count + prevs[3]).toDouble(),
-                    max(prevs[1].toDouble(), prevs[2].toDouble())
+                    max(prevs[1].toDouble(), prevs[2].toDouble()),
                 )
                     .toLong()
                 val diff = min((p - curPower).toDouble(), (prevs.size - 1).toDouble()).toInt()
                 val nextCurVal =
-                    if ((diff == 1)) 0 else max(prevs[3].toDouble(), max(curVal.toDouble(), prevs[2].toDouble()))
-                        .toLong()
+                    if ((diff == 1)) {
+                        0
+                    } else {
+                        max(prevs[3].toDouble(), max(curVal.toDouble(), prevs[2].toDouble()))
+                            .toLong()
+                    }
                 // Shift the values in prevs[].
                 var k = prevs.size - 1
                 if (diff < prevs.size - 1) {
diff --git a/src/main/kotlin/g3101_3200/s3187_peaks_in_array/Solution.kt b/src/main/kotlin/g3101_3200/s3187_peaks_in_array/Solution.kt
index 240388acf..a75edf773 100644
--- a/src/main/kotlin/g3101_3200/s3187_peaks_in_array/Solution.kt
+++ b/src/main/kotlin/g3101_3200/s3187_peaks_in_array/Solution.kt
@@ -47,8 +47,11 @@ class Solution {
     }
 
     private fun computeRangeSum(binaryIndexedTree: IntArray, beginIndex: Int, endIndex: Int): Int {
-        return if (beginIndex <= endIndex) query(binaryIndexedTree, endIndex) - query(binaryIndexedTree, beginIndex - 1)
-        else 0
+        return if (beginIndex <= endIndex) {
+            query(binaryIndexedTree, endIndex) - query(binaryIndexedTree, beginIndex - 1)
+        } else {
+            0
+        }
     }
 
     private fun query(binaryIndexedTree: IntArray, index: Int): Int {
diff --git a/src/main/kotlin/g3101_3200/s3197_find_the_minimum_area_to_cover_all_ones_ii/Solution.kt b/src/main/kotlin/g3101_3200/s3197_find_the_minimum_area_to_cover_all_ones_ii/Solution.kt
index 615eb8284..c7b29b4f2 100644
--- a/src/main/kotlin/g3101_3200/s3197_find_the_minimum_area_to_cover_all_ones_ii/Solution.kt
+++ b/src/main/kotlin/g3101_3200/s3197_find_the_minimum_area_to_cover_all_ones_ii/Solution.kt
@@ -69,7 +69,7 @@ class Solution {
     private fun minSum3(
         firstSplitVertical: Boolean,
         takeLower: Boolean,
-        secondSplitVertical: Boolean
+        secondSplitVertical: Boolean,
     ): Int {
         var min = Int.MAX_VALUE
         if (firstSplitVertical) {
diff --git a/src/main/kotlin/g3201_3300/s3203_find_minimum_diameter_after_merging_two_trees/Solution.kt b/src/main/kotlin/g3201_3300/s3203_find_minimum_diameter_after_merging_two_trees/Solution.kt
index 445a08a34..e6c6f64cb 100644
--- a/src/main/kotlin/g3201_3300/s3203_find_minimum_diameter_after_merging_two_trees/Solution.kt
+++ b/src/main/kotlin/g3201_3300/s3203_find_minimum_diameter_after_merging_two_trees/Solution.kt
@@ -16,7 +16,7 @@ class Solution {
         var ans = max(d1[0], d2[0])
         ans = max(
             ((d1[0] + 1) / 2 + ((d2[0] + 1) / 2) + 1),
-            ans
+            ans,
         )
         return ans
     }
diff --git a/src/main/kotlin/g3201_3300/s3235_check_if_the_rectangle_corner_is_reachable/Solution.kt b/src/main/kotlin/g3201_3300/s3235_check_if_the_rectangle_corner_is_reachable/Solution.kt
index ae90dabe4..2dcb403d8 100644
--- a/src/main/kotlin/g3201_3300/s3235_check_if_the_rectangle_corner_is_reachable/Solution.kt
+++ b/src/main/kotlin/g3201_3300/s3235_check_if_the_rectangle_corner_is_reachable/Solution.kt
@@ -63,7 +63,7 @@ class Solution {
                 val y2 = circles[j][1]
                 val r2 = circles[j][2]
                 val dist = sqrt(
-                    (x1 - x2.toDouble()).pow(2.0) + (y1 - y2.toDouble()).pow(2.0)
+                    (x1 - x2.toDouble()).pow(2.0) + (y1 - y2.toDouble()).pow(2.0),
                 )
                 if (dist <= (r1 + r2)) {
                     ds.dsu(i, j)
diff --git a/src/main/kotlin/g3201_3300/s3241_time_taken_to_mark_all_nodes/Solution.kt b/src/main/kotlin/g3201_3300/s3241_time_taken_to_mark_all_nodes/Solution.kt
index c4a75eb8b..9c6bba382 100644
--- a/src/main/kotlin/g3201_3300/s3241_time_taken_to_mark_all_nodes/Solution.kt
+++ b/src/main/kotlin/g3201_3300/s3241_time_taken_to_mark_all_nodes/Solution.kt
@@ -55,14 +55,14 @@ class Solution {
                     (
                         max(
                             preLast,
-                            second[u]
+                            second[u],
                         ) + (if ((u and 1) == 0) 2 else 1)
                         )
                 } else {
                     (
                         max(
                             preLast,
-                            last[u]
+                            last[u],
                         ) + (if ((u and 1) == 0) 2 else 1)
                         )
                 }
diff --git a/src/main/kotlin/g3201_3300/s3250_find_the_count_of_monotonic_pairs_i/Solution.kt b/src/main/kotlin/g3201_3300/s3250_find_the_count_of_monotonic_pairs_i/Solution.kt
index 3f31268ec..9ee6ed41e 100644
--- a/src/main/kotlin/g3201_3300/s3250_find_the_count_of_monotonic_pairs_i/Solution.kt
+++ b/src/main/kotlin/g3201_3300/s3250_find_the_count_of_monotonic_pairs_i/Solution.kt
@@ -35,8 +35,11 @@ class Solution {
             for (j in 1 until currCases.size) {
                 val prevCases =
                     if (j < cases[i - 1]!!.size
-                    ) cases[i - 1]!![j]
-                    else cases[i - 1]!![cases[i - 1]!!.size - 1]
+                    ) {
+                        cases[i - 1]!![j]
+                    } else {
+                        cases[i - 1]!![cases[i - 1]!!.size - 1]
+                    }
                 currCases[j] = (currCases[j - 1] + prevCases) % (1000000000 + 7)
             }
             cases[i] = currCases
diff --git a/src/main/kotlin/g3201_3300/s3266_final_array_state_after_k_multiplication_operations_ii/Solution.kt b/src/main/kotlin/g3201_3300/s3266_final_array_state_after_k_multiplication_operations_ii/Solution.kt
index fedfd1c72..796efd963 100644
--- a/src/main/kotlin/g3201_3300/s3266_final_array_state_after_k_multiplication_operations_ii/Solution.kt
+++ b/src/main/kotlin/g3201_3300/s3266_final_array_state_after_k_multiplication_operations_ii/Solution.kt
@@ -40,8 +40,11 @@ class Solution {
             val pq =
                 PriorityQueue { p: LongArray, q: LongArray ->
                     if (p[0] != q[0]
-                    ) java.lang.Long.compare(p[0], q[0])
-                    else java.lang.Long.compare(p[1], q[1])
+                    ) {
+                        java.lang.Long.compare(p[0], q[0])
+                    } else {
+                        java.lang.Long.compare(p[1], q[1])
+                    }
                 }
             for (i in 0 until n) {
                 pq.offer(longArrayOf(nums[i].toLong(), i.toLong()))
diff --git a/src/main/kotlin/g3201_3300/s3270_find_the_key_of_the_numbers/Solution.kt b/src/main/kotlin/g3201_3300/s3270_find_the_key_of_the_numbers/Solution.kt
index 7af6062d2..f8f5edc69 100644
--- a/src/main/kotlin/g3201_3300/s3270_find_the_key_of_the_numbers/Solution.kt
+++ b/src/main/kotlin/g3201_3300/s3270_find_the_key_of_the_numbers/Solution.kt
@@ -11,8 +11,8 @@ class Solution {
                 num1 / 1000 % 10,
                 min(
                     num2 / 1000 % 10,
-                    num3 / 1000 % 10
-                )
+                    num3 / 1000 % 10,
+                ),
             ) * 1000
             )
         val s2 = (
@@ -20,8 +20,8 @@ class Solution {
                 num1 / 100 % 10,
                 min(
                     num2 / 100 % 10,
-                    num3 / 100 % 10
-                )
+                    num3 / 100 % 10,
+                ),
             ) * 100
             )
         val s3 =
@@ -30,13 +30,13 @@ class Solution {
                     num1 / 10 % 10,
                     min(
                         num2 / 10 % 10,
-                        num3 / 10 % 10
-                    )
+                        num3 / 10 % 10,
+                    ),
                 ) * 10
                 )
         val s4 = min(
             num1 % 10,
-            min(num2 % 10, num3 % 10)
+            min(num2 % 10, num3 % 10),
         )
         return s1 + s2 + s3 + s4
     }
diff --git a/src/main/kotlin/g3201_3300/s3272_find_the_count_of_good_integers/Solution.kt b/src/main/kotlin/g3201_3300/s3272_find_the_count_of_good_integers/Solution.kt
index 6756fe251..2bf0e53a5 100644
--- a/src/main/kotlin/g3201_3300/s3272_find_the_count_of_good_integers/Solution.kt
+++ b/src/main/kotlin/g3201_3300/s3272_find_the_count_of_good_integers/Solution.kt
@@ -51,7 +51,7 @@ class Solution {
         lb: Int,
         sum: Int,
         ans: StringBuilder,
-        rem: IntArray
+        rem: IntArray,
     ) {
         if (f > r) {
             if (sum == 0) {
diff --git a/src/main/kotlin/g3201_3300/s3283_maximum_number_of_moves_to_kill_all_pawns/Solution.kt b/src/main/kotlin/g3201_3300/s3283_maximum_number_of_moves_to_kill_all_pawns/Solution.kt
index cab8d7856..e988b4a3e 100644
--- a/src/main/kotlin/g3201_3300/s3283_maximum_number_of_moves_to_kill_all_pawns/Solution.kt
+++ b/src/main/kotlin/g3201_3300/s3283_maximum_number_of_moves_to_kill_all_pawns/Solution.kt
@@ -22,7 +22,10 @@ class Solution {
             for (j in i + 1 until n) {
                 val dist =
                     calculateMoves(
-                        positions[i][0], positions[i][1], positions[j][0], positions[j][1]
+                        positions[i][0],
+                        positions[i][1],
+                        positions[j][0],
+                        positions[j][1],
                     )
                 distances[j][i] = dist
                 distances[i][j] = distances[j][i]
@@ -85,8 +88,14 @@ class Solution {
 
     companion object {
         private val KNIGHT_MOVES = arrayOf<IntArray>(
-            intArrayOf(-2, -1), intArrayOf(-2, 1), intArrayOf(-1, -2), intArrayOf(-1, 2),
-            intArrayOf(1, -2), intArrayOf(1, 2), intArrayOf(2, -1), intArrayOf(2, 1)
+            intArrayOf(-2, -1),
+            intArrayOf(-2, 1),
+            intArrayOf(-1, -2),
+            intArrayOf(-1, 2),
+            intArrayOf(1, -2),
+            intArrayOf(1, 2),
+            intArrayOf(2, -1),
+            intArrayOf(2, 1),
         )
     }
 }
diff --git a/src/main/kotlin/g3201_3300/s3288_length_of_the_longest_increasing_path/Solution.kt b/src/main/kotlin/g3201_3300/s3288_length_of_the_longest_increasing_path/Solution.kt
index 717f0ca16..7107b5e7e 100644
--- a/src/main/kotlin/g3201_3300/s3288_length_of_the_longest_increasing_path/Solution.kt
+++ b/src/main/kotlin/g3201_3300/s3288_length_of_the_longest_increasing_path/Solution.kt
@@ -24,7 +24,7 @@ class Solution {
                 } else {
                     a[0] - b[0]
                 }
-            }
+            },
         )
         lower.sortWith(
             Comparator { a: IntArray, b: IntArray ->
@@ -33,7 +33,7 @@ class Solution {
                 } else {
                     a[0] - b[0]
                 }
-            }
+            },
         )
         return longestIncreasingLength(upper) + longestIncreasingLength(lower) + 1
     }
diff --git a/src/main/kotlin/g3301_3400/s3311_construct_2d_grid_matching_graph_layout/Solution.kt b/src/main/kotlin/g3301_3400/s3311_construct_2d_grid_matching_graph_layout/Solution.kt
index 4cf0fc89a..4d5637c01 100644
--- a/src/main/kotlin/g3301_3400/s3311_construct_2d_grid_matching_graph_layout/Solution.kt
+++ b/src/main/kotlin/g3301_3400/s3311_construct_2d_grid_matching_graph_layout/Solution.kt
@@ -62,7 +62,7 @@ class Solution {
         seen: BooleanArray,
         st: Int,
         als: Array<ArrayList<Int>>,
-        cs: IntArray
+        cs: IntArray,
     ): Array<IntArray> {
         var st = st
         var res: Array<IntArray>
@@ -107,7 +107,7 @@ class Solution {
         st: Int,
         row2: Int,
         seen: BooleanArray,
-        als: Array<ArrayList<Int>>
+        als: Array<ArrayList<Int>>,
     ): Array<IntArray> {
         var res: Array<IntArray> = Array<IntArray>(2) { IntArray(n / 2) }
         res[0][0] = st
diff --git a/src/main/kotlin/g3301_3400/s3318_find_x_sum_of_all_k_long_subarrays_i/Solution.kt b/src/main/kotlin/g3301_3400/s3318_find_x_sum_of_all_k_long_subarrays_i/Solution.kt
index 9f2a0aff4..886a832c3 100644
--- a/src/main/kotlin/g3301_3400/s3318_find_x_sum_of_all_k_long_subarrays_i/Solution.kt
+++ b/src/main/kotlin/g3301_3400/s3318_find_x_sum_of_all_k_long_subarrays_i/Solution.kt
@@ -30,7 +30,7 @@ class Solution {
                             return@Comparator b.num - a.num
                         }
                         b.freq - a.freq
-                    }
+                    },
                 )
             for (j in i until i + k) {
                 map.put(nums[j], map.getOrDefault(nums[j], 0)!! + 1)
diff --git a/src/main/kotlin/g3301_3400/s3343_count_number_of_balanced_permutations/Solution.kt b/src/main/kotlin/g3301_3400/s3343_count_number_of_balanced_permutations/Solution.kt
index c55ba256c..82bbb2131 100644
--- a/src/main/kotlin/g3301_3400/s3343_count_number_of_balanced_permutations/Solution.kt
+++ b/src/main/kotlin/g3301_3400/s3343_count_number_of_balanced_permutations/Solution.kt
@@ -42,14 +42,14 @@ class Solution {
                     while (t <= c[d] && k + t <= m && s + d * t <= hs) {
                         dp[k + t]!![s + d * t] =
                             (
-                            dp[k + t]!![s + d * t] + dp[k]!![s] * comb(
-                                c[d],
-                                t,
-                                f,
-                                invF,
-                                M
-                            )
-                            ) % M
+                                dp[k + t]!![s + d * t] + dp[k]!![s] * comb(
+                                    c[d],
+                                    t,
+                                    f,
+                                    invF,
+                                    M,
+                                )
+                                ) % M
                         t++
                     }
                 }
diff --git a/src/main/kotlin/g3301_3400/s3357_minimize_the_maximum_adjacent_element_difference/Solution.kt b/src/main/kotlin/g3301_3400/s3357_minimize_the_maximum_adjacent_element_difference/Solution.kt
index 40bf06406..458c4d89f 100644
--- a/src/main/kotlin/g3301_3400/s3357_minimize_the_maximum_adjacent_element_difference/Solution.kt
+++ b/src/main/kotlin/g3301_3400/s3357_minimize_the_maximum_adjacent_element_difference/Solution.kt
@@ -49,8 +49,8 @@ class Solution {
                         res,
                         min(
                             maxb - a,
-                            min(b - mina, (maxb - mina + 2) / 3 * 2)
-                        )
+                            min(b - mina, (maxb - mina + 2) / 3 * 2),
+                        ),
                     )
                 }
             }
diff --git a/src/test/kotlin/com_github_leetcode/NodeTest.kt b/src/test/kotlin/com_github_leetcode/NodeTest.kt
index 5641e282c..31de14779 100644
--- a/src/test/kotlin/com_github_leetcode/NodeTest.kt
+++ b/src/test/kotlin/com_github_leetcode/NodeTest.kt
@@ -31,8 +31,8 @@ internal class NodeTest {
         val node: Node = Node(
             1,
             listOf(
-                Node(2, listOf(Node(3)))
-            )
+                Node(2, listOf(Node(3))),
+            ),
         )
         assertThat(node.`val`, equalTo(1))
         assertThat(node.toString(), equalTo("[[3]]"))
diff --git a/src/test/kotlin/com_github_leetcode/TreeUtils.kt b/src/test/kotlin/com_github_leetcode/TreeUtils.kt
index 6057c5d9b..ece2a3372 100644
--- a/src/test/kotlin/com_github_leetcode/TreeUtils.kt
+++ b/src/test/kotlin/com_github_leetcode/TreeUtils.kt
@@ -5,8 +5,8 @@ import java.util.Queue
 
 object TreeUtils {
     /*
-    * This method is to construct a normal binary tree. The input reads like
-    * this for [5, 3, 6, 2, 4, null, null, 1], i.e. preorder:
+     * This method is to construct a normal binary tree. The input reads like
+     * this for [5, 3, 6, 2, 4, null, null, 1], i.e. preorder:
                    5
                  /   \
                 3     6
@@ -14,7 +14,7 @@ object TreeUtils {
               2   4  #   #
              /
             1
-    */
+     */
     fun constructBinaryTree(treeValues: List<Int?>): TreeNode {
         val root = TreeNode(treeValues[0]!!)
         val queue: Queue<TreeNode?> = LinkedList()
diff --git a/src/test/kotlin/com_github_leetcode/left_right/NodeTest.kt b/src/test/kotlin/com_github_leetcode/left_right/NodeTest.kt
index ffbf31b9e..34a8cdfcf 100644
--- a/src/test/kotlin/com_github_leetcode/left_right/NodeTest.kt
+++ b/src/test/kotlin/com_github_leetcode/left_right/NodeTest.kt
@@ -21,8 +21,8 @@ internal class NodeTest {
             equalTo(
                 "Node{val=1,left=Node{val=2,left=null,right=null," +
                     "next=null},right=Node{val=3,left=null,right=null,next=null},next=Node{val=4," +
-                    "left=null,right=null,next=null}}"
-            )
+                    "left=null,right=null,next=null}}",
+            ),
         )
     }
 }
diff --git a/src/test/kotlin/com_github_leetcode/neighbors/NodeTest.kt b/src/test/kotlin/com_github_leetcode/neighbors/NodeTest.kt
index 77b935aef..8670d39a6 100644
--- a/src/test/kotlin/com_github_leetcode/neighbors/NodeTest.kt
+++ b/src/test/kotlin/com_github_leetcode/neighbors/NodeTest.kt
@@ -23,7 +23,7 @@ internal class NodeTest {
         val node4and1and3 = Node(4, listOf(node1, node3))
         val node = Node(
             5,
-            listOf(node1and2and4, node2and1and3, node3and2and4, node4and1and3)
+            listOf(node1and2and4, node2and1and3, node3and2and4, node4and1and3),
         )
         assertThat(node.toString(), equalTo("[[2,4],[1,3],[2,4],[1,3]]"))
     }
diff --git a/src/test/kotlin/com_github_leetcode/random/NodeTest.kt b/src/test/kotlin/com_github_leetcode/random/NodeTest.kt
index c1de96d3f..3fe9f1d84 100644
--- a/src/test/kotlin/com_github_leetcode/random/NodeTest.kt
+++ b/src/test/kotlin/com_github_leetcode/random/NodeTest.kt
@@ -31,7 +31,7 @@ internal class NodeTest {
         val node = Node(
             1,
             Node(2, Node(21), Node(22)),
-            Node(3, null, Node(32))
+            Node(3, null, Node(32)),
         )
         assertThat(node.`val`, equalTo(1))
         assertThat(node.toString(), equalTo("[[1,3],[2,2],[21,null]]"))
diff --git a/src/test/kotlin/g0001_0100/s0002_add_two_numbers/SolutionTest.kt b/src/test/kotlin/g0001_0100/s0002_add_two_numbers/SolutionTest.kt
index a411ead36..6ec1cd25c 100644
--- a/src/test/kotlin/g0001_0100/s0002_add_two_numbers/SolutionTest.kt
+++ b/src/test/kotlin/g0001_0100/s0002_add_two_numbers/SolutionTest.kt
@@ -12,7 +12,8 @@ internal class SolutionTest {
         val listNode1: ListNode? = contructLinkedList(intArrayOf(2, 4, 3))
         val listNode2: ListNode? = contructLinkedList(intArrayOf(5, 6, 4))
         assertThat(
-            Solution().addTwoNumbers(listNode1, listNode2).toString(), equalTo("7, 0, 8")
+            Solution().addTwoNumbers(listNode1, listNode2).toString(),
+            equalTo("7, 0, 8"),
         )
     }
 
@@ -20,7 +21,7 @@ internal class SolutionTest {
     fun addTwoNumbers2() {
         assertThat(
             Solution().addTwoNumbers(ListNode(0), ListNode(0)).toString(),
-            equalTo("0")
+            equalTo("0"),
         )
     }
 
@@ -30,7 +31,7 @@ internal class SolutionTest {
         val listNode2: ListNode? = contructLinkedList(intArrayOf(9, 9, 9, 9))
         assertThat(
             Solution().addTwoNumbers(listNode1, listNode2).toString(),
-            equalTo("8, 9, 9, 9, 0, 0, 0, 1")
+            equalTo("8, 9, 9, 9, 0, 0, 0, 1"),
         )
     }
 }
diff --git a/src/test/kotlin/g0001_0100/s0004_median_of_two_sorted_arrays/SolutionTest.kt b/src/test/kotlin/g0001_0100/s0004_median_of_two_sorted_arrays/SolutionTest.kt
index 9b43653a4..9b313269d 100644
--- a/src/test/kotlin/g0001_0100/s0004_median_of_two_sorted_arrays/SolutionTest.kt
+++ b/src/test/kotlin/g0001_0100/s0004_median_of_two_sorted_arrays/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun findMedianSortedArrays() {
         assertThat(
             Solution().findMedianSortedArrays(intArrayOf(1, 3), intArrayOf(2)),
-            equalTo(2.0)
+            equalTo(2.0),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun findMedianSortedArrays2() {
         assertThat(
             Solution().findMedianSortedArrays(intArrayOf(1, 2), intArrayOf(3, 4)),
-            equalTo(2.5)
+            equalTo(2.5),
         )
     }
 }
diff --git a/src/test/kotlin/g0001_0100/s0014_longest_common_prefix/SolutionTest.kt b/src/test/kotlin/g0001_0100/s0014_longest_common_prefix/SolutionTest.kt
index a730995a6..f6ebab17a 100644
--- a/src/test/kotlin/g0001_0100/s0014_longest_common_prefix/SolutionTest.kt
+++ b/src/test/kotlin/g0001_0100/s0014_longest_common_prefix/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun longestCommonPrefix() {
         assertThat(
             Solution().longestCommonPrefix(arrayOf("flower", "flow", "flight")),
-            equalTo("fl")
+            equalTo("fl"),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun longestCommonPrefix2() {
         assertThat(
             Solution().longestCommonPrefix(arrayOf("dog", "racecar", "car")),
-            equalTo("")
+            equalTo(""),
         )
     }
 }
diff --git a/src/test/kotlin/g0001_0100/s0015_3sum/SolutionTest.kt b/src/test/kotlin/g0001_0100/s0015_3sum/SolutionTest.kt
index 58e548d9f..7c5c5e843 100644
--- a/src/test/kotlin/g0001_0100/s0015_3sum/SolutionTest.kt
+++ b/src/test/kotlin/g0001_0100/s0015_3sum/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
     fun threeSum() {
         assertThat(
             Solution().threeSum(intArrayOf(-1, 0, 1, 2, -1, -4)),
-            equalTo(getLists(arrayOf(intArrayOf(-1, -1, 2), intArrayOf(-1, 0, 1))))
+            equalTo(getLists(arrayOf(intArrayOf(-1, -1, 2), intArrayOf(-1, 0, 1)))),
         )
     }
 
@@ -18,7 +18,7 @@ internal class SolutionTest {
     fun threeSum2() {
         assertThat(
             Solution().threeSum(intArrayOf()),
-            equalTo(listOf())
+            equalTo(listOf()),
         )
     }
 
@@ -26,7 +26,7 @@ internal class SolutionTest {
     fun threeSum3() {
         assertThat(
             Solution().threeSum(intArrayOf(0)),
-            equalTo(listOf())
+            equalTo(listOf()),
         )
     }
 }
diff --git a/src/test/kotlin/g0001_0100/s0016_3sum_closest/SolutionTest.kt b/src/test/kotlin/g0001_0100/s0016_3sum_closest/SolutionTest.kt
index 608a5aee7..8392d3ca0 100644
--- a/src/test/kotlin/g0001_0100/s0016_3sum_closest/SolutionTest.kt
+++ b/src/test/kotlin/g0001_0100/s0016_3sum_closest/SolutionTest.kt
@@ -19,7 +19,7 @@ internal class SolutionTest {
     fun threeSumClosest3() {
         assertThat(
             Solution().threeSumClosest(intArrayOf(1, 2, 4, 8, 16, 32, 64, 128), 82),
-            equalTo(82)
+            equalTo(82),
         )
     }
 
@@ -27,7 +27,7 @@ internal class SolutionTest {
     fun threeSumClosest4() {
         assertThat(
             Solution().threeSumClosest(intArrayOf(4, 0, 5, -5, 3, 3, 0, -4, -5), -2),
-            equalTo(-2)
+            equalTo(-2),
         )
     }
 }
diff --git a/src/test/kotlin/g0001_0100/s0017_letter_combinations_of_a_phone_number/SolutionTest.kt b/src/test/kotlin/g0001_0100/s0017_letter_combinations_of_a_phone_number/SolutionTest.kt
index c0638d9ec..7b46aaea7 100644
--- a/src/test/kotlin/g0001_0100/s0017_letter_combinations_of_a_phone_number/SolutionTest.kt
+++ b/src/test/kotlin/g0001_0100/s0017_letter_combinations_of_a_phone_number/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun letterCombinations() {
         assertThat(
             Solution().letterCombinations("23"),
-            equalTo(listOf("ad", "ae", "af", "bd", "be", "bf", "cd", "ce", "cf"))
+            equalTo(listOf("ad", "ae", "af", "bd", "be", "bf", "cd", "ce", "cf")),
         )
     }
 
@@ -41,7 +41,8 @@ internal class SolutionTest {
     @Test
     fun letterCombinations7() {
         assertThat(
-            Solution().letterCombinations("7"), equalTo(listOf("p", "q", "r", "s"))
+            Solution().letterCombinations("7"),
+            equalTo(listOf("p", "q", "r", "s")),
         )
     }
 
@@ -53,7 +54,8 @@ internal class SolutionTest {
     @Test
     fun letterCombinations9() {
         assertThat(
-            Solution().letterCombinations("9"), equalTo(listOf("w", "x", "y", "z"))
+            Solution().letterCombinations("9"),
+            equalTo(listOf("w", "x", "y", "z")),
         )
     }
 }
diff --git a/src/test/kotlin/g0001_0100/s0018_4sum/SolutionTest.kt b/src/test/kotlin/g0001_0100/s0018_4sum/SolutionTest.kt
index 1aa6dde6a..270b31aa3 100644
--- a/src/test/kotlin/g0001_0100/s0018_4sum/SolutionTest.kt
+++ b/src/test/kotlin/g0001_0100/s0018_4sum/SolutionTest.kt
@@ -11,8 +11,8 @@ internal class SolutionTest {
         assertThat(
             Solution().fourSum(intArrayOf(1, 0, -1, 0, -2, 2), 0),
             equalTo(
-                getLists(arrayOf(intArrayOf(-2, -1, 1, 2), intArrayOf(-2, 0, 0, 2), intArrayOf(-1, 0, 0, 1)))
-            )
+                getLists(arrayOf(intArrayOf(-2, -1, 1, 2), intArrayOf(-2, 0, 0, 2), intArrayOf(-1, 0, 0, 1))),
+            ),
         )
     }
 
@@ -21,8 +21,8 @@ internal class SolutionTest {
         assertThat(
             Solution().fourSum(intArrayOf(2, 2, 2, 2, 2), 8),
             equalTo(
-                getLists(arrayOf(intArrayOf(2, 2, 2, 2)))
-            )
+                getLists(arrayOf(intArrayOf(2, 2, 2, 2))),
+            ),
         )
     }
 
@@ -31,8 +31,8 @@ internal class SolutionTest {
         assertThat(
             Solution().fourSum(intArrayOf(2, 2, 2), 8),
             equalTo(
-                listOf()
-            )
+                listOf(),
+            ),
         )
     }
 
@@ -41,8 +41,8 @@ internal class SolutionTest {
         assertThat(
             Solution().fourSum(intArrayOf(1000000000, 1000000000), 8),
             equalTo(
-                listOf()
-            )
+                listOf(),
+            ),
         )
     }
 }
diff --git a/src/test/kotlin/g0001_0100/s0021_merge_two_sorted_lists/SolutionTest.kt b/src/test/kotlin/g0001_0100/s0021_merge_two_sorted_lists/SolutionTest.kt
index 3b9b0ea06..72fc1f12c 100644
--- a/src/test/kotlin/g0001_0100/s0021_merge_two_sorted_lists/SolutionTest.kt
+++ b/src/test/kotlin/g0001_0100/s0021_merge_two_sorted_lists/SolutionTest.kt
@@ -18,7 +18,7 @@ internal class SolutionTest {
     fun mergeTwoLists2() {
         assertThat(
             Solution().mergeTwoLists(ListNode(), ListNode()).toString(),
-            equalTo("0, 0")
+            equalTo("0, 0"),
         )
     }
 }
diff --git a/src/test/kotlin/g0001_0100/s0022_generate_parentheses/SolutionTest.kt b/src/test/kotlin/g0001_0100/s0022_generate_parentheses/SolutionTest.kt
index 4d10a765d..5e72f37e6 100644
--- a/src/test/kotlin/g0001_0100/s0022_generate_parentheses/SolutionTest.kt
+++ b/src/test/kotlin/g0001_0100/s0022_generate_parentheses/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun generateParenthesis() {
         assertThat(
             Solution().generateParenthesis(3),
-            equalTo(listOf("((()))", "(()())", "(())()", "()(())", "()()()"))
+            equalTo(listOf("((()))", "(()())", "(())()", "()(())", "()()()")),
         )
     }
 
diff --git a/src/test/kotlin/g0001_0100/s0023_merge_k_sorted_lists/SolutionTest.kt b/src/test/kotlin/g0001_0100/s0023_merge_k_sorted_lists/SolutionTest.kt
index 3aa039b19..02f186b6a 100644
--- a/src/test/kotlin/g0001_0100/s0023_merge_k_sorted_lists/SolutionTest.kt
+++ b/src/test/kotlin/g0001_0100/s0023_merge_k_sorted_lists/SolutionTest.kt
@@ -13,7 +13,7 @@ internal class SolutionTest {
         val head3 = createSinglyLinkedList(listOf(2, 6))
         assertThat(
             Solution().mergeKLists(arrayOf(head1, head2, head3)).toString(),
-            equalTo("1, 1, 2, 3, 4, 4, 5, 6")
+            equalTo("1, 1, 2, 3, 4, 4, 5, 6"),
         )
     }
 
@@ -24,7 +24,7 @@ internal class SolutionTest {
         val head3 = createSinglyLinkedList(listOf(4, 6, 9, 10))
         assertThat(
             Solution().mergeKLists(arrayOf(head1, head2, head3)).toString(),
-            equalTo("1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12")
+            equalTo("1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12"),
         )
     }
 }
diff --git a/src/test/kotlin/g0001_0100/s0030_substring_with_concatenation_of_all_words/SolutionTest.kt b/src/test/kotlin/g0001_0100/s0030_substring_with_concatenation_of_all_words/SolutionTest.kt
index 68bb4aa76..1b9222d46 100644
--- a/src/test/kotlin/g0001_0100/s0030_substring_with_concatenation_of_all_words/SolutionTest.kt
+++ b/src/test/kotlin/g0001_0100/s0030_substring_with_concatenation_of_all_words/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
     fun findSubstring() {
         assertThat(
             Solution().findSubstring("barfoothefoobarman", arrayOf("foo", "bar")),
-            equalTo(listOf(0, 9))
+            equalTo(listOf(0, 9)),
         )
     }
 
@@ -19,9 +19,10 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .findSubstring(
-                    "wordgoodgoodgoodbestword", arrayOf("word", "good", "best", "word")
+                    "wordgoodgoodgoodbestword",
+                    arrayOf("word", "good", "best", "word"),
                 ),
-            equalTo(Collections.emptyList())
+            equalTo(Collections.emptyList()),
         )
     }
 
@@ -30,9 +31,10 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .findSubstring(
-                    "barfoofoobarthefoobarman", arrayOf("bar", "foo", "the")
+                    "barfoofoobarthefoobarman",
+                    arrayOf("bar", "foo", "the"),
                 ),
-            equalTo(listOf(6, 9, 12))
+            equalTo(listOf(6, 9, 12)),
         )
     }
 }
diff --git a/src/test/kotlin/g0001_0100/s0036_valid_sudoku/SolutionTest.kt b/src/test/kotlin/g0001_0100/s0036_valid_sudoku/SolutionTest.kt
index bad025d9d..1aa4bdcae 100644
--- a/src/test/kotlin/g0001_0100/s0036_valid_sudoku/SolutionTest.kt
+++ b/src/test/kotlin/g0001_0100/s0036_valid_sudoku/SolutionTest.kt
@@ -18,8 +18,8 @@ internal class SolutionTest {
                     charArrayOf('7', '.', '.', '.', '2', '.', '.', '.', '6'),
                     charArrayOf('.', '6', '.', '.', '.', '.', '2', '8', '.'),
                     charArrayOf('.', '.', '.', '4', '1', '9', '.', '.', '5'),
-                    charArrayOf('.', '.', '.', '.', '8', '.', '.', '7', '9')
-                )
+                    charArrayOf('.', '.', '.', '.', '8', '.', '.', '7', '9'),
+                ),
             )
         assertThat(result, equalTo(true))
     }
@@ -37,8 +37,8 @@ internal class SolutionTest {
                     charArrayOf('7', '.', '.', '.', '2', '.', '.', '.', '6'),
                     charArrayOf('.', '6', '.', '.', '.', '.', '2', '8', '.'),
                     charArrayOf('.', '.', '.', '4', '1', '9', '.', '.', '5'),
-                    charArrayOf('.', '.', '.', '.', '8', '.', '.', '7', '9')
-                )
+                    charArrayOf('.', '.', '.', '.', '8', '.', '.', '7', '9'),
+                ),
             )
         assertThat(result, equalTo(false))
     }
diff --git a/src/test/kotlin/g0001_0100/s0037_sudoku_solver/SolutionTest.kt b/src/test/kotlin/g0001_0100/s0037_sudoku_solver/SolutionTest.kt
index 9a3b6b2b3..8025576a2 100644
--- a/src/test/kotlin/g0001_0100/s0037_sudoku_solver/SolutionTest.kt
+++ b/src/test/kotlin/g0001_0100/s0037_sudoku_solver/SolutionTest.kt
@@ -16,7 +16,7 @@ internal class SolutionTest {
             charArrayOf('7', '1', '3', '9', '2', '4', '8', '5', '6'),
             charArrayOf('9', '6', '1', '5', '3', '7', '2', '8', '4'),
             charArrayOf('2', '8', '7', '4', '1', '9', '6', '3', '5'),
-            charArrayOf('3', '4', '5', '2', '8', '6', '1', '7', '9')
+            charArrayOf('3', '4', '5', '2', '8', '6', '1', '7', '9'),
         )
         val board = arrayOf(
             charArrayOf('5', '3', '.', '.', '7', '.', '.', '.', '.'),
@@ -27,7 +27,7 @@ internal class SolutionTest {
             charArrayOf('7', '.', '.', '.', '2', '.', '.', '.', '6'),
             charArrayOf('.', '6', '.', '.', '.', '.', '2', '8', '.'),
             charArrayOf('.', '.', '.', '4', '1', '9', '.', '.', '5'),
-            charArrayOf('.', '.', '.', '.', '8', '.', '.', '7', '9')
+            charArrayOf('.', '.', '.', '.', '8', '.', '.', '7', '9'),
         )
         Solution().solveSudoku(board)
         assertThat(board, equalTo(expected))
diff --git a/src/test/kotlin/g0001_0100/s0039_combination_sum/SolutionTest.kt b/src/test/kotlin/g0001_0100/s0039_combination_sum/SolutionTest.kt
index 1088c5bb4..f5f4c0292 100644
--- a/src/test/kotlin/g0001_0100/s0039_combination_sum/SolutionTest.kt
+++ b/src/test/kotlin/g0001_0100/s0039_combination_sum/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun combinationSum() {
         assertThat(
             Solution().combinationSum(intArrayOf(2, 3, 6, 7), 7),
-            equalTo(arrayOf(intArrayOf(2, 2, 3).toList(), intArrayOf(7).toList()).toList())
+            equalTo(arrayOf(intArrayOf(2, 2, 3).toList(), intArrayOf(7).toList()).toList()),
         )
     }
 
@@ -21,9 +21,9 @@ internal class SolutionTest {
                 arrayOf(
                     intArrayOf(2, 2, 2, 2).toList(),
                     intArrayOf(2, 3, 3).toList(),
-                    intArrayOf(3, 5).toList()
-                ).toList()
-            )
+                    intArrayOf(3, 5).toList(),
+                ).toList(),
+            ),
         )
     }
 
diff --git a/src/test/kotlin/g0001_0100/s0040_combination_sum_ii/SolutionTest.kt b/src/test/kotlin/g0001_0100/s0040_combination_sum_ii/SolutionTest.kt
index eb9925c2f..f02780d28 100644
--- a/src/test/kotlin/g0001_0100/s0040_combination_sum_ii/SolutionTest.kt
+++ b/src/test/kotlin/g0001_0100/s0040_combination_sum_ii/SolutionTest.kt
@@ -11,7 +11,7 @@ internal class SolutionTest {
         val expected = arrayOf(intArrayOf(1, 1, 6), intArrayOf(1, 2, 5), intArrayOf(1, 7), intArrayOf(2, 6))
         assertThat(
             Solution().combinationSum2(intArrayOf(10, 1, 2, 7, 6, 1, 5), 8),
-            equalTo(getLists(expected))
+            equalTo(getLists(expected)),
         )
     }
 
@@ -20,7 +20,7 @@ internal class SolutionTest {
         val expected = arrayOf(intArrayOf(1, 2, 2), intArrayOf(5))
         assertThat(
             Solution().combinationSum2(intArrayOf(2, 5, 2, 1, 2), 5),
-            equalTo(getLists(expected))
+            equalTo(getLists(expected)),
         )
     }
 }
diff --git a/src/test/kotlin/g0001_0100/s0046_permutations/SolutionTest.kt b/src/test/kotlin/g0001_0100/s0046_permutations/SolutionTest.kt
index af011b685..082958a2c 100644
--- a/src/test/kotlin/g0001_0100/s0046_permutations/SolutionTest.kt
+++ b/src/test/kotlin/g0001_0100/s0046_permutations/SolutionTest.kt
@@ -14,11 +14,11 @@ internal class SolutionTest {
             intArrayOf(2, 1, 3),
             intArrayOf(2, 3, 1),
             intArrayOf(3, 1, 2),
-            intArrayOf(3, 2, 1)
+            intArrayOf(3, 2, 1),
         )
         assertThat(
             Solution().permute(intArrayOf(1, 2, 3)),
-            equalTo(getLists(expected))
+            equalTo(getLists(expected)),
         )
     }
 
@@ -26,7 +26,8 @@ internal class SolutionTest {
     fun permute2() {
         val expected = arrayOf(intArrayOf(0, 1), intArrayOf(1, 0))
         assertThat(
-            Solution().permute(intArrayOf(0, 1)), equalTo(getLists(expected))
+            Solution().permute(intArrayOf(0, 1)),
+            equalTo(getLists(expected)),
         )
     }
 
diff --git a/src/test/kotlin/g0001_0100/s0047_permutations_ii/SolutionTest.kt b/src/test/kotlin/g0001_0100/s0047_permutations_ii/SolutionTest.kt
index 520ce97b1..abd155c2d 100644
--- a/src/test/kotlin/g0001_0100/s0047_permutations_ii/SolutionTest.kt
+++ b/src/test/kotlin/g0001_0100/s0047_permutations_ii/SolutionTest.kt
@@ -11,19 +11,23 @@ internal class SolutionTest {
         val expected = arrayOf(intArrayOf(1, 1, 2), intArrayOf(1, 2, 1), intArrayOf(2, 1, 1))
         assertThat(
             Solution().permuteUnique(intArrayOf(1, 1, 2)),
-            equalTo(getLists(expected))
+            equalTo(getLists(expected)),
         )
     }
 
     @Test
     fun permuteUnique2() {
         val expected = arrayOf(
-            intArrayOf(1, 2, 3), intArrayOf(1, 3, 2), intArrayOf(2, 1, 3),
-            intArrayOf(2, 3, 1), intArrayOf(3, 2, 1), intArrayOf(3, 1, 2)
+            intArrayOf(1, 2, 3),
+            intArrayOf(1, 3, 2),
+            intArrayOf(2, 1, 3),
+            intArrayOf(2, 3, 1),
+            intArrayOf(3, 2, 1),
+            intArrayOf(3, 1, 2),
         )
         assertThat(
             Solution().permuteUnique(intArrayOf(1, 2, 3)),
-            equalTo(getLists(expected))
+            equalTo(getLists(expected)),
         )
     }
 }
diff --git a/src/test/kotlin/g0001_0100/s0048_rotate_image/SolutionTest.kt b/src/test/kotlin/g0001_0100/s0048_rotate_image/SolutionTest.kt
index 9f14b626b..0746f1ab9 100644
--- a/src/test/kotlin/g0001_0100/s0048_rotate_image/SolutionTest.kt
+++ b/src/test/kotlin/g0001_0100/s0048_rotate_image/SolutionTest.kt
@@ -11,7 +11,7 @@ internal class SolutionTest {
         val expected = arrayOf(
             intArrayOf(7, 4, 1).toTypedArray(),
             intArrayOf(8, 5, 2).toTypedArray(),
-            intArrayOf(9, 6, 3).toTypedArray()
+            intArrayOf(9, 6, 3).toTypedArray(),
         )
         Solution().rotate(matrix)
         assertThat(matrix, equalTo(expected))
@@ -23,13 +23,13 @@ internal class SolutionTest {
             intArrayOf(5, 1, 9, 11),
             intArrayOf(2, 4, 8, 10),
             intArrayOf(13, 3, 6, 7),
-            intArrayOf(15, 14, 12, 16)
+            intArrayOf(15, 14, 12, 16),
         )
         val expected = arrayOf(
             intArrayOf(15, 13, 2, 5).toTypedArray(),
             intArrayOf(14, 3, 4, 1).toTypedArray(),
             intArrayOf(12, 6, 8, 9).toTypedArray(),
-            intArrayOf(16, 7, 10, 11).toTypedArray()
+            intArrayOf(16, 7, 10, 11).toTypedArray(),
         )
         Solution().rotate(matrix)
         assertThat(matrix, equalTo(expected))
diff --git a/src/test/kotlin/g0001_0100/s0049_group_anagrams/SolutionTest.kt b/src/test/kotlin/g0001_0100/s0049_group_anagrams/SolutionTest.kt
index 93e94e978..198f865a1 100644
--- a/src/test/kotlin/g0001_0100/s0049_group_anagrams/SolutionTest.kt
+++ b/src/test/kotlin/g0001_0100/s0049_group_anagrams/SolutionTest.kt
@@ -14,8 +14,8 @@ internal class SolutionTest {
                     arrayOf("eat", "tea", "ate").toList(),
                     arrayOf("bat").toList(),
                     arrayOf("tan", "nat").toList(),
-                ).toList()
-            )
+                ).toList(),
+            ),
         )
     }
 
diff --git a/src/test/kotlin/g0001_0100/s0051_n_queens/SolutionTest.kt b/src/test/kotlin/g0001_0100/s0051_n_queens/SolutionTest.kt
index 510ab3e66..56a699b9b 100644
--- a/src/test/kotlin/g0001_0100/s0051_n_queens/SolutionTest.kt
+++ b/src/test/kotlin/g0001_0100/s0051_n_queens/SolutionTest.kt
@@ -12,9 +12,9 @@ internal class SolutionTest {
             equalTo(
                 arrayOf(
                     arrayOf(".Q..", "...Q", "Q...", "..Q.").toList(),
-                    arrayOf("..Q.", "Q...", "...Q", ".Q..").toList()
-                ).toList()
-            )
+                    arrayOf("..Q.", "Q...", "...Q", ".Q..").toList(),
+                ).toList(),
+            ),
         )
     }
 
diff --git a/src/test/kotlin/g0001_0100/s0054_spiral_matrix/SolutionTest.kt b/src/test/kotlin/g0001_0100/s0054_spiral_matrix/SolutionTest.kt
index 59570a9ac..a26a4b52a 100644
--- a/src/test/kotlin/g0001_0100/s0054_spiral_matrix/SolutionTest.kt
+++ b/src/test/kotlin/g0001_0100/s0054_spiral_matrix/SolutionTest.kt
@@ -10,8 +10,8 @@ internal class SolutionTest {
         assertThat(
             Solution().spiralOrder(arrayOf(intArrayOf(1, 2, 3), intArrayOf(4, 5, 6), intArrayOf(7, 8, 9))),
             equalTo(
-                intArrayOf(1, 2, 3, 6, 9, 8, 7, 4, 5).toList()
-            )
+                intArrayOf(1, 2, 3, 6, 9, 8, 7, 4, 5).toList(),
+            ),
         )
     }
 
@@ -20,8 +20,8 @@ internal class SolutionTest {
         assertThat(
             Solution().spiralOrder(arrayOf(intArrayOf(1, 2, 3, 4), intArrayOf(5, 6, 7, 8), intArrayOf(9, 10, 11, 12))),
             equalTo(
-                intArrayOf(1, 2, 3, 4, 8, 12, 11, 10, 9, 5, 6, 7).toList()
-            )
+                intArrayOf(1, 2, 3, 4, 8, 12, 11, 10, 9, 5, 6, 7).toList(),
+            ),
         )
     }
 }
diff --git a/src/test/kotlin/g0001_0100/s0056_merge_intervals/SolutionTest.kt b/src/test/kotlin/g0001_0100/s0056_merge_intervals/SolutionTest.kt
index e7adec72c..a60580e86 100644
--- a/src/test/kotlin/g0001_0100/s0056_merge_intervals/SolutionTest.kt
+++ b/src/test/kotlin/g0001_0100/s0056_merge_intervals/SolutionTest.kt
@@ -10,8 +10,8 @@ internal class SolutionTest {
         assertThat(
             Solution().merge(arrayOf(intArrayOf(1, 3), intArrayOf(2, 6), intArrayOf(8, 10), intArrayOf(15, 18))),
             equalTo(
-                arrayOf(intArrayOf(1, 6), intArrayOf(8, 10), intArrayOf(15, 18))
-            )
+                arrayOf(intArrayOf(1, 6), intArrayOf(8, 10), intArrayOf(15, 18)),
+            ),
         )
     }
 
@@ -20,8 +20,8 @@ internal class SolutionTest {
         assertThat(
             Solution().merge(arrayOf(intArrayOf(1, 4), intArrayOf(4, 5))),
             equalTo(
-                arrayOf(intArrayOf(1, 5))
-            )
+                arrayOf(intArrayOf(1, 5)),
+            ),
         )
     }
 }
diff --git a/src/test/kotlin/g0001_0100/s0057_insert_interval/SolutionTest.kt b/src/test/kotlin/g0001_0100/s0057_insert_interval/SolutionTest.kt
index 49b8526f9..e3758e49b 100644
--- a/src/test/kotlin/g0001_0100/s0057_insert_interval/SolutionTest.kt
+++ b/src/test/kotlin/g0001_0100/s0057_insert_interval/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun insert() {
         assertThat(
             Solution().insert(arrayOf(intArrayOf(1, 3), intArrayOf(6, 9)), intArrayOf(2, 5)),
-            equalTo(arrayOf(intArrayOf(1, 5), intArrayOf(6, 9)))
+            equalTo(arrayOf(intArrayOf(1, 5), intArrayOf(6, 9))),
         )
     }
 
@@ -19,12 +19,15 @@ internal class SolutionTest {
             Solution()
                 .insert(
                     arrayOf(
-                        intArrayOf(1, 2), intArrayOf(3, 5), intArrayOf(6, 7),
-                        intArrayOf(8, 10), intArrayOf(12, 16)
+                        intArrayOf(1, 2),
+                        intArrayOf(3, 5),
+                        intArrayOf(6, 7),
+                        intArrayOf(8, 10),
+                        intArrayOf(12, 16),
                     ),
-                    intArrayOf(4, 8)
+                    intArrayOf(4, 8),
                 ),
-            equalTo(arrayOf(intArrayOf(1, 2), intArrayOf(3, 10), intArrayOf(12, 16)))
+            equalTo(arrayOf(intArrayOf(1, 2), intArrayOf(3, 10), intArrayOf(12, 16))),
         )
     }
 }
diff --git a/src/test/kotlin/g0001_0100/s0059_spiral_matrix_ii/SolutionTest.kt b/src/test/kotlin/g0001_0100/s0059_spiral_matrix_ii/SolutionTest.kt
index 87c8d3be7..46f89a01b 100644
--- a/src/test/kotlin/g0001_0100/s0059_spiral_matrix_ii/SolutionTest.kt
+++ b/src/test/kotlin/g0001_0100/s0059_spiral_matrix_ii/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun generateMatrix() {
         assertThat(
             Solution().generateMatrix(3),
-            equalTo(arrayOf(intArrayOf(1, 2, 3), intArrayOf(8, 9, 4), intArrayOf(7, 6, 5)))
+            equalTo(arrayOf(intArrayOf(1, 2, 3), intArrayOf(8, 9, 4), intArrayOf(7, 6, 5))),
         )
     }
 
diff --git a/src/test/kotlin/g0001_0100/s0063_unique_paths_ii/SolutionTest.kt b/src/test/kotlin/g0001_0100/s0063_unique_paths_ii/SolutionTest.kt
index dacfc46ef..5677e1e5c 100644
--- a/src/test/kotlin/g0001_0100/s0063_unique_paths_ii/SolutionTest.kt
+++ b/src/test/kotlin/g0001_0100/s0063_unique_paths_ii/SolutionTest.kt
@@ -10,14 +10,15 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .uniquePathsWithObstacles(arrayOf(intArrayOf(0, 0, 0), intArrayOf(0, 1, 0), intArrayOf(0, 0, 0))),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
     @Test
     fun uniquePathsWithObstacles2() {
         assertThat(
-            Solution().uniquePathsWithObstacles(arrayOf(intArrayOf(0, 1), intArrayOf(0, 0))), equalTo(1)
+            Solution().uniquePathsWithObstacles(arrayOf(intArrayOf(0, 1), intArrayOf(0, 0))),
+            equalTo(1),
         )
     }
 }
diff --git a/src/test/kotlin/g0001_0100/s0064_minimum_path_sum/SolutionTest.kt b/src/test/kotlin/g0001_0100/s0064_minimum_path_sum/SolutionTest.kt
index 9745c8996..db27b0c34 100644
--- a/src/test/kotlin/g0001_0100/s0064_minimum_path_sum/SolutionTest.kt
+++ b/src/test/kotlin/g0001_0100/s0064_minimum_path_sum/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun minPathSum() {
         assertThat(
             Solution().minPathSum(arrayOf(intArrayOf(1, 3, 1), intArrayOf(1, 5, 1), intArrayOf(4, 2, 1))),
-            equalTo(7)
+            equalTo(7),
         )
     }
 
diff --git a/src/test/kotlin/g0001_0100/s0068_text_justification/SolutionTest.kt b/src/test/kotlin/g0001_0100/s0068_text_justification/SolutionTest.kt
index d28e1b2c1..f08f7d2d9 100644
--- a/src/test/kotlin/g0001_0100/s0068_text_justification/SolutionTest.kt
+++ b/src/test/kotlin/g0001_0100/s0068_text_justification/SolutionTest.kt
@@ -47,7 +47,7 @@ internal class SolutionTest {
             "everything",
             "else",
             "we",
-            "do"
+            "do",
         )
         val actual = Solution().fullJustify(input, 20)
         val expected: MutableList<String> = ArrayList()
diff --git a/src/test/kotlin/g0001_0100/s0074_search_a_2d_matrix/SolutionTest.kt b/src/test/kotlin/g0001_0100/s0074_search_a_2d_matrix/SolutionTest.kt
index fb801fce9..e17c09d3f 100644
--- a/src/test/kotlin/g0001_0100/s0074_search_a_2d_matrix/SolutionTest.kt
+++ b/src/test/kotlin/g0001_0100/s0074_search_a_2d_matrix/SolutionTest.kt
@@ -12,11 +12,11 @@ internal class SolutionTest {
                 arrayOf(
                     intArrayOf(1, 3, 5, 7),
                     intArrayOf(10, 11, 16, 20),
-                    intArrayOf(23, 30, 34, 60)
+                    intArrayOf(23, 30, 34, 60),
                 ),
-                3
+                3,
             ),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
@@ -27,11 +27,11 @@ internal class SolutionTest {
                 arrayOf(
                     intArrayOf(1, 3, 5, 7),
                     intArrayOf(10, 11, 16, 20),
-                    intArrayOf(23, 30, 34, 60)
+                    intArrayOf(23, 30, 34, 60),
                 ),
-                13
+                13,
             ),
-            equalTo(false)
+            equalTo(false),
         )
     }
 }
diff --git a/src/test/kotlin/g0001_0100/s0077_combinations/SolutionTest.kt b/src/test/kotlin/g0001_0100/s0077_combinations/SolutionTest.kt
index 9b10b443e..ed465ac3f 100644
--- a/src/test/kotlin/g0001_0100/s0077_combinations/SolutionTest.kt
+++ b/src/test/kotlin/g0001_0100/s0077_combinations/SolutionTest.kt
@@ -9,8 +9,12 @@ internal class SolutionTest {
     @Test
     fun combine() {
         val expected = arrayOf(
-            intArrayOf(1, 2), intArrayOf(1, 3), intArrayOf(1, 4),
-            intArrayOf(2, 3), intArrayOf(2, 4), intArrayOf(3, 4)
+            intArrayOf(1, 2),
+            intArrayOf(1, 3),
+            intArrayOf(1, 4),
+            intArrayOf(2, 3),
+            intArrayOf(2, 4),
+            intArrayOf(3, 4),
         )
         assertThat(Solution().combine(4, 2), equalTo(getLists(expected)))
     }
diff --git a/src/test/kotlin/g0001_0100/s0078_subsets/SolutionTest.kt b/src/test/kotlin/g0001_0100/s0078_subsets/SolutionTest.kt
index 1beee342e..ab27e3c23 100644
--- a/src/test/kotlin/g0001_0100/s0078_subsets/SolutionTest.kt
+++ b/src/test/kotlin/g0001_0100/s0078_subsets/SolutionTest.kt
@@ -18,9 +18,9 @@ internal class SolutionTest {
                     intArrayOf(1, 3).toList(),
                     intArrayOf(2).toList(),
                     intArrayOf(2, 3).toList(),
-                    intArrayOf(3).toList()
-                ).toList()
-            )
+                    intArrayOf(3).toList(),
+                ).toList(),
+            ),
         )
     }
 
@@ -28,7 +28,7 @@ internal class SolutionTest {
     fun subsets2() {
         assertThat(
             Solution().subsets(intArrayOf(0)),
-            equalTo(arrayOf(intArrayOf().toList(), intArrayOf(0).toList()).toList())
+            equalTo(arrayOf(intArrayOf().toList(), intArrayOf(0).toList()).toList()),
         )
     }
 }
diff --git a/src/test/kotlin/g0001_0100/s0085_maximal_rectangle/SolutionTest.kt b/src/test/kotlin/g0001_0100/s0085_maximal_rectangle/SolutionTest.kt
index f3d659116..46e2ac5c5 100644
--- a/src/test/kotlin/g0001_0100/s0085_maximal_rectangle/SolutionTest.kt
+++ b/src/test/kotlin/g0001_0100/s0085_maximal_rectangle/SolutionTest.kt
@@ -8,8 +8,10 @@ internal class SolutionTest {
     @Test
     fun maximalRectangle() {
         val array = arrayOf(
-            charArrayOf('1', '0', '1', '0', '0'), charArrayOf('1', '0', '1', '1', '1'),
-            charArrayOf('1', '1', '1', '1', '1'), charArrayOf('1', '0', '0', '1', '0')
+            charArrayOf('1', '0', '1', '0', '0'),
+            charArrayOf('1', '0', '1', '1', '1'),
+            charArrayOf('1', '1', '1', '1', '1'),
+            charArrayOf('1', '0', '0', '1', '0'),
         )
         assertThat(Solution().maximalRectangle(array), equalTo(6))
     }
diff --git a/src/test/kotlin/g0001_0100/s0090_subsets_ii/SolutionTest.kt b/src/test/kotlin/g0001_0100/s0090_subsets_ii/SolutionTest.kt
index 2def26ec9..eb907b53b 100644
--- a/src/test/kotlin/g0001_0100/s0090_subsets_ii/SolutionTest.kt
+++ b/src/test/kotlin/g0001_0100/s0090_subsets_ii/SolutionTest.kt
@@ -9,12 +9,16 @@ internal class SolutionTest {
     @Test
     fun subsetsWithDup() {
         val expected = arrayOf(
-            intArrayOf(1), intArrayOf(1, 2), intArrayOf(1, 2, 2),
-            intArrayOf(2), intArrayOf(2, 2), intArrayOf()
+            intArrayOf(1),
+            intArrayOf(1, 2),
+            intArrayOf(1, 2, 2),
+            intArrayOf(2),
+            intArrayOf(2, 2),
+            intArrayOf(),
         )
         assertThat(
             Solution().subsetsWithDup(intArrayOf(1, 2, 2)),
-            equalTo(getLists(expected))
+            equalTo(getLists(expected)),
         )
     }
 
@@ -23,7 +27,7 @@ internal class SolutionTest {
         val expected = arrayOf(intArrayOf(0), intArrayOf())
         assertThat(
             Solution().subsetsWithDup(intArrayOf(0)),
-            equalTo(getLists(expected))
+            equalTo(getLists(expected)),
         )
     }
 }
diff --git a/src/test/kotlin/g0001_0100/s0093_restore_ip_addresses/SolutionTest.kt b/src/test/kotlin/g0001_0100/s0093_restore_ip_addresses/SolutionTest.kt
index c1e46b3dc..74b609659 100644
--- a/src/test/kotlin/g0001_0100/s0093_restore_ip_addresses/SolutionTest.kt
+++ b/src/test/kotlin/g0001_0100/s0093_restore_ip_addresses/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun restoreIpAddresses() {
         assertThat(
             Solution().restoreIpAddresses("25525511135").toString(),
-            equalTo("[255.255.11.135, 255.255.111.35]")
+            equalTo("[255.255.11.135, 255.255.111.35]"),
         )
     }
 
@@ -22,7 +22,7 @@ internal class SolutionTest {
     fun restoreIpAddresses3() {
         assertThat(
             Solution().restoreIpAddresses("101023").toString(),
-            equalTo("[1.0.10.23, 1.0.102.3, 10.1.0.23, 10.10.2.3, 101.0.2.3]")
+            equalTo("[1.0.10.23, 1.0.102.3, 10.1.0.23, 10.10.2.3, 101.0.2.3]"),
         )
     }
 }
diff --git a/src/test/kotlin/g0001_0100/s0095_unique_binary_search_trees_ii/SolutionTest.kt b/src/test/kotlin/g0001_0100/s0095_unique_binary_search_trees_ii/SolutionTest.kt
index a012f7af0..1446fad34 100644
--- a/src/test/kotlin/g0001_0100/s0095_unique_binary_search_trees_ii/SolutionTest.kt
+++ b/src/test/kotlin/g0001_0100/s0095_unique_binary_search_trees_ii/SolutionTest.kt
@@ -10,8 +10,8 @@ internal class SolutionTest {
         assertThat(
             Solution().generateTrees(3).toString(),
             equalTo(
-                "[3,2,1,null,null, 2,1,3, 3,1,null,2,null, 1,null,3,2,null, 1,null,2,null,3]"
-            )
+                "[3,2,1,null,null, 2,1,3, 3,1,null,2,null, 1,null,3,2,null, 1,null,2,null,3]",
+            ),
         )
     }
 
diff --git a/src/test/kotlin/g0101_0200/s0102_binary_tree_level_order_traversal/SolutionTest.kt b/src/test/kotlin/g0101_0200/s0102_binary_tree_level_order_traversal/SolutionTest.kt
index 57cbca011..eeb5b8c8d 100644
--- a/src/test/kotlin/g0101_0200/s0102_binary_tree_level_order_traversal/SolutionTest.kt
+++ b/src/test/kotlin/g0101_0200/s0102_binary_tree_level_order_traversal/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
     fun levelOrder() {
         assertThat(
             Solution().levelOrder(TreeNode.create(listOf(3, 9, 20, null, null, 15, 7))),
-            equalTo(listOf(listOf(3), listOf(9, 20), listOf(15, 7)))
+            equalTo(listOf(listOf(3), listOf(9, 20), listOf(15, 7))),
         )
     }
 
diff --git a/src/test/kotlin/g0101_0200/s0103_binary_tree_zigzag_level_order_traversal/SolutionTest.kt b/src/test/kotlin/g0101_0200/s0103_binary_tree_zigzag_level_order_traversal/SolutionTest.kt
index 478b1a25b..2d7f93508 100644
--- a/src/test/kotlin/g0101_0200/s0103_binary_tree_zigzag_level_order_traversal/SolutionTest.kt
+++ b/src/test/kotlin/g0101_0200/s0103_binary_tree_zigzag_level_order_traversal/SolutionTest.kt
@@ -12,7 +12,7 @@ internal class SolutionTest {
         val root: TreeNode = TreeNode.create(arrayListOf(3, 9, 20, null, null, 15, 7))!!
         assertThat(
             Solution().zigzagLevelOrder(root),
-            equalTo(getLists(arrayOf(intArrayOf(3), intArrayOf(20, 9), intArrayOf(15, 7))))
+            equalTo(getLists(arrayOf(intArrayOf(3), intArrayOf(20, 9), intArrayOf(15, 7)))),
         )
     }
 
@@ -21,7 +21,7 @@ internal class SolutionTest {
         val root: TreeNode = TreeNode.create(arrayListOf(1))!!
         assertThat(
             Solution().zigzagLevelOrder(root),
-            equalTo(getLists(arrayOf(intArrayOf(1))))
+            equalTo(getLists(arrayOf(intArrayOf(1)))),
         )
     }
 
@@ -29,7 +29,7 @@ internal class SolutionTest {
     fun zigzagLevelOrder3() {
         assertThat(
             Solution().zigzagLevelOrder(null),
-            equalTo(getLists(arrayOf<IntArray>()))
+            equalTo(getLists(arrayOf<IntArray>())),
         )
     }
 }
diff --git a/src/test/kotlin/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/SolutionTest.kt b/src/test/kotlin/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/SolutionTest.kt
index 3c8f2cf0a..2a01041c4 100644
--- a/src/test/kotlin/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/SolutionTest.kt
+++ b/src/test/kotlin/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/SolutionTest.kt
@@ -12,9 +12,9 @@ internal class SolutionTest {
             Solution().buildTree(intArrayOf(3, 9, 20, 15, 7), intArrayOf(9, 3, 15, 20, 7)).toString(),
             equalTo(
                 TreeNode.create(
-                    listOf(3, 9, 20, null, null, 15, 7)
-                ).toString()
-            )
+                    listOf(3, 9, 20, null, null, 15, 7),
+                ).toString(),
+            ),
         )
     }
 
@@ -24,9 +24,9 @@ internal class SolutionTest {
             Solution().buildTree(intArrayOf(-1), intArrayOf(-1)).toString(),
             equalTo(
                 TreeNode.create(
-                    listOf(-1)
-                ).toString()
-            )
+                    listOf(-1),
+                ).toString(),
+            ),
         )
     }
 }
diff --git a/src/test/kotlin/g0101_0200/s0107_binary_tree_level_order_traversal_ii/SolutionTest.kt b/src/test/kotlin/g0101_0200/s0107_binary_tree_level_order_traversal_ii/SolutionTest.kt
index f016842bf..f51b1356e 100644
--- a/src/test/kotlin/g0101_0200/s0107_binary_tree_level_order_traversal_ii/SolutionTest.kt
+++ b/src/test/kotlin/g0101_0200/s0107_binary_tree_level_order_traversal_ii/SolutionTest.kt
@@ -12,7 +12,7 @@ internal class SolutionTest {
         val root: TreeNode? = TreeNode.create(listOf(3, 9, 20, null, null, 15, 7))
         assertThat(
             Solution().levelOrderBottom(root),
-            equalTo(getLists(arrayOf(intArrayOf(15, 7), intArrayOf(9, 20), intArrayOf(3))))
+            equalTo(getLists(arrayOf(intArrayOf(15, 7), intArrayOf(9, 20), intArrayOf(3)))),
         )
     }
 
@@ -21,7 +21,7 @@ internal class SolutionTest {
         val root: TreeNode? = TreeNode.create(listOf(1))
         assertThat(
             Solution().levelOrderBottom(root),
-            equalTo(getLists(arrayOf(intArrayOf(1))))
+            equalTo(getLists(arrayOf(intArrayOf(1)))),
         )
     }
 
@@ -29,7 +29,7 @@ internal class SolutionTest {
     fun levelOrderBottom3() {
         assertThat(
             Solution().levelOrderBottom(null),
-            equalTo(getLists(arrayOf<IntArray>()))
+            equalTo(getLists(arrayOf<IntArray>())),
         )
     }
 }
diff --git a/src/test/kotlin/g0101_0200/s0108_convert_sorted_array_to_binary_search_tree/SolutionTest.kt b/src/test/kotlin/g0101_0200/s0108_convert_sorted_array_to_binary_search_tree/SolutionTest.kt
index ca46bdacb..e56791143 100644
--- a/src/test/kotlin/g0101_0200/s0108_convert_sorted_array_to_binary_search_tree/SolutionTest.kt
+++ b/src/test/kotlin/g0101_0200/s0108_convert_sorted_array_to_binary_search_tree/SolutionTest.kt
@@ -9,14 +9,15 @@ internal class SolutionTest {
     fun sortedArrayToBST() {
         assertThat(
             Solution().sortedArrayToBST(intArrayOf(-10, -3, 0, 5, 9)).toString(),
-            equalTo("0,-10,null,-3,5,null,9")
+            equalTo("0,-10,null,-3,5,null,9"),
         )
     }
 
     @Test
     fun sortedArrayToBST2() {
         assertThat(
-            Solution().sortedArrayToBST(intArrayOf(1, 3)).toString(), equalTo("1,null,3")
+            Solution().sortedArrayToBST(intArrayOf(1, 3)).toString(),
+            equalTo("1,null,3"),
         )
     }
 }
diff --git a/src/test/kotlin/g0101_0200/s0109_convert_sorted_list_to_binary_search_tree/SolutionTest.kt b/src/test/kotlin/g0101_0200/s0109_convert_sorted_list_to_binary_search_tree/SolutionTest.kt
index 31c3340da..82426d48d 100644
--- a/src/test/kotlin/g0101_0200/s0109_convert_sorted_list_to_binary_search_tree/SolutionTest.kt
+++ b/src/test/kotlin/g0101_0200/s0109_convert_sorted_list_to_binary_search_tree/SolutionTest.kt
@@ -9,11 +9,12 @@ internal class SolutionTest {
     @Test
     fun convertSortedListToBST() {
         val nodes = ListNode(
-            -10, ListNode(-3, ListNode(0, ListNode(5, ListNode(9))))
+            -10,
+            ListNode(-3, ListNode(0, ListNode(5, ListNode(9)))),
         )
         assertThat(
             Solution().sortedListToBST(nodes).toString(),
-            equalTo("0,-3,-10,null,9,5,null")
+            equalTo("0,-3,-10,null,9,5,null"),
         )
     }
 
diff --git a/src/test/kotlin/g0101_0200/s0112_path_sum/SolutionTest.kt b/src/test/kotlin/g0101_0200/s0112_path_sum/SolutionTest.kt
index 63610cd53..854464dd0 100644
--- a/src/test/kotlin/g0101_0200/s0112_path_sum/SolutionTest.kt
+++ b/src/test/kotlin/g0101_0200/s0112_path_sum/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     @Test
     fun hasPathSum() {
         val root: TreeNode? = TreeNode.create(
-            listOf(5, 4, 8, 11, null, 13, 4, 7, 2, null, null, null, 1)
+            listOf(5, 4, 8, 11, null, 13, 4, 7, 2, null, null, null, 1),
         )
         assertThat(Solution().hasPathSum(root, 22), equalTo(true))
     }
diff --git a/src/test/kotlin/g0101_0200/s0113_path_sum_ii/SolutionTest.kt b/src/test/kotlin/g0101_0200/s0113_path_sum_ii/SolutionTest.kt
index 9b96c9e2b..45e241a8b 100644
--- a/src/test/kotlin/g0101_0200/s0113_path_sum_ii/SolutionTest.kt
+++ b/src/test/kotlin/g0101_0200/s0113_path_sum_ii/SolutionTest.kt
@@ -10,11 +10,11 @@ internal class SolutionTest {
     @Test
     fun pathSum() {
         val root: TreeNode? = TreeNode.create(
-            listOf(5, 4, 8, 11, null, 13, 4, 7, 2, null, null, 5, 1)
+            listOf(5, 4, 8, 11, null, 13, 4, 7, 2, null, null, 5, 1),
         )
         assertThat(
             Solution().pathSum(root, 22),
-            equalTo(getLists(arrayOf(intArrayOf(5, 4, 11, 2), intArrayOf(5, 8, 4, 5))))
+            equalTo(getLists(arrayOf(intArrayOf(5, 4, 11, 2), intArrayOf(5, 8, 4, 5)))),
         )
     }
 
diff --git a/src/test/kotlin/g0101_0200/s0116_populating_next_right_pointers_in_each_node/SolutionTest.kt b/src/test/kotlin/g0101_0200/s0116_populating_next_right_pointers_in_each_node/SolutionTest.kt
index 0e8b2578a..bd36d5a12 100644
--- a/src/test/kotlin/g0101_0200/s0116_populating_next_right_pointers_in_each_node/SolutionTest.kt
+++ b/src/test/kotlin/g0101_0200/s0116_populating_next_right_pointers_in_each_node/SolutionTest.kt
@@ -17,7 +17,7 @@ internal class SolutionTest {
             1,
             Node(2, Node(4), Node(5), null),
             Node(3, Node(6), Node(7), null),
-            null
+            null,
         )
         val node7 = Node(7)
         val node6 = Node(6, null, null, node7)
diff --git a/src/test/kotlin/g0101_0200/s0117_populating_next_right_pointers_in_each_node_ii/SolutionTest.kt b/src/test/kotlin/g0101_0200/s0117_populating_next_right_pointers_in_each_node_ii/SolutionTest.kt
index 7e03a58f0..a5abb3b40 100644
--- a/src/test/kotlin/g0101_0200/s0117_populating_next_right_pointers_in_each_node_ii/SolutionTest.kt
+++ b/src/test/kotlin/g0101_0200/s0117_populating_next_right_pointers_in_each_node_ii/SolutionTest.kt
@@ -17,7 +17,7 @@ internal class SolutionTest {
             1,
             Node(2, Node(4), Node(5), null),
             Node(3, null, Node(7), null),
-            null
+            null,
         )
         val node7 = Node(7)
         val node3 = Node(3, null, node7, null)
@@ -34,7 +34,7 @@ internal class SolutionTest {
             1,
             Node(2, Node(4, Node(7), null, null), Node(5), null),
             Node(3, null, Node(6, null, Node(8), null), null),
-            null
+            null,
         )
         val node8 = Node(8, null, null, null)
         val node7 = Node(7, null, null, node8)
diff --git a/src/test/kotlin/g0101_0200/s0118_pascals_triangle/SolutionTest.kt b/src/test/kotlin/g0101_0200/s0118_pascals_triangle/SolutionTest.kt
index 5449306a5..10407d20e 100644
--- a/src/test/kotlin/g0101_0200/s0118_pascals_triangle/SolutionTest.kt
+++ b/src/test/kotlin/g0101_0200/s0118_pascals_triangle/SolutionTest.kt
@@ -14,8 +14,8 @@ internal class SolutionTest {
                 intArrayOf(1, 1),
                 intArrayOf(1, 2, 1),
                 intArrayOf(1, 3, 3, 1),
-                intArrayOf(1, 4, 6, 4, 1)
-            )
+                intArrayOf(1, 4, 6, 4, 1),
+            ),
         )
         assertThat(Solution().generate(5), equalTo(expected))
     }
diff --git a/src/test/kotlin/g0101_0200/s0126_word_ladder_ii/SolutionTest.kt b/src/test/kotlin/g0101_0200/s0126_word_ladder_ii/SolutionTest.kt
index 0b5517c44..1e05aec16 100644
--- a/src/test/kotlin/g0101_0200/s0126_word_ladder_ii/SolutionTest.kt
+++ b/src/test/kotlin/g0101_0200/s0126_word_ladder_ii/SolutionTest.kt
@@ -13,16 +13,16 @@ internal class SolutionTest {
                 .findLadders(
                     "hit",
                     "cog",
-                    listOf("hot", "dot", "dog", "lot", "log", "cog")
+                    listOf("hot", "dot", "dog", "lot", "log", "cog"),
                 ),
             equalTo(
                 ArrayUtils.getLists(
                     arrayOf(
                         arrayOf("hit", "hot", "lot", "log", "cog"),
-                        arrayOf("hit", "hot", "dot", "dog", "cog")
-                    )
-                )
-            )
+                        arrayOf("hit", "hot", "dot", "dog", "cog"),
+                    ),
+                ),
+            ),
         )
     }
 
@@ -31,9 +31,11 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .findLadders(
-                    "hit", "cog", listOf("hot", "dot", "dog", "lot", "log")
+                    "hit",
+                    "cog",
+                    listOf("hot", "dot", "dog", "lot", "log"),
                 ),
-            equalTo(ArrayUtils.getLists(arrayOf<Array<String>>()))
+            equalTo(ArrayUtils.getLists(arrayOf<Array<String>>())),
         )
     }
 }
diff --git a/src/test/kotlin/g0101_0200/s0127_word_ladder/SolutionTest.kt b/src/test/kotlin/g0101_0200/s0127_word_ladder/SolutionTest.kt
index 79faf027c..602005c8e 100644
--- a/src/test/kotlin/g0101_0200/s0127_word_ladder/SolutionTest.kt
+++ b/src/test/kotlin/g0101_0200/s0127_word_ladder/SolutionTest.kt
@@ -12,9 +12,9 @@ internal class SolutionTest {
                 .ladderLength(
                     "hit",
                     "cog",
-                    listOf("hot", "dot", "dog", "lot", "log", "cog")
+                    listOf("hot", "dot", "dog", "lot", "log", "cog"),
                 ),
-            equalTo(5)
+            equalTo(5),
         )
     }
 
@@ -23,9 +23,11 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .ladderLength(
-                    "hit", "cog", listOf("hot", "dot", "dog", "lot", "log")
+                    "hit",
+                    "cog",
+                    listOf("hot", "dot", "dog", "lot", "log"),
                 ),
-            equalTo(0)
+            equalTo(0),
         )
     }
 }
diff --git a/src/test/kotlin/g0101_0200/s0130_surrounded_regions/SolutionTest.kt b/src/test/kotlin/g0101_0200/s0130_surrounded_regions/SolutionTest.kt
index 004e94b9e..731312d31 100644
--- a/src/test/kotlin/g0101_0200/s0130_surrounded_regions/SolutionTest.kt
+++ b/src/test/kotlin/g0101_0200/s0130_surrounded_regions/SolutionTest.kt
@@ -11,7 +11,7 @@ internal class SolutionTest {
             charArrayOf('X', 'X', 'X', 'X'),
             charArrayOf('X', 'O', 'O', 'X'),
             charArrayOf('X', 'X', 'O', 'X'),
-            charArrayOf('X', 'O', 'X', 'X')
+            charArrayOf('X', 'O', 'X', 'X'),
         )
         Solution().solve(board)
         assertThat(
@@ -21,9 +21,9 @@ internal class SolutionTest {
                     charArrayOf('X', 'X', 'X', 'X'),
                     charArrayOf('X', 'X', 'X', 'X'),
                     charArrayOf('X', 'X', 'X', 'X'),
-                    charArrayOf('X', 'O', 'X', 'X')
-                )
-            )
+                    charArrayOf('X', 'O', 'X', 'X'),
+                ),
+            ),
         )
     }
 
diff --git a/src/test/kotlin/g0101_0200/s0133_clone_graph/SolutionTest.kt b/src/test/kotlin/g0101_0200/s0133_clone_graph/SolutionTest.kt
index bc6b7c581..ab692bb7b 100644
--- a/src/test/kotlin/g0101_0200/s0133_clone_graph/SolutionTest.kt
+++ b/src/test/kotlin/g0101_0200/s0133_clone_graph/SolutionTest.kt
@@ -18,10 +18,11 @@ internal class SolutionTest {
         val node4and1and3 = Node(4, listOf(node1, node3))
         val node = Node(
             5,
-            listOf(node1and2and4, node2and1and3, node3and2and4, node4and1and3)
+            listOf(node1and2and4, node2and1and3, node3and2and4, node4and1and3),
         )
         assertThat(
-            Solution().cloneGraph(node).toString(), equalTo("[[2,4],[1,3],[2,4],[1,3]]")
+            Solution().cloneGraph(node).toString(),
+            equalTo("[[2,4],[1,3],[2,4],[1,3]]"),
         )
     }
 
diff --git a/src/test/kotlin/g0101_0200/s0134_gas_station/SolutionTest.kt b/src/test/kotlin/g0101_0200/s0134_gas_station/SolutionTest.kt
index a95802967..d100493b0 100644
--- a/src/test/kotlin/g0101_0200/s0134_gas_station/SolutionTest.kt
+++ b/src/test/kotlin/g0101_0200/s0134_gas_station/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .canCompleteCircuit(intArrayOf(1, 2, 3, 4, 5), intArrayOf(3, 4, 5, 1, 2)),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
@@ -18,7 +18,7 @@ internal class SolutionTest {
     fun canCompleteCircuit2() {
         assertThat(
             Solution().canCompleteCircuit(intArrayOf(2, 3, 4), intArrayOf(3, 4, 3)),
-            equalTo(-1)
+            equalTo(-1),
         )
     }
 }
diff --git a/src/test/kotlin/g0101_0200/s0140_word_break_ii/SolutionTest.kt b/src/test/kotlin/g0101_0200/s0140_word_break_ii/SolutionTest.kt
index 9866c2e11..e31e6cb4a 100644
--- a/src/test/kotlin/g0101_0200/s0140_word_break_ii/SolutionTest.kt
+++ b/src/test/kotlin/g0101_0200/s0140_word_break_ii/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         val wordDict = listOf("cat", "cats", "and", "sand", "dog")
         assertThat(
             Solution().wordBreak("catsanddog", wordDict),
-            equalTo(listOf("cat sand dog", "cats and dog"))
+            equalTo(listOf("cat sand dog", "cats and dog")),
         )
     }
 
@@ -23,9 +23,9 @@ internal class SolutionTest {
                 listOf(
                     "pine apple pen apple",
                     "pine applepen apple",
-                    "pineapple pen apple"
-                )
-            )
+                    "pineapple pen apple",
+                ),
+            ),
         )
     }
 
@@ -33,7 +33,8 @@ internal class SolutionTest {
     fun wordBreak3() {
         val wordDict = listOf("cats", "dog", "sand", "and", "cat")
         assertThat(
-            Solution().wordBreak("catsandog", wordDict), equalTo(emptyList())
+            Solution().wordBreak("catsandog", wordDict),
+            equalTo(emptyList()),
         )
     }
 }
diff --git a/src/test/kotlin/g0101_0200/s0144_binary_tree_preorder_traversal/SolutionTest.kt b/src/test/kotlin/g0101_0200/s0144_binary_tree_preorder_traversal/SolutionTest.kt
index a19bc633e..4a37465a9 100644
--- a/src/test/kotlin/g0101_0200/s0144_binary_tree_preorder_traversal/SolutionTest.kt
+++ b/src/test/kotlin/g0101_0200/s0144_binary_tree_preorder_traversal/SolutionTest.kt
@@ -23,7 +23,7 @@ internal class SolutionTest {
     fun preorderTraversal3() {
         assertThat(
             Solution().preorderTraversal(TreeNode(1)),
-            equalTo(listOf(1))
+            equalTo(listOf(1)),
         )
     }
 }
diff --git a/src/test/kotlin/g0101_0200/s0145_binary_tree_postorder_traversal/SolutionTest.kt b/src/test/kotlin/g0101_0200/s0145_binary_tree_postorder_traversal/SolutionTest.kt
index aa8c9e16a..7468ba53c 100644
--- a/src/test/kotlin/g0101_0200/s0145_binary_tree_postorder_traversal/SolutionTest.kt
+++ b/src/test/kotlin/g0101_0200/s0145_binary_tree_postorder_traversal/SolutionTest.kt
@@ -23,7 +23,7 @@ internal class SolutionTest {
     fun postorderTraversal3() {
         assertThat(
             Solution().postorderTraversal(TreeNode(1)),
-            equalTo(listOf(1))
+            equalTo(listOf(1)),
         )
     }
 }
diff --git a/src/test/kotlin/g0101_0200/s0147_insertion_sort_list/SolutionTest.kt b/src/test/kotlin/g0101_0200/s0147_insertion_sort_list/SolutionTest.kt
index ba8ea41fb..d0ac4ec8c 100644
--- a/src/test/kotlin/g0101_0200/s0147_insertion_sort_list/SolutionTest.kt
+++ b/src/test/kotlin/g0101_0200/s0147_insertion_sort_list/SolutionTest.kt
@@ -23,7 +23,8 @@ internal class SolutionTest {
         listNode1.next!!.next!!.next = ListNode(4)
         listNode1.next!!.next!!.next!!.next = ListNode(0)
         assertThat(
-            Solution().insertionSortList(listNode1).toString(), equalTo("-1, 0, 3, 4, 5")
+            Solution().insertionSortList(listNode1).toString(),
+            equalTo("-1, 0, 3, 4, 5"),
         )
     }
 }
diff --git a/src/test/kotlin/g0101_0200/s0149_max_points_on_a_line/SolutionTest.kt b/src/test/kotlin/g0101_0200/s0149_max_points_on_a_line/SolutionTest.kt
index 35e7e6292..5ac5e3cc8 100644
--- a/src/test/kotlin/g0101_0200/s0149_max_points_on_a_line/SolutionTest.kt
+++ b/src/test/kotlin/g0101_0200/s0149_max_points_on_a_line/SolutionTest.kt
@@ -19,7 +19,7 @@ internal class SolutionTest {
             intArrayOf(5, 3),
             intArrayOf(4, 1),
             intArrayOf(2, 3),
-            intArrayOf(1, 4)
+            intArrayOf(1, 4),
         )
         assertThat(Solution().maxPoints(input), equalTo(4))
     }
diff --git a/src/test/kotlin/g0101_0200/s0150_evaluate_reverse_polish_notation/SolutionTest.kt b/src/test/kotlin/g0101_0200/s0150_evaluate_reverse_polish_notation/SolutionTest.kt
index 6dfe1f411..cb5904128 100644
--- a/src/test/kotlin/g0101_0200/s0150_evaluate_reverse_polish_notation/SolutionTest.kt
+++ b/src/test/kotlin/g0101_0200/s0150_evaluate_reverse_polish_notation/SolutionTest.kt
@@ -22,10 +22,10 @@ internal class SolutionTest {
                 .evalRPN(
                     arrayOf(
                         "10", "6", "9", "3", "+", "-11", "*", "/", "*", "17", "+", "5",
-                        "+"
-                    )
+                        "+",
+                    ),
                 ),
-            equalTo(22)
+            equalTo(22),
         )
     }
 }
diff --git a/src/test/kotlin/g0101_0200/s0175_combine_two_tables/MysqlTest.kt b/src/test/kotlin/g0101_0200/s0175_combine_two_tables/MysqlTest.kt
index 6381b2e39..2873c70da 100644
--- a/src/test/kotlin/g0101_0200/s0175_combine_two_tables/MysqlTest.kt
+++ b/src/test/kotlin/g0101_0200/s0175_combine_two_tables/MysqlTest.kt
@@ -27,8 +27,8 @@ import javax.sql.DataSource
             "INSERT INTO Address(addressId, personId, city, state)" +
             " VALUES (1, 2, 'New York City', 'New York'); " +
             "INSERT INTO Address(addressId, personId, city, state)" +
-            " VALUES (2, 3, 'Leetcode', 'California'); "
-    ]
+            " VALUES (2, 3, 'Leetcode', 'California'); ",
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -39,12 +39,12 @@ internal class MysqlTest {
                 statement.executeQuery(
                     BufferedReader(
                         FileReader(
-                            "src/main/kotlin/g0101_0200/s0175_combine_two_tables/script.sql"
-                        )
+                            "src/main/kotlin/g0101_0200/s0175_combine_two_tables/script.sql",
+                        ),
                     )
                         .lines()
                         .collect(Collectors.joining("\n"))
-                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace("#.*?\\r?\\n".toRegex(), ""),
                 ).use { resultSet ->
                     assertThat(resultSet.next(), equalTo(true))
                     assertThat(resultSet.getNString(1), equalTo("Allen"))
diff --git a/src/test/kotlin/g0101_0200/s0176_second_highest_salary/MysqlTest.kt b/src/test/kotlin/g0101_0200/s0176_second_highest_salary/MysqlTest.kt
index f267d4711..a2c3183d1 100644
--- a/src/test/kotlin/g0101_0200/s0176_second_highest_salary/MysqlTest.kt
+++ b/src/test/kotlin/g0101_0200/s0176_second_highest_salary/MysqlTest.kt
@@ -19,8 +19,8 @@ import javax.sql.DataSource
         "CREATE TABLE Employee(id INTEGER PRIMARY KEY, salary INTEGER); " +
             "INSERT INTO Employee(id, salary) VALUES (1, 100); " +
             "INSERT INTO Employee(id, salary) VALUES (2, 200); " +
-            "INSERT INTO Employee(id, salary) VALUES (3, 300); "
-    ]
+            "INSERT INTO Employee(id, salary) VALUES (3, 300); ",
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -31,12 +31,12 @@ internal class MysqlTest {
                 statement.executeQuery(
                     BufferedReader(
                         FileReader(
-                            "src/main/kotlin/g0101_0200/s0176_second_highest_salary/script.sql"
-                        )
+                            "src/main/kotlin/g0101_0200/s0176_second_highest_salary/script.sql",
+                        ),
                     )
                         .lines()
                         .collect(Collectors.joining("\n"))
-                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace("#.*?\\r?\\n".toRegex(), ""),
                 ).use { resultSet ->
                     assertThat(resultSet.next(), equalTo(true))
                     assertThat(resultSet.getInt(1), equalTo(200))
diff --git a/src/test/kotlin/g0101_0200/s0178_rank_scores/MysqlTest.kt b/src/test/kotlin/g0101_0200/s0178_rank_scores/MysqlTest.kt
index 7bda22a1a..29e470161 100644
--- a/src/test/kotlin/g0101_0200/s0178_rank_scores/MysqlTest.kt
+++ b/src/test/kotlin/g0101_0200/s0178_rank_scores/MysqlTest.kt
@@ -22,8 +22,8 @@ import javax.sql.DataSource
             "INSERT INTO Scores(id, score) VALUES (3, 4.00); " +
             "INSERT INTO Scores(id, score) VALUES (4, 3.85); " +
             "INSERT INTO Scores(id, score) VALUES (5, 4.00); " +
-            "INSERT INTO Scores(id, score) VALUES (6, 3.65); "
-    ]
+            "INSERT INTO Scores(id, score) VALUES (6, 3.65); ",
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -34,12 +34,12 @@ internal class MysqlTest {
                 statement.executeQuery(
                     BufferedReader(
                         FileReader(
-                            "src/main/kotlin/g0101_0200/s0178_rank_scores/script.sql"
-                        )
+                            "src/main/kotlin/g0101_0200/s0178_rank_scores/script.sql",
+                        ),
                     )
                         .lines()
                         .collect(Collectors.joining("\n"))
-                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace("#.*?\\r?\\n".toRegex(), ""),
                 ).use { resultSet ->
                     assertThat(resultSet.next(), equalTo(true))
                     assertThat(resultSet.getDouble(1), equalTo(4.0))
diff --git a/src/test/kotlin/g0101_0200/s0180_consecutive_numbers/MysqlTest.kt b/src/test/kotlin/g0101_0200/s0180_consecutive_numbers/MysqlTest.kt
index bb624be5b..28f175fa8 100644
--- a/src/test/kotlin/g0101_0200/s0180_consecutive_numbers/MysqlTest.kt
+++ b/src/test/kotlin/g0101_0200/s0180_consecutive_numbers/MysqlTest.kt
@@ -23,8 +23,8 @@ import javax.sql.DataSource
             "INSERT INTO Logs(id, num) VALUES (4, 2); " +
             "INSERT INTO Logs(id, num) VALUES (5, 1); " +
             "INSERT INTO Logs(id, num) VALUES (6, 2); " +
-            "INSERT INTO Logs(id, num) VALUES (7, 2); "
-    ]
+            "INSERT INTO Logs(id, num) VALUES (7, 2); ",
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -35,12 +35,12 @@ internal class MysqlTest {
                 statement.executeQuery(
                     BufferedReader(
                         FileReader(
-                            "src/main/kotlin/g0101_0200/s0180_consecutive_numbers/script.sql"
-                        )
+                            "src/main/kotlin/g0101_0200/s0180_consecutive_numbers/script.sql",
+                        ),
                     )
                         .lines()
                         .collect(joining("\n"))
-                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace("#.*?\\r?\\n".toRegex(), ""),
                 ).use { resultSet ->
                     assertThat(resultSet.next(), equalTo(true))
                     assertThat(resultSet.getInt(1), equalTo(1))
diff --git a/src/test/kotlin/g0101_0200/s0181_employees_earning_more_than_their_managers/MysqlTest.kt b/src/test/kotlin/g0101_0200/s0181_employees_earning_more_than_their_managers/MysqlTest.kt
index 5ed0c3657..1e276c28d 100644
--- a/src/test/kotlin/g0101_0200/s0181_employees_earning_more_than_their_managers/MysqlTest.kt
+++ b/src/test/kotlin/g0101_0200/s0181_employees_earning_more_than_their_managers/MysqlTest.kt
@@ -21,8 +21,8 @@ import javax.sql.DataSource
             "INSERT INTO Employee(id, name, salary, managerId) VALUES (1, 'Joe', 70000, 3); " +
             "INSERT INTO Employee(id, name, salary, managerId) VALUES (2, 'Henry', 80000, 4); " +
             "INSERT INTO Employee(id, name, salary, managerId) VALUES (3, 'Sam', 60000, NULL); " +
-            "INSERT INTO Employee(id, name, salary, managerId) VALUES (4, 'Max', 90000, NULL); "
-    ]
+            "INSERT INTO Employee(id, name, salary, managerId) VALUES (4, 'Max', 90000, NULL); ",
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -33,12 +33,12 @@ internal class MysqlTest {
                 statement.executeQuery(
                     BufferedReader(
                         FileReader(
-                            "src/main/kotlin/g0101_0200/s0181_employees_earning_more_than_their_managers/script.sql"
-                        )
+                            "src/main/kotlin/g0101_0200/s0181_employees_earning_more_than_their_managers/script.sql",
+                        ),
                     )
                         .lines()
                         .collect(joining("\n"))
-                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace("#.*?\\r?\\n".toRegex(), ""),
                 ).use { resultSet ->
                     assertThat(resultSet.next(), equalTo(true))
                     assertThat(resultSet.getNString(1), equalTo("Joe"))
diff --git a/src/test/kotlin/g0101_0200/s0182_duplicate_emails/MysqlTest.kt b/src/test/kotlin/g0101_0200/s0182_duplicate_emails/MysqlTest.kt
index 05ef46592..5f9d425f0 100644
--- a/src/test/kotlin/g0101_0200/s0182_duplicate_emails/MysqlTest.kt
+++ b/src/test/kotlin/g0101_0200/s0182_duplicate_emails/MysqlTest.kt
@@ -19,8 +19,8 @@ import javax.sql.DataSource
         "CREATE TABLE Person(id INTEGER PRIMARY KEY, email VARCHAR); " +
             "INSERT INTO Person(id, email) VALUES (1, 'a@b.com'); " +
             "INSERT INTO Person(id, email) VALUES (2, 'c@d.com'); " +
-            "INSERT INTO Person(id, email) VALUES (3, 'a@b.com'); "
-    ]
+            "INSERT INTO Person(id, email) VALUES (3, 'a@b.com'); ",
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -31,12 +31,12 @@ internal class MysqlTest {
                 statement.executeQuery(
                     BufferedReader(
                         FileReader(
-                            "src/main/kotlin/g0101_0200/s0182_duplicate_emails/script.sql"
-                        )
+                            "src/main/kotlin/g0101_0200/s0182_duplicate_emails/script.sql",
+                        ),
                     )
                         .lines()
                         .collect(joining("\n"))
-                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace("#.*?\\r?\\n".toRegex(), ""),
                 ).use { resultSet ->
                     assertThat(resultSet.next(), equalTo(true))
                     assertThat(resultSet.getNString(1), equalTo("a@b.com"))
diff --git a/src/test/kotlin/g0101_0200/s0183_customers_who_never_order/MysqlTest.kt b/src/test/kotlin/g0101_0200/s0183_customers_who_never_order/MysqlTest.kt
index 23a75f1c0..7421da2b0 100644
--- a/src/test/kotlin/g0101_0200/s0183_customers_who_never_order/MysqlTest.kt
+++ b/src/test/kotlin/g0101_0200/s0183_customers_who_never_order/MysqlTest.kt
@@ -23,8 +23,8 @@ import javax.sql.DataSource
             "INSERT INTO Customers(id, name) VALUES (4, 'Max'); " +
             "CREATE TABLE Orders(id INTEGER, customerId INTEGER); " +
             "INSERT INTO Orders(id, customerId) VALUES (1, 3); " +
-            "INSERT INTO Orders(id, customerId) VALUES (2, 1); "
-    ]
+            "INSERT INTO Orders(id, customerId) VALUES (2, 1); ",
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -35,12 +35,12 @@ internal class MysqlTest {
                 statement.executeQuery(
                     BufferedReader(
                         FileReader(
-                            "src/main/kotlin/g0101_0200/s0183_customers_who_never_order/script.sql"
-                        )
+                            "src/main/kotlin/g0101_0200/s0183_customers_who_never_order/script.sql",
+                        ),
                     )
                         .lines()
                         .collect(joining("\n"))
-                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace("#.*?\\r?\\n".toRegex(), ""),
                 ).use { resultSet ->
                     assertThat(resultSet.next(), equalTo(true))
                     assertThat(resultSet.getNString(1), equalTo("Henry"))
diff --git a/src/test/kotlin/g0101_0200/s0184_department_highest_salary/MysqlTest.kt b/src/test/kotlin/g0101_0200/s0184_department_highest_salary/MysqlTest.kt
index 9871df513..f618c5c02 100644
--- a/src/test/kotlin/g0101_0200/s0184_department_highest_salary/MysqlTest.kt
+++ b/src/test/kotlin/g0101_0200/s0184_department_highest_salary/MysqlTest.kt
@@ -24,8 +24,8 @@ import javax.sql.DataSource
             "INSERT INTO Employee(id, name, salary, departmentId) VALUES (5, 'Max', 90000, 1); " +
             "CREATE TABLE Department(id INTEGER, name VARCHAR); " +
             "INSERT INTO Department(id, name) VALUES (1, 'IT'); " +
-            "INSERT INTO Department(id, name) VALUES (2, 'Sales'); "
-    ]
+            "INSERT INTO Department(id, name) VALUES (2, 'Sales'); ",
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -36,12 +36,12 @@ internal class MysqlTest {
                 statement.executeQuery(
                     BufferedReader(
                         FileReader(
-                            "src/main/kotlin/g0101_0200/s0184_department_highest_salary/script.sql"
-                        )
+                            "src/main/kotlin/g0101_0200/s0184_department_highest_salary/script.sql",
+                        ),
                     )
                         .lines()
                         .collect(joining("\n"))
-                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace("#.*?\\r?\\n".toRegex(), ""),
                 ).use { resultSet ->
                     assertThat(resultSet.next(), equalTo(true))
                     assertThat(resultSet.getNString(1), equalTo("IT"))
diff --git a/src/test/kotlin/g0101_0200/s0185_department_top_three_salaries/MysqlTest.kt b/src/test/kotlin/g0101_0200/s0185_department_top_three_salaries/MysqlTest.kt
index 751ce6864..1a43641df 100644
--- a/src/test/kotlin/g0101_0200/s0185_department_top_three_salaries/MysqlTest.kt
+++ b/src/test/kotlin/g0101_0200/s0185_department_top_three_salaries/MysqlTest.kt
@@ -28,8 +28,8 @@ import javax.sql.DataSource
             "INSERT INTO Employee(id, name, salary, departmentId) VALUES (7, 'Will', 70000, 1); " +
             "CREATE TABLE Department(id INTEGER PRIMARY KEY, name VARCHAR); " +
             "INSERT INTO Department(id, name) VALUES (1, 'IT'); " +
-            "INSERT INTO Department(id, name) VALUES (2, 'Sales'); "
-    ]
+            "INSERT INTO Department(id, name) VALUES (2, 'Sales'); ",
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -40,12 +40,12 @@ internal class MysqlTest {
                 statement.executeQuery(
                     BufferedReader(
                         FileReader(
-                            "src/main/kotlin/g0101_0200/s0185_department_top_three_salaries/script.sql"
-                        )
+                            "src/main/kotlin/g0101_0200/s0185_department_top_three_salaries/script.sql",
+                        ),
                     )
                         .lines()
                         .collect(joining("\n"))
-                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace("#.*?\\r?\\n".toRegex(), ""),
                 ).use { resultSet ->
                     assertThat(resultSet.next(), equalTo(true))
                     assertThat(resultSet.getNString(1), equalTo("IT"))
diff --git a/src/test/kotlin/g0101_0200/s0187_repeated_dna_sequences/SolutionTest.kt b/src/test/kotlin/g0101_0200/s0187_repeated_dna_sequences/SolutionTest.kt
index c4e42dcff..0ca7a9723 100644
--- a/src/test/kotlin/g0101_0200/s0187_repeated_dna_sequences/SolutionTest.kt
+++ b/src/test/kotlin/g0101_0200/s0187_repeated_dna_sequences/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun findRepeatedDnaSequences() {
         assertThat(
             Solution().findRepeatedDnaSequences("AAAAACCCCCAAAAACCCCCCAAAAAGGGTTT"),
-            equalTo(listOf("AAAAACCCCC", "CCCCCAAAAA"))
+            equalTo(listOf("AAAAACCCCC", "CCCCCAAAAA")),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun findRepeatedDnaSequences2() {
         assertThat(
             Solution().findRepeatedDnaSequences("AAAAAAAAAAAAA"),
-            equalTo(listOf("AAAAAAAAAA"))
+            equalTo(listOf("AAAAAAAAAA")),
         )
     }
 }
diff --git a/src/test/kotlin/g0101_0200/s0190_reverse_bits/SolutionTest.kt b/src/test/kotlin/g0101_0200/s0190_reverse_bits/SolutionTest.kt
index ea9e19014..f9fa45c85 100644
--- a/src/test/kotlin/g0101_0200/s0190_reverse_bits/SolutionTest.kt
+++ b/src/test/kotlin/g0101_0200/s0190_reverse_bits/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun reverseBits() {
         assertThat(
             Solution().reverseBits(43261596),
-            equalTo(964176192)
+            equalTo(964176192),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun reverseBits2() {
         assertThat(
             Solution().reverseBits(-3),
-            equalTo(-1073741825)
+            equalTo(-1073741825),
         )
     }
 }
diff --git a/src/test/kotlin/g0101_0200/s0196_delete_duplicate_emails/MysqlTest.kt b/src/test/kotlin/g0101_0200/s0196_delete_duplicate_emails/MysqlTest.kt
index b71f1c593..0cbb81bc1 100644
--- a/src/test/kotlin/g0101_0200/s0196_delete_duplicate_emails/MysqlTest.kt
+++ b/src/test/kotlin/g0101_0200/s0196_delete_duplicate_emails/MysqlTest.kt
@@ -19,8 +19,8 @@ import javax.sql.DataSource
         "CREATE TABLE Person(id INTEGER PRIMARY KEY, email VARCHAR); " +
             "INSERT INTO Person(id, email) VALUES (1, 'john@example.com'); " +
             "INSERT INTO Person(id, email) VALUES (2, 'bob@example.com'); " +
-            "INSERT INTO Person(id, email) VALUES (3, 'john@example.com'); "
-    ]
+            "INSERT INTO Person(id, email) VALUES (3, 'john@example.com'); ",
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -31,12 +31,12 @@ internal class MysqlTest {
                 statement.executeUpdate(
                     BufferedReader(
                         FileReader(
-                            "src/main/kotlin/g0101_0200/s0196_delete_duplicate_emails/script.sql"
-                        )
+                            "src/main/kotlin/g0101_0200/s0196_delete_duplicate_emails/script.sql",
+                        ),
                     )
                         .lines()
                         .collect(joining("\n"))
-                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace("#.*?\\r?\\n".toRegex(), ""),
                 )
                 val resultSet = statement.executeQuery("select email from Person")
                 assertThat(resultSet.next(), equalTo(true))
diff --git a/src/test/kotlin/g0101_0200/s0197_rising_temperature/MysqlTest.kt b/src/test/kotlin/g0101_0200/s0197_rising_temperature/MysqlTest.kt
index d86d753f0..5522e19ef 100644
--- a/src/test/kotlin/g0101_0200/s0197_rising_temperature/MysqlTest.kt
+++ b/src/test/kotlin/g0101_0200/s0197_rising_temperature/MysqlTest.kt
@@ -20,8 +20,8 @@ import javax.sql.DataSource
             "INSERT INTO Weather(id, recordDate, temperature) VALUES (1, '2015-01-01', 10); " +
             "INSERT INTO Weather(id, recordDate, temperature) VALUES (2, '2015-01-02', 25); " +
             "INSERT INTO Weather(id, recordDate, temperature) VALUES (3, '2015-01-03', 20); " +
-            "INSERT INTO Weather(id, recordDate, temperature) VALUES (4, '2015-01-04', 30); "
-    ]
+            "INSERT INTO Weather(id, recordDate, temperature) VALUES (4, '2015-01-04', 30); ",
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -32,16 +32,16 @@ internal class MysqlTest {
                 statement.executeQuery(
                     BufferedReader(
                         FileReader(
-                            "src/main/kotlin/g0101_0200/s0197_rising_temperature/script.sql"
-                        )
+                            "src/main/kotlin/g0101_0200/s0197_rising_temperature/script.sql",
+                        ),
                     )
                         .lines()
                         .collect(joining("\n"))
                         .replace("#.*?\\r?\\n".toRegex(), "")
                         .replace(
                             "ADDDATE(FirstDate.recordDate,1)",
-                            "TIMESTAMPADD(DAY, 1, FirstDate.recordDate)"
-                        )
+                            "TIMESTAMPADD(DAY, 1, FirstDate.recordDate)",
+                        ),
                 ).use { resultSet ->
                     assertThat(resultSet.next(), equalTo(true))
                     assertThat(resultSet.getInt(1), equalTo(2))
diff --git a/src/test/kotlin/g0101_0200/s0200_number_of_islands/SolutionTest.kt b/src/test/kotlin/g0101_0200/s0200_number_of_islands/SolutionTest.kt
index fe0dbf437..3161d70e4 100644
--- a/src/test/kotlin/g0101_0200/s0200_number_of_islands/SolutionTest.kt
+++ b/src/test/kotlin/g0101_0200/s0200_number_of_islands/SolutionTest.kt
@@ -11,11 +11,13 @@ internal class SolutionTest {
             Solution()
                 .numIslands(
                     arrayOf(
-                        charArrayOf('1', '1', '1', '1', '0'), charArrayOf('1', '1', '0', '1', '0'),
-                        charArrayOf('1', '1', '0', '0', '0'), charArrayOf('0', '0', '0', '0', '0')
-                    )
+                        charArrayOf('1', '1', '1', '1', '0'),
+                        charArrayOf('1', '1', '0', '1', '0'),
+                        charArrayOf('1', '1', '0', '0', '0'),
+                        charArrayOf('0', '0', '0', '0', '0'),
+                    ),
                 ),
-            equalTo(1)
+            equalTo(1),
         )
     }
 
@@ -25,11 +27,13 @@ internal class SolutionTest {
             Solution()
                 .numIslands(
                     arrayOf(
-                        charArrayOf('1', '1', '0', '0', '0'), charArrayOf('1', '1', '0', '0', '0'),
-                        charArrayOf('0', '0', '1', '0', '0'), charArrayOf('0', '0', '0', '1', '1')
-                    )
+                        charArrayOf('1', '1', '0', '0', '0'),
+                        charArrayOf('1', '1', '0', '0', '0'),
+                        charArrayOf('0', '0', '1', '0', '0'),
+                        charArrayOf('0', '0', '0', '1', '1'),
+                    ),
                 ),
-            equalTo(3)
+            equalTo(3),
         )
     }
 }
diff --git a/src/test/kotlin/g0201_0300/s0203_remove_linked_list_elements/SolutionTest.kt b/src/test/kotlin/g0201_0300/s0203_remove_linked_list_elements/SolutionTest.kt
index d00066211..eb9c21198 100644
--- a/src/test/kotlin/g0201_0300/s0203_remove_linked_list_elements/SolutionTest.kt
+++ b/src/test/kotlin/g0201_0300/s0203_remove_linked_list_elements/SolutionTest.kt
@@ -16,7 +16,8 @@ internal class SolutionTest {
         headActual.next!!.next!!.next!!.next!!.next = ListNode(5)
         headActual.next!!.next!!.next!!.next!!.next!!.next = ListNode(6)
         assertThat(
-            Solution().removeElements(headActual, 6).toString(), equalTo("1, 2, 3, 4, 5")
+            Solution().removeElements(headActual, 6).toString(),
+            equalTo("1, 2, 3, 4, 5"),
         )
     }
 
diff --git a/src/test/kotlin/g0201_0300/s0209_minimum_size_subarray_sum/SolutionTest.kt b/src/test/kotlin/g0201_0300/s0209_minimum_size_subarray_sum/SolutionTest.kt
index 2ae7c62eb..5baa0498f 100644
--- a/src/test/kotlin/g0201_0300/s0209_minimum_size_subarray_sum/SolutionTest.kt
+++ b/src/test/kotlin/g0201_0300/s0209_minimum_size_subarray_sum/SolutionTest.kt
@@ -18,7 +18,8 @@ internal class SolutionTest {
     @Test
     fun minSubArrayLen3() {
         assertThat(
-            Solution().minSubArrayLen(11, intArrayOf(1, 1, 1, 1, 1, 1, 1, 1)), equalTo(0)
+            Solution().minSubArrayLen(11, intArrayOf(1, 1, 1, 1, 1, 1, 1, 1)),
+            equalTo(0),
         )
     }
 }
diff --git a/src/test/kotlin/g0201_0300/s0210_course_schedule_ii/SolutionTest.kt b/src/test/kotlin/g0201_0300/s0210_course_schedule_ii/SolutionTest.kt
index 84ea98adc..1c6194739 100644
--- a/src/test/kotlin/g0201_0300/s0210_course_schedule_ii/SolutionTest.kt
+++ b/src/test/kotlin/g0201_0300/s0210_course_schedule_ii/SolutionTest.kt
@@ -18,7 +18,7 @@ internal class SolutionTest {
         val numCourses = 4
         assertThat(
             Solution().findOrder(numCourses, prerequisites),
-            equalTo(intArrayOf(0, 1, 2, 3))
+            equalTo(intArrayOf(0, 1, 2, 3)),
         )
     }
 
diff --git a/src/test/kotlin/g0201_0300/s0212_word_search_ii/SolutionTest.kt b/src/test/kotlin/g0201_0300/s0212_word_search_ii/SolutionTest.kt
index 1d3797a78..e40bca830 100644
--- a/src/test/kotlin/g0201_0300/s0212_word_search_ii/SolutionTest.kt
+++ b/src/test/kotlin/g0201_0300/s0212_word_search_ii/SolutionTest.kt
@@ -11,7 +11,7 @@ internal class SolutionTest {
             charArrayOf('o', 'a', 'a', 'n'),
             charArrayOf('e', 't', 'a', 'e'),
             charArrayOf('i', 'h', 'k', 'r'),
-            charArrayOf('i', 'f', 'l', 'v')
+            charArrayOf('i', 'f', 'l', 'v'),
         )
         val words = arrayOf<String?>("oath", "pea", "eat", "rain")
         val expected: MutableList<String> = ArrayList()
diff --git a/src/test/kotlin/g0201_0300/s0215_kth_largest_element_in_an_array/SolutionTest.kt b/src/test/kotlin/g0201_0300/s0215_kth_largest_element_in_an_array/SolutionTest.kt
index 08885be9e..df3034c38 100644
--- a/src/test/kotlin/g0201_0300/s0215_kth_largest_element_in_an_array/SolutionTest.kt
+++ b/src/test/kotlin/g0201_0300/s0215_kth_largest_element_in_an_array/SolutionTest.kt
@@ -14,7 +14,7 @@ internal class SolutionTest {
     fun findKthLargest2() {
         assertThat(
             Solution().findKthLargest(intArrayOf(3, 2, 3, 1, 2, 4, 5, 5, 6), 4),
-            equalTo(4)
+            equalTo(4),
         )
     }
 }
diff --git a/src/test/kotlin/g0201_0300/s0216_combination_sum_iii/SolutionTest.kt b/src/test/kotlin/g0201_0300/s0216_combination_sum_iii/SolutionTest.kt
index e92054e6b..103e225b4 100644
--- a/src/test/kotlin/g0201_0300/s0216_combination_sum_iii/SolutionTest.kt
+++ b/src/test/kotlin/g0201_0300/s0216_combination_sum_iii/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
     fun combinationSum3() {
         assertThat(
             Solution().combinationSum3(3, 7),
-            equalTo(ArrayUtils.getLists(arrayOf(intArrayOf(1, 2, 4))))
+            equalTo(ArrayUtils.getLists(arrayOf(intArrayOf(1, 2, 4)))),
         )
     }
 
@@ -18,7 +18,7 @@ internal class SolutionTest {
     fun combinationSum32() {
         assertThat(
             Solution().combinationSum3(3, 9),
-            equalTo(ArrayUtils.getLists(arrayOf(intArrayOf(1, 2, 6), intArrayOf(1, 3, 5), intArrayOf(2, 3, 4))))
+            equalTo(ArrayUtils.getLists(arrayOf(intArrayOf(1, 2, 6), intArrayOf(1, 3, 5), intArrayOf(2, 3, 4)))),
         )
     }
 }
diff --git a/src/test/kotlin/g0201_0300/s0217_contains_duplicate/SolutionTest.kt b/src/test/kotlin/g0201_0300/s0217_contains_duplicate/SolutionTest.kt
index 21ee4325e..be006b040 100644
--- a/src/test/kotlin/g0201_0300/s0217_contains_duplicate/SolutionTest.kt
+++ b/src/test/kotlin/g0201_0300/s0217_contains_duplicate/SolutionTest.kt
@@ -19,7 +19,7 @@ internal class SolutionTest {
     fun containsDuplicate3() {
         assertThat(
             Solution().containsDuplicate(intArrayOf(1, 1, 1, 3, 3, 4, 3, 2, 4, 2)),
-            equalTo(true)
+            equalTo(true),
         )
     }
 }
diff --git a/src/test/kotlin/g0201_0300/s0218_the_skyline_problem/SolutionTest.kt b/src/test/kotlin/g0201_0300/s0218_the_skyline_problem/SolutionTest.kt
index 88b3dfe98..8c7052577 100644
--- a/src/test/kotlin/g0201_0300/s0218_the_skyline_problem/SolutionTest.kt
+++ b/src/test/kotlin/g0201_0300/s0218_the_skyline_problem/SolutionTest.kt
@@ -13,7 +13,7 @@ internal class SolutionTest {
             intArrayOf(3, 7, 15),
             intArrayOf(5, 12, 12),
             intArrayOf(15, 20, 10),
-            intArrayOf(19, 24, 8)
+            intArrayOf(19, 24, 8),
         )
         val expected = arrayOf(
             intArrayOf(2, 10),
@@ -22,7 +22,7 @@ internal class SolutionTest {
             intArrayOf(12, 0),
             intArrayOf(15, 10),
             intArrayOf(20, 8),
-            intArrayOf(24, 0)
+            intArrayOf(24, 0),
         )
         assertThat(Solution().getSkyline(buildings), equalTo(ArrayUtils.getLists(expected)))
     }
diff --git a/src/test/kotlin/g0201_0300/s0219_contains_duplicate_ii/SolutionTest.kt b/src/test/kotlin/g0201_0300/s0219_contains_duplicate_ii/SolutionTest.kt
index 6b338c1f8..b43fc4352 100644
--- a/src/test/kotlin/g0201_0300/s0219_contains_duplicate_ii/SolutionTest.kt
+++ b/src/test/kotlin/g0201_0300/s0219_contains_duplicate_ii/SolutionTest.kt
@@ -8,14 +8,16 @@ internal class SolutionTest {
     @Test
     fun containsNearbyDuplicate() {
         assertThat(
-            Solution().containsNearbyDuplicate(intArrayOf(1, 2, 3, 1), 3), equalTo(true)
+            Solution().containsNearbyDuplicate(intArrayOf(1, 2, 3, 1), 3),
+            equalTo(true),
         )
     }
 
     @Test
     fun containsNearbyDuplicate2() {
         assertThat(
-            Solution().containsNearbyDuplicate(intArrayOf(1, 0, 1, 1), 1), equalTo(true)
+            Solution().containsNearbyDuplicate(intArrayOf(1, 0, 1, 1), 1),
+            equalTo(true),
         )
     }
 
@@ -23,7 +25,7 @@ internal class SolutionTest {
     fun containsNearbyDuplicate3() {
         assertThat(
             Solution().containsNearbyDuplicate(intArrayOf(1, 2, 3, 1, 2, 3), 2),
-            equalTo(false)
+            equalTo(false),
         )
     }
 }
diff --git a/src/test/kotlin/g0201_0300/s0220_contains_duplicate_iii/SolutionTest.kt b/src/test/kotlin/g0201_0300/s0220_contains_duplicate_iii/SolutionTest.kt
index d533fd158..eda82a895 100644
--- a/src/test/kotlin/g0201_0300/s0220_contains_duplicate_iii/SolutionTest.kt
+++ b/src/test/kotlin/g0201_0300/s0220_contains_duplicate_iii/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun containsNearbyAlmostDuplicate() {
         assertThat(
             Solution().containsNearbyAlmostDuplicate(intArrayOf(1, 2, 3, 1), 3, 0),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun containsNearbyAlmostDuplicate2() {
         assertThat(
             Solution().containsNearbyAlmostDuplicate(intArrayOf(1, 0, 1, 1), 1, 2),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun containsNearbyAlmostDuplicate3() {
         assertThat(
             Solution().containsNearbyAlmostDuplicate(intArrayOf(1, 5, 9, 1, 5, 9), 2, 3),
-            equalTo(false)
+            equalTo(false),
         )
     }
 }
diff --git a/src/test/kotlin/g0201_0300/s0221_maximal_square/SolutionTest.kt b/src/test/kotlin/g0201_0300/s0221_maximal_square/SolutionTest.kt
index 30bb50507..09413c1ca 100644
--- a/src/test/kotlin/g0201_0300/s0221_maximal_square/SolutionTest.kt
+++ b/src/test/kotlin/g0201_0300/s0221_maximal_square/SolutionTest.kt
@@ -8,8 +8,10 @@ internal class SolutionTest {
     @Test
     fun maximalSquare() {
         val input = arrayOf(
-            charArrayOf('1', '0', '1', '0', '0'), charArrayOf('1', '0', '1', '1', '1'),
-            charArrayOf('1', '1', '1', '1', '1'), charArrayOf('1', '0', '0', '1', '0')
+            charArrayOf('1', '0', '1', '0', '0'),
+            charArrayOf('1', '0', '1', '1', '1'),
+            charArrayOf('1', '1', '1', '1', '1'),
+            charArrayOf('1', '0', '0', '1', '0'),
         )
         assertThat(Solution().maximalSquare(input), equalTo(4))
     }
diff --git a/src/test/kotlin/g0201_0300/s0228_summary_ranges/SolutionTest.kt b/src/test/kotlin/g0201_0300/s0228_summary_ranges/SolutionTest.kt
index 2e21bfc31..d4c64af32 100644
--- a/src/test/kotlin/g0201_0300/s0228_summary_ranges/SolutionTest.kt
+++ b/src/test/kotlin/g0201_0300/s0228_summary_ranges/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun summaryRanges() {
         assertThat(
             Solution().summaryRanges(intArrayOf(0, 1, 2, 4, 5, 7)),
-            equalTo(listOf("0->2", "4->5", "7"))
+            equalTo(listOf("0->2", "4->5", "7")),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun summaryRanges2() {
         assertThat(
             Solution().summaryRanges(intArrayOf(0, 2, 3, 4, 6, 8, 9)),
-            equalTo(listOf("0", "2->4", "6", "8->9"))
+            equalTo(listOf("0", "2->4", "6", "8->9")),
         )
     }
 }
diff --git a/src/test/kotlin/g0201_0300/s0229_majority_element_ii/SolutionTest.kt b/src/test/kotlin/g0201_0300/s0229_majority_element_ii/SolutionTest.kt
index a52f41122..5674a83cf 100644
--- a/src/test/kotlin/g0201_0300/s0229_majority_element_ii/SolutionTest.kt
+++ b/src/test/kotlin/g0201_0300/s0229_majority_element_ii/SolutionTest.kt
@@ -14,7 +14,7 @@ internal class SolutionTest {
     fun majorityElement2() {
         assertThat(
             Solution().majorityElement(intArrayOf(1)),
-            equalTo(listOf(1))
+            equalTo(listOf(1)),
         )
     }
 
diff --git a/src/test/kotlin/g0201_0300/s0235_lowest_common_ancestor_of_a_binary_search_tree/SolutionTest.kt b/src/test/kotlin/g0201_0300/s0235_lowest_common_ancestor_of_a_binary_search_tree/SolutionTest.kt
index 854df13ce..257ce8ed8 100644
--- a/src/test/kotlin/g0201_0300/s0235_lowest_common_ancestor_of_a_binary_search_tree/SolutionTest.kt
+++ b/src/test/kotlin/g0201_0300/s0235_lowest_common_ancestor_of_a_binary_search_tree/SolutionTest.kt
@@ -15,7 +15,7 @@ internal class SolutionTest {
         val root = TreeNode(6, leftNode, rightNode)
         assertThat(
             Solution().lowestCommonAncestor(root, TreeNode(2), TreeNode(8))!!.`val`,
-            equalTo(6)
+            equalTo(6),
         )
     }
 
@@ -28,7 +28,7 @@ internal class SolutionTest {
         val root = TreeNode(6, leftNode, rightNode)
         assertThat(
             Solution().lowestCommonAncestor(root, TreeNode(2), TreeNode(4))!!.`val`,
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -39,9 +39,9 @@ internal class SolutionTest {
                 .lowestCommonAncestor(
                     TreeNode(2, TreeNode(1), null),
                     TreeNode(2),
-                    TreeNode(1)
+                    TreeNode(1),
                 )!!.`val`,
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -52,9 +52,9 @@ internal class SolutionTest {
                 .lowestCommonAncestor(
                     TreeNode.create(listOf(6, 2, 8, 0, 4, 7, 9, null, null, 3, 5)),
                     TreeNode(3),
-                    TreeNode(5)
+                    TreeNode(5),
                 )!!.`val`,
-            equalTo(4)
+            equalTo(4),
         )
     }
 }
diff --git a/src/test/kotlin/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/SolutionTest.kt b/src/test/kotlin/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/SolutionTest.kt
index 7dfda73b8..5de531a6b 100644
--- a/src/test/kotlin/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/SolutionTest.kt
+++ b/src/test/kotlin/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/SolutionTest.kt
@@ -15,7 +15,7 @@ internal class SolutionTest {
         val root = TreeNode(3, leftNode, rightNode)
         assertThat(
             Solution().lowestCommonAncestor(root, TreeNode(5), TreeNode(1))!!.`val`,
-            equalTo(3)
+            equalTo(3),
         )
     }
 
@@ -28,7 +28,7 @@ internal class SolutionTest {
         val root = TreeNode(3, leftNode, rightNode)
         assertThat(
             Solution().lowestCommonAncestor(root, TreeNode(5), TreeNode(4))!!.`val`,
-            equalTo(5)
+            equalTo(5),
         )
     }
 
@@ -39,9 +39,9 @@ internal class SolutionTest {
                 .lowestCommonAncestor(
                     TreeNode(2, TreeNode(1), null),
                     TreeNode(2),
-                    TreeNode(1)
+                    TreeNode(1),
                 )!!.`val`,
-            equalTo(2)
+            equalTo(2),
         )
     }
 }
diff --git a/src/test/kotlin/g0201_0300/s0238_product_of_array_except_self/SolutionTest.kt b/src/test/kotlin/g0201_0300/s0238_product_of_array_except_self/SolutionTest.kt
index 7098293a7..e9b2ad1cd 100644
--- a/src/test/kotlin/g0201_0300/s0238_product_of_array_except_self/SolutionTest.kt
+++ b/src/test/kotlin/g0201_0300/s0238_product_of_array_except_self/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun productExceptSelf() {
         assertThat(
             Solution().productExceptSelf(intArrayOf(1, 2, 3, 4)),
-            equalTo(intArrayOf(24, 12, 8, 6))
+            equalTo(intArrayOf(24, 12, 8, 6)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun productExceptSelf2() {
         assertThat(
             Solution().productExceptSelf(intArrayOf(-1, 1, 0, -3, 3)),
-            equalTo(intArrayOf(0, 0, 9, 0, 0))
+            equalTo(intArrayOf(0, 0, 9, 0, 0)),
         )
     }
 }
diff --git a/src/test/kotlin/g0201_0300/s0239_sliding_window_maximum/SolutionTest.kt b/src/test/kotlin/g0201_0300/s0239_sliding_window_maximum/SolutionTest.kt
index 4617199e8..53f4feba2 100644
--- a/src/test/kotlin/g0201_0300/s0239_sliding_window_maximum/SolutionTest.kt
+++ b/src/test/kotlin/g0201_0300/s0239_sliding_window_maximum/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun maxSlidingWindow() {
         assertThat(
             Solution().maxSlidingWindow(intArrayOf(1, 3, -1, -3, 5, 3, 6, 7), 3),
-            equalTo(intArrayOf(3, 3, 5, 5, 6, 7))
+            equalTo(intArrayOf(3, 3, 5, 5, 6, 7)),
         )
     }
 
diff --git a/src/test/kotlin/g0201_0300/s0240_search_a_2d_matrix_ii/SolutionTest.kt b/src/test/kotlin/g0201_0300/s0240_search_a_2d_matrix_ii/SolutionTest.kt
index 9352c2f5a..f66a482e5 100644
--- a/src/test/kotlin/g0201_0300/s0240_search_a_2d_matrix_ii/SolutionTest.kt
+++ b/src/test/kotlin/g0201_0300/s0240_search_a_2d_matrix_ii/SolutionTest.kt
@@ -8,8 +8,11 @@ internal class SolutionTest {
     @Test
     fun searchMatrix() {
         val matrix = arrayOf(
-            intArrayOf(1, 4, 7, 11, 15), intArrayOf(2, 5, 8, 12, 19), intArrayOf(3, 6, 9, 16, 22),
-            intArrayOf(10, 13, 14, 17, 24), intArrayOf(18, 21, 23, 26, 30)
+            intArrayOf(1, 4, 7, 11, 15),
+            intArrayOf(2, 5, 8, 12, 19),
+            intArrayOf(3, 6, 9, 16, 22),
+            intArrayOf(10, 13, 14, 17, 24),
+            intArrayOf(18, 21, 23, 26, 30),
         )
         assertThat(Solution().searchMatrix(matrix, 5), equalTo(true))
     }
@@ -17,8 +20,11 @@ internal class SolutionTest {
     @Test
     fun searchMatrix2() {
         val matrix = arrayOf(
-            intArrayOf(1, 4, 7, 11, 15), intArrayOf(2, 5, 8, 12, 19), intArrayOf(3, 6, 9, 16, 22),
-            intArrayOf(10, 13, 14, 17, 24), intArrayOf(18, 21, 23, 26, 30)
+            intArrayOf(1, 4, 7, 11, 15),
+            intArrayOf(2, 5, 8, 12, 19),
+            intArrayOf(3, 6, 9, 16, 22),
+            intArrayOf(10, 13, 14, 17, 24),
+            intArrayOf(18, 21, 23, 26, 30),
         )
         assertThat(Solution().searchMatrix(matrix, 20), equalTo(false))
     }
diff --git a/src/test/kotlin/g0201_0300/s0241_different_ways_to_add_parentheses/SolutionTest.kt b/src/test/kotlin/g0201_0300/s0241_different_ways_to_add_parentheses/SolutionTest.kt
index e846950d9..46c4f36b7 100644
--- a/src/test/kotlin/g0201_0300/s0241_different_ways_to_add_parentheses/SolutionTest.kt
+++ b/src/test/kotlin/g0201_0300/s0241_different_ways_to_add_parentheses/SolutionTest.kt
@@ -14,7 +14,7 @@ internal class SolutionTest {
     fun diffWaysToCompute2() {
         assertThat(
             Solution().diffWaysToCompute("2*3-4*5"),
-            equalTo(listOf(-34, -10, -14, -10, 10))
+            equalTo(listOf(-34, -10, -14, -10, 10)),
         )
     }
 }
diff --git a/src/test/kotlin/g0201_0300/s0257_binary_tree_paths/SolutionTest.kt b/src/test/kotlin/g0201_0300/s0257_binary_tree_paths/SolutionTest.kt
index 5aeaa1fad..0e01016aa 100644
--- a/src/test/kotlin/g0201_0300/s0257_binary_tree_paths/SolutionTest.kt
+++ b/src/test/kotlin/g0201_0300/s0257_binary_tree_paths/SolutionTest.kt
@@ -11,7 +11,7 @@ internal class SolutionTest {
         val treeNode = TreeNode(1, TreeNode(2, null, TreeNode(5)), TreeNode(3))
         assertThat(
             Solution().binaryTreePaths(treeNode),
-            equalTo(listOf("1->2->5", "1->3"))
+            equalTo(listOf("1->2->5", "1->3")),
         )
     }
 
diff --git a/src/test/kotlin/g0201_0300/s0260_single_number_iii/SolutionTest.kt b/src/test/kotlin/g0201_0300/s0260_single_number_iii/SolutionTest.kt
index 8e9d74595..72442c4dc 100644
--- a/src/test/kotlin/g0201_0300/s0260_single_number_iii/SolutionTest.kt
+++ b/src/test/kotlin/g0201_0300/s0260_single_number_iii/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun singleNumber() {
         assertThat(
             Solution().singleNumber(intArrayOf(1, 2, 1, 3, 2, 5)),
-            equalTo(intArrayOf(3, 5))
+            equalTo(intArrayOf(3, 5)),
         )
     }
 
diff --git a/src/test/kotlin/g0201_0300/s0262_trips_and_users/MysqlTest.kt b/src/test/kotlin/g0201_0300/s0262_trips_and_users/MysqlTest.kt
index ba165f9b2..7828c59c3 100644
--- a/src/test/kotlin/g0201_0300/s0262_trips_and_users/MysqlTest.kt
+++ b/src/test/kotlin/g0201_0300/s0262_trips_and_users/MysqlTest.kt
@@ -46,8 +46,8 @@ import javax.sql.DataSource
             "INSERT INTO Users(users_id, banned, role) VALUES (10, 'No', 'driver'); " +
             "INSERT INTO Users(users_id, banned, role) VALUES (11, 'No', 'driver'); " +
             "INSERT INTO Users(users_id, banned, role) VALUES (12, 'No', 'driver'); " +
-            "INSERT INTO Users(users_id, banned, role) VALUES (13, 'No', 'driver'); "
-    ]
+            "INSERT INTO Users(users_id, banned, role) VALUES (13, 'No', 'driver'); ",
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -58,12 +58,12 @@ internal class MysqlTest {
                 statement.executeQuery(
                     BufferedReader(
                         FileReader(
-                            "src/main/kotlin/g0201_0300/s0262_trips_and_users/script.sql"
-                        )
+                            "src/main/kotlin/g0201_0300/s0262_trips_and_users/script.sql",
+                        ),
                     )
                         .lines()
                         .collect(Collectors.joining("\n"))
-                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace("#.*?\\r?\\n".toRegex(), ""),
                 ).use { resultSet ->
                     assertThat(resultSet.next(), equalTo(true))
                     assertThat(resultSet.getDate(1).toString(), equalTo("2013-10-01"))
diff --git a/src/test/kotlin/g0201_0300/s0273_integer_to_english_words/SolutionTest.kt b/src/test/kotlin/g0201_0300/s0273_integer_to_english_words/SolutionTest.kt
index 52e0e09d7..356591756 100644
--- a/src/test/kotlin/g0201_0300/s0273_integer_to_english_words/SolutionTest.kt
+++ b/src/test/kotlin/g0201_0300/s0273_integer_to_english_words/SolutionTest.kt
@@ -14,7 +14,7 @@ internal class SolutionTest {
     fun numberToWords2() {
         assertThat(
             Solution().numberToWords(12345),
-            equalTo("Twelve Thousand Three Hundred Forty Five")
+            equalTo("Twelve Thousand Three Hundred Forty Five"),
         )
     }
 
@@ -22,7 +22,7 @@ internal class SolutionTest {
     fun numberToWords3() {
         assertThat(
             Solution().numberToWords(1234567),
-            equalTo("One Million Two Hundred Thirty Four Thousand Five Hundred Sixty Seven")
+            equalTo("One Million Two Hundred Thirty Four Thousand Five Hundred Sixty Seven"),
         )
     }
 }
diff --git a/src/test/kotlin/g0201_0300/s0282_expression_add_operators/SolutionTest.kt b/src/test/kotlin/g0201_0300/s0282_expression_add_operators/SolutionTest.kt
index 49d81c534..9240d77ea 100644
--- a/src/test/kotlin/g0201_0300/s0282_expression_add_operators/SolutionTest.kt
+++ b/src/test/kotlin/g0201_0300/s0282_expression_add_operators/SolutionTest.kt
@@ -18,7 +18,8 @@ internal class SolutionTest {
     @Test
     fun addOperators3() {
         assertThat(
-            Solution().addOperators("3456237490", 9191), equalTo(emptyList())
+            Solution().addOperators("3456237490", 9191),
+            equalTo(emptyList()),
         )
     }
 }
diff --git a/src/test/kotlin/g0201_0300/s0289_game_of_life/SolutionTest.kt b/src/test/kotlin/g0201_0300/s0289_game_of_life/SolutionTest.kt
index bfabb4e71..e71db29ac 100644
--- a/src/test/kotlin/g0201_0300/s0289_game_of_life/SolutionTest.kt
+++ b/src/test/kotlin/g0201_0300/s0289_game_of_life/SolutionTest.kt
@@ -11,7 +11,7 @@ internal class SolutionTest {
         Solution().gameOfLife(board)
         assertThat(
             board,
-            equalTo(arrayOf(intArrayOf(0, 0, 0), intArrayOf(1, 0, 1), intArrayOf(0, 1, 1), intArrayOf(0, 1, 0)))
+            equalTo(arrayOf(intArrayOf(0, 0, 0), intArrayOf(1, 0, 1), intArrayOf(0, 1, 1), intArrayOf(0, 1, 0))),
         )
     }
 
diff --git a/src/test/kotlin/g0301_0400/s0301_remove_invalid_parentheses/SolutionTest.kt b/src/test/kotlin/g0301_0400/s0301_remove_invalid_parentheses/SolutionTest.kt
index 9ab2995ef..85c45a556 100644
--- a/src/test/kotlin/g0301_0400/s0301_remove_invalid_parentheses/SolutionTest.kt
+++ b/src/test/kotlin/g0301_0400/s0301_remove_invalid_parentheses/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun removeInvalidParentheses() {
         assertThat(
             Solution().removeInvalidParentheses("()())()"),
-            equalTo(listOf("(())()", "()()()"))
+            equalTo(listOf("(())()", "()()()")),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun removeInvalidParentheses2() {
         assertThat(
             Solution().removeInvalidParentheses("(a)())()"),
-            equalTo(listOf("(a())()", "(a)()()"))
+            equalTo(listOf("(a())()", "(a)()()")),
         )
     }
 
diff --git a/src/test/kotlin/g0301_0400/s0304_range_sum_query_2d_immutable/NumMatrixTest.kt b/src/test/kotlin/g0301_0400/s0304_range_sum_query_2d_immutable/NumMatrixTest.kt
index 6bffa675e..d1bd1126f 100644
--- a/src/test/kotlin/g0301_0400/s0304_range_sum_query_2d_immutable/NumMatrixTest.kt
+++ b/src/test/kotlin/g0301_0400/s0304_range_sum_query_2d_immutable/NumMatrixTest.kt
@@ -13,8 +13,8 @@ internal class NumMatrixTest {
                 intArrayOf(5, 6, 3, 2, 1),
                 intArrayOf(1, 2, 0, 1, 5),
                 intArrayOf(4, 1, 0, 1, 7),
-                intArrayOf(1, 0, 3, 0, 5)
-            )
+                intArrayOf(1, 0, 3, 0, 5),
+            ),
         )
         assertThat(numMatrix.sumRegion(2, 1, 4, 3), equalTo(8))
         assertThat(numMatrix.sumRegion(1, 1, 2, 2), equalTo(11))
diff --git a/src/test/kotlin/g0301_0400/s0310_minimum_height_trees/SolutionTest.kt b/src/test/kotlin/g0301_0400/s0310_minimum_height_trees/SolutionTest.kt
index 31249e267..e47242d0e 100644
--- a/src/test/kotlin/g0301_0400/s0310_minimum_height_trees/SolutionTest.kt
+++ b/src/test/kotlin/g0301_0400/s0310_minimum_height_trees/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun findMinHeightTrees() {
         assertThat(
             Solution().findMinHeightTrees(4, arrayOf(intArrayOf(1, 0), intArrayOf(1, 2), intArrayOf(1, 3))),
-            equalTo(listOf(1))
+            equalTo(listOf(1)),
         )
     }
 
@@ -18,9 +18,10 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .findMinHeightTrees(
-                    6, arrayOf(intArrayOf(3, 0), intArrayOf(3, 1), intArrayOf(3, 2), intArrayOf(3, 4), intArrayOf(5, 4))
+                    6,
+                    arrayOf(intArrayOf(3, 0), intArrayOf(3, 1), intArrayOf(3, 2), intArrayOf(3, 4), intArrayOf(5, 4)),
                 ),
-            equalTo(listOf(3, 4))
+            equalTo(listOf(3, 4)),
         )
     }
 }
diff --git a/src/test/kotlin/g0301_0400/s0315_count_of_smaller_numbers_after_self/SolutionTest.kt b/src/test/kotlin/g0301_0400/s0315_count_of_smaller_numbers_after_self/SolutionTest.kt
index 023ea79c5..82c7e50c9 100644
--- a/src/test/kotlin/g0301_0400/s0315_count_of_smaller_numbers_after_self/SolutionTest.kt
+++ b/src/test/kotlin/g0301_0400/s0315_count_of_smaller_numbers_after_self/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun countSmaller() {
         assertThat(
             Solution().countSmaller(intArrayOf(5, 2, 6, 1)),
-            equalTo(listOf(2, 1, 1, 0))
+            equalTo(listOf(2, 1, 1, 0)),
         )
     }
 
diff --git a/src/test/kotlin/g0301_0400/s0318_maximum_product_of_word_lengths/SolutionTest.kt b/src/test/kotlin/g0301_0400/s0318_maximum_product_of_word_lengths/SolutionTest.kt
index c8543c949..5d91096b0 100644
--- a/src/test/kotlin/g0301_0400/s0318_maximum_product_of_word_lengths/SolutionTest.kt
+++ b/src/test/kotlin/g0301_0400/s0318_maximum_product_of_word_lengths/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .maxProduct(arrayOf("abcw", "baz", "foo", "bar", "xtfn", "abcdef")),
-            equalTo(16)
+            equalTo(16),
         )
     }
 
@@ -19,7 +19,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .maxProduct(arrayOf("a", "ab", "abc", "d", "cd", "bcd", "abcd")),
-            equalTo(4)
+            equalTo(4),
         )
     }
 }
diff --git a/src/test/kotlin/g0301_0400/s0321_create_maximum_number/SolutionTest.kt b/src/test/kotlin/g0301_0400/s0321_create_maximum_number/SolutionTest.kt
index f81d7f72b..70308cc29 100644
--- a/src/test/kotlin/g0301_0400/s0321_create_maximum_number/SolutionTest.kt
+++ b/src/test/kotlin/g0301_0400/s0321_create_maximum_number/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun maxNumber() {
         assertThat(
             Solution().maxNumber(intArrayOf(3, 4, 6, 5), intArrayOf(9, 1, 2, 5, 8, 3), 5),
-            equalTo(intArrayOf(9, 8, 6, 5, 3))
+            equalTo(intArrayOf(9, 8, 6, 5, 3)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun maxNumber2() {
         assertThat(
             Solution().maxNumber(intArrayOf(6, 7), intArrayOf(6, 0, 4), 5),
-            equalTo(intArrayOf(6, 7, 6, 0, 4))
+            equalTo(intArrayOf(6, 7, 6, 0, 4)),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun maxNumber3() {
         assertThat(
             Solution().maxNumber(intArrayOf(3, 9), intArrayOf(8, 9), 3),
-            equalTo(intArrayOf(9, 8, 9))
+            equalTo(intArrayOf(9, 8, 9)),
         )
     }
 }
diff --git a/src/test/kotlin/g0301_0400/s0329_longest_increasing_path_in_a_matrix/SolutionTest.kt b/src/test/kotlin/g0301_0400/s0329_longest_increasing_path_in_a_matrix/SolutionTest.kt
index 871115a37..9c8b47e3b 100644
--- a/src/test/kotlin/g0301_0400/s0329_longest_increasing_path_in_a_matrix/SolutionTest.kt
+++ b/src/test/kotlin/g0301_0400/s0329_longest_increasing_path_in_a_matrix/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun longestIncreasingPath() {
         assertThat(
             Solution().longestIncreasingPath(arrayOf(intArrayOf(9, 9, 4), intArrayOf(6, 6, 8), intArrayOf(2, 1, 1))),
-            equalTo(4)
+            equalTo(4),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun longestIncreasingPath2() {
         assertThat(
             Solution().longestIncreasingPath(arrayOf(intArrayOf(3, 4, 5), intArrayOf(3, 2, 6), intArrayOf(2, 2, 1))),
-            equalTo(4)
+            equalTo(4),
         )
     }
 }
diff --git a/src/test/kotlin/g0301_0400/s0332_reconstruct_itinerary/SolutionTest.kt b/src/test/kotlin/g0301_0400/s0332_reconstruct_itinerary/SolutionTest.kt
index a74185086..03ade535c 100644
--- a/src/test/kotlin/g0301_0400/s0332_reconstruct_itinerary/SolutionTest.kt
+++ b/src/test/kotlin/g0301_0400/s0332_reconstruct_itinerary/SolutionTest.kt
@@ -11,11 +11,11 @@ internal class SolutionTest {
             listOf("MUC", "LHR"),
             listOf("JFK", "MUC"),
             listOf("SFO", "SJC"),
-            listOf("LHR", "SFO")
+            listOf("LHR", "SFO"),
         )
         assertThat(
             Solution().findItinerary(input),
-            equalTo(listOf("JFK", "MUC", "LHR", "SFO", "SJC"))
+            equalTo(listOf("JFK", "MUC", "LHR", "SFO", "SJC")),
         )
     }
 
@@ -26,11 +26,11 @@ internal class SolutionTest {
             listOf("JFK", "ATL"),
             listOf("SFO", "ATL"),
             listOf("ATL", "JFK"),
-            listOf("ATL", "SFO")
+            listOf("ATL", "SFO"),
         )
         assertThat(
             Solution().findItinerary(input),
-            equalTo(listOf("JFK", "ATL", "JFK", "SFO", "ATL", "SFO"))
+            equalTo(listOf("JFK", "ATL", "JFK", "SFO", "ATL", "SFO")),
         )
     }
 }
diff --git a/src/test/kotlin/g0301_0400/s0336_palindrome_pairs/SolutionTest.kt b/src/test/kotlin/g0301_0400/s0336_palindrome_pairs/SolutionTest.kt
index fb32c3201..89157735d 100644
--- a/src/test/kotlin/g0301_0400/s0336_palindrome_pairs/SolutionTest.kt
+++ b/src/test/kotlin/g0301_0400/s0336_palindrome_pairs/SolutionTest.kt
@@ -16,10 +16,10 @@ internal class SolutionTest {
                         intArrayOf(0, 1),
                         intArrayOf(1, 0),
                         intArrayOf(2, 4),
-                        intArrayOf(3, 2)
-                    )
-                )
-            )
+                        intArrayOf(3, 2),
+                    ),
+                ),
+            ),
         )
     }
 
@@ -31,10 +31,10 @@ internal class SolutionTest {
                 ArrayUtils.getLists(
                     arrayOf(
                         intArrayOf(0, 1),
-                        intArrayOf(1, 0)
-                    )
-                )
-            )
+                        intArrayOf(1, 0),
+                    ),
+                ),
+            ),
         )
     }
 
@@ -46,10 +46,10 @@ internal class SolutionTest {
                 ArrayUtils.getLists(
                     arrayOf(
                         intArrayOf(0, 1),
-                        intArrayOf(1, 0)
-                    )
-                )
-            )
+                        intArrayOf(1, 0),
+                    ),
+                ),
+            ),
         )
     }
 }
diff --git a/src/test/kotlin/g0301_0400/s0337_house_robber_iii/SolutionTest.kt b/src/test/kotlin/g0301_0400/s0337_house_robber_iii/SolutionTest.kt
index faac0d1d2..ecc25700a 100644
--- a/src/test/kotlin/g0301_0400/s0337_house_robber_iii/SolutionTest.kt
+++ b/src/test/kotlin/g0301_0400/s0337_house_robber_iii/SolutionTest.kt
@@ -11,7 +11,7 @@ internal class SolutionTest {
         val root = TreeNode(
             3,
             TreeNode(2, null, TreeNode(3)),
-            TreeNode(3, null, TreeNode(1))
+            TreeNode(3, null, TreeNode(1)),
         )
         assertThat(Solution().rob(root), equalTo(7))
     }
@@ -21,7 +21,7 @@ internal class SolutionTest {
         val root = TreeNode(
             3,
             TreeNode(4, TreeNode(1), TreeNode(3)),
-            TreeNode(5, null, TreeNode(1))
+            TreeNode(5, null, TreeNode(1)),
         )
         assertThat(Solution().rob(root), equalTo(9))
     }
diff --git a/src/test/kotlin/g0301_0400/s0341_flatten_nested_list_iterator/NestedIteratorTest.kt b/src/test/kotlin/g0301_0400/s0341_flatten_nested_list_iterator/NestedIteratorTest.kt
index 0644eb05a..812ee18aa 100644
--- a/src/test/kotlin/g0301_0400/s0341_flatten_nested_list_iterator/NestedIteratorTest.kt
+++ b/src/test/kotlin/g0301_0400/s0341_flatten_nested_list_iterator/NestedIteratorTest.kt
@@ -11,15 +11,16 @@ internal class NestedIteratorTest {
         val iterator = NestedIterator(
             mutableListOf(
                 NestedInteger(
-                    mutableListOf(NestedInteger(1), NestedInteger(1))
+                    mutableListOf(NestedInteger(1), NestedInteger(1)),
                 ),
                 NestedInteger(2),
                 NestedInteger(
                     mutableListOf(
-                        NestedInteger(1), NestedInteger(1)
-                    )
-                )
-            )
+                        NestedInteger(1),
+                        NestedInteger(1),
+                    ),
+                ),
+            ),
         )
         val result: MutableList<Int> = ArrayList()
         while (iterator.hasNext()) {
diff --git a/src/test/kotlin/g0301_0400/s0347_top_k_frequent_elements/SolutionTest.kt b/src/test/kotlin/g0301_0400/s0347_top_k_frequent_elements/SolutionTest.kt
index 675d869ab..d7abd07cc 100644
--- a/src/test/kotlin/g0301_0400/s0347_top_k_frequent_elements/SolutionTest.kt
+++ b/src/test/kotlin/g0301_0400/s0347_top_k_frequent_elements/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun topKFrequent() {
         assertThat(
             Solution().topKFrequent(intArrayOf(1, 1, 1, 2, 2, 3), 2),
-            equalTo(intArrayOf(1, 2))
+            equalTo(intArrayOf(1, 2)),
         )
     }
 
diff --git a/src/test/kotlin/g0301_0400/s0349_intersection_of_two_arrays/SolutionTest.kt b/src/test/kotlin/g0301_0400/s0349_intersection_of_two_arrays/SolutionTest.kt
index f94a0838d..93a300e02 100644
--- a/src/test/kotlin/g0301_0400/s0349_intersection_of_two_arrays/SolutionTest.kt
+++ b/src/test/kotlin/g0301_0400/s0349_intersection_of_two_arrays/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun intersection() {
         assertThat(
             Solution().intersection(intArrayOf(1, 2, 2, 1), intArrayOf(2, 2)),
-            equalTo(intArrayOf(2))
+            equalTo(intArrayOf(2)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun intersection2() {
         assertThat(
             Solution().intersection(intArrayOf(4, 9, 5), intArrayOf(9, 4, 9, 8, 4)),
-            equalTo(intArrayOf(9, 4))
+            equalTo(intArrayOf(9, 4)),
         )
     }
 }
diff --git a/src/test/kotlin/g0301_0400/s0350_intersection_of_two_arrays_ii/SolutionTest.kt b/src/test/kotlin/g0301_0400/s0350_intersection_of_two_arrays_ii/SolutionTest.kt
index f02c2b3ae..387a7020a 100644
--- a/src/test/kotlin/g0301_0400/s0350_intersection_of_two_arrays_ii/SolutionTest.kt
+++ b/src/test/kotlin/g0301_0400/s0350_intersection_of_two_arrays_ii/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun intersect() {
         assertThat(
             Solution().intersect(intArrayOf(1, 2, 2, 1), intArrayOf(2, 2)),
-            equalTo(intArrayOf(2, 2))
+            equalTo(intArrayOf(2, 2)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun intersect2() {
         assertThat(
             Solution().intersect(intArrayOf(4, 9, 5), intArrayOf(9, 4, 9, 8, 4)),
-            equalTo(intArrayOf(9, 4))
+            equalTo(intArrayOf(9, 4)),
         )
     }
 }
diff --git a/src/test/kotlin/g0301_0400/s0354_russian_doll_envelopes/SolutionTest.kt b/src/test/kotlin/g0301_0400/s0354_russian_doll_envelopes/SolutionTest.kt
index a80764594..7f5d88c1f 100644
--- a/src/test/kotlin/g0301_0400/s0354_russian_doll_envelopes/SolutionTest.kt
+++ b/src/test/kotlin/g0301_0400/s0354_russian_doll_envelopes/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun testMaxEnvelopes() {
         assertThat(
             Solution().maxEnvelopes(arrayOf(intArrayOf(5, 4), intArrayOf(6, 4), intArrayOf(6, 7), intArrayOf(2, 3))),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
diff --git a/src/test/kotlin/g0301_0400/s0363_max_sum_of_rectangle_no_larger_than_k/SolutionTest.kt b/src/test/kotlin/g0301_0400/s0363_max_sum_of_rectangle_no_larger_than_k/SolutionTest.kt
index 05f1d4bd0..d07c7d470 100644
--- a/src/test/kotlin/g0301_0400/s0363_max_sum_of_rectangle_no_larger_than_k/SolutionTest.kt
+++ b/src/test/kotlin/g0301_0400/s0363_max_sum_of_rectangle_no_larger_than_k/SolutionTest.kt
@@ -8,7 +8,8 @@ internal class SolutionTest {
     @Test
     fun maxSumSubmatrix() {
         assertThat(
-            Solution().maxSumSubmatrix(arrayOf(intArrayOf(1, 0, 1), intArrayOf(0, -2, 3)), 2), equalTo(2)
+            Solution().maxSumSubmatrix(arrayOf(intArrayOf(1, 0, 1), intArrayOf(0, -2, 3)), 2),
+            equalTo(2),
         )
     }
 
diff --git a/src/test/kotlin/g0301_0400/s0368_largest_divisible_subset/SolutionTest.kt b/src/test/kotlin/g0301_0400/s0368_largest_divisible_subset/SolutionTest.kt
index 5a36ad99b..3a716dd3f 100644
--- a/src/test/kotlin/g0301_0400/s0368_largest_divisible_subset/SolutionTest.kt
+++ b/src/test/kotlin/g0301_0400/s0368_largest_divisible_subset/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun largestDivisibleSubset() {
         assertThat(
             Solution().largestDivisibleSubset(intArrayOf(1, 2, 3)),
-            equalTo(listOf(2, 1))
+            equalTo(listOf(2, 1)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun largestDivisibleSubset2() {
         assertThat(
             Solution().largestDivisibleSubset(intArrayOf(1, 2, 4, 8)),
-            equalTo(listOf(8, 4, 2, 1))
+            equalTo(listOf(8, 4, 2, 1)),
         )
     }
 }
diff --git a/src/test/kotlin/g0301_0400/s0373_find_k_pairs_with_smallest_sums/SolutionTest.kt b/src/test/kotlin/g0301_0400/s0373_find_k_pairs_with_smallest_sums/SolutionTest.kt
index b76bc80db..1d8310643 100644
--- a/src/test/kotlin/g0301_0400/s0373_find_k_pairs_with_smallest_sums/SolutionTest.kt
+++ b/src/test/kotlin/g0301_0400/s0373_find_k_pairs_with_smallest_sums/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
     fun kSmallestPairs() {
         assertThat(
             Solution().kSmallestPairs(intArrayOf(1, 7, 11), intArrayOf(2, 4, 6), 3),
-            equalTo(ArrayUtils.getLists(arrayOf(intArrayOf(1, 2), intArrayOf(1, 4), intArrayOf(1, 6))))
+            equalTo(ArrayUtils.getLists(arrayOf(intArrayOf(1, 2), intArrayOf(1, 4), intArrayOf(1, 6)))),
         )
     }
 
@@ -18,7 +18,7 @@ internal class SolutionTest {
     fun kSmallestPairs2() {
         assertThat(
             Solution().kSmallestPairs(intArrayOf(1, 1, 2), intArrayOf(1, 2, 3), 2),
-            equalTo(ArrayUtils.getLists(arrayOf(intArrayOf(1, 1), intArrayOf(1, 1))))
+            equalTo(ArrayUtils.getLists(arrayOf(intArrayOf(1, 1), intArrayOf(1, 1)))),
         )
     }
 
@@ -26,7 +26,7 @@ internal class SolutionTest {
     fun kSmallestPairs3() {
         assertThat(
             Solution().kSmallestPairs(intArrayOf(1, 2), intArrayOf(3), 3),
-            equalTo(ArrayUtils.getLists(arrayOf(intArrayOf(1, 3), intArrayOf(2, 3))))
+            equalTo(ArrayUtils.getLists(arrayOf(intArrayOf(1, 3), intArrayOf(2, 3)))),
         )
     }
 }
diff --git a/src/test/kotlin/g0301_0400/s0376_wiggle_subsequence/SolutionTest.kt b/src/test/kotlin/g0301_0400/s0376_wiggle_subsequence/SolutionTest.kt
index 72f3370ca..97d9769ee 100644
--- a/src/test/kotlin/g0301_0400/s0376_wiggle_subsequence/SolutionTest.kt
+++ b/src/test/kotlin/g0301_0400/s0376_wiggle_subsequence/SolutionTest.kt
@@ -14,14 +14,15 @@ internal class SolutionTest {
     fun wiggleMaxLength2() {
         assertThat(
             Solution().wiggleMaxLength(intArrayOf(1, 17, 5, 10, 13, 15, 10, 5, 16, 8)),
-            equalTo(7)
+            equalTo(7),
         )
     }
 
     @Test
     fun wiggleMaxLength3() {
         assertThat(
-            Solution().wiggleMaxLength(intArrayOf(1, 2, 3, 4, 5, 6, 7, 8, 9)), equalTo(2)
+            Solution().wiggleMaxLength(intArrayOf(1, 2, 3, 4, 5, 6, 7, 8, 9)),
+            equalTo(2),
         )
     }
 }
diff --git a/src/test/kotlin/g0301_0400/s0378_kth_smallest_element_in_a_sorted_matrix/SolutionTest.kt b/src/test/kotlin/g0301_0400/s0378_kth_smallest_element_in_a_sorted_matrix/SolutionTest.kt
index 3fe47fe82..579024452 100644
--- a/src/test/kotlin/g0301_0400/s0378_kth_smallest_element_in_a_sorted_matrix/SolutionTest.kt
+++ b/src/test/kotlin/g0301_0400/s0378_kth_smallest_element_in_a_sorted_matrix/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun kthSmallest() {
         assertThat(
             Solution().kthSmallest(arrayOf(intArrayOf(1, 5, 9), intArrayOf(10, 11, 13), intArrayOf(12, 13, 15)), 8),
-            equalTo(13)
+            equalTo(13),
         )
     }
 
diff --git a/src/test/kotlin/g0301_0400/s0380_insert_delete_getrandom_o1/RandomizedSetTest.kt b/src/test/kotlin/g0301_0400/s0380_insert_delete_getrandom_o1/RandomizedSetTest.kt
index 2754ad764..ba792ef38 100644
--- a/src/test/kotlin/g0301_0400/s0380_insert_delete_getrandom_o1/RandomizedSetTest.kt
+++ b/src/test/kotlin/g0301_0400/s0380_insert_delete_getrandom_o1/RandomizedSetTest.kt
@@ -21,10 +21,10 @@ internal class RandomizedSetTest {
         result.add(randomizedSet.getRandom().toString() + "")
         val expected: List<String> = ArrayList(
 
-            listOf("null", "true", "false", "true", "1", "true", "false", "2")
+            listOf("null", "true", "false", "true", "1", "true", "false", "2"),
         )
         val expected2: List<String> = ArrayList(
-            listOf("null", "true", "false", "true", "2", "true", "false", "2")
+            listOf("null", "true", "false", "true", "2", "true", "false", "2"),
         )
         if (random == 1) {
             assertThat(result, equalTo(expected))
diff --git a/src/test/kotlin/g0301_0400/s0381_insert_delete_getrandom_o1_duplicates_allowed/RandomizedCollectionTest.kt b/src/test/kotlin/g0301_0400/s0381_insert_delete_getrandom_o1_duplicates_allowed/RandomizedCollectionTest.kt
index a66d43f02..c4f098b84 100644
--- a/src/test/kotlin/g0301_0400/s0381_insert_delete_getrandom_o1_duplicates_allowed/RandomizedCollectionTest.kt
+++ b/src/test/kotlin/g0301_0400/s0381_insert_delete_getrandom_o1_duplicates_allowed/RandomizedCollectionTest.kt
@@ -27,8 +27,8 @@ internal class RandomizedCollectionTest {
                 "true",
                 random.toString() + "",
                 "true",
-                random2.toString() + ""
-            )
+                random2.toString() + "",
+            ),
         )
         assertThat(result, equalTo(expected))
     }
diff --git a/src/test/kotlin/g0301_0400/s0385_mini_parser/SolutionTest.kt b/src/test/kotlin/g0301_0400/s0385_mini_parser/SolutionTest.kt
index b9f4ecf3e..dcf36649e 100644
--- a/src/test/kotlin/g0301_0400/s0385_mini_parser/SolutionTest.kt
+++ b/src/test/kotlin/g0301_0400/s0385_mini_parser/SolutionTest.kt
@@ -16,7 +16,7 @@ internal class SolutionTest {
         val result = intArrayOf(
             nestedInteger.getList()!![0].getInteger()!!,
             nestedInteger.getList()!![1].getList()!![0].getInteger()!!,
-            nestedInteger.getList()!![1].getList()!![1].getList()!![0].getInteger()!!
+            nestedInteger.getList()!![1].getList()!![1].getList()!![0].getInteger()!!,
         )
         val expected = intArrayOf(123, 456, 789)
         assertThat(result, equalTo(expected))
diff --git a/src/test/kotlin/g0301_0400/s0386_lexicographical_numbers/SolutionTest.kt b/src/test/kotlin/g0301_0400/s0386_lexicographical_numbers/SolutionTest.kt
index 850d1f681..0629f6e5e 100644
--- a/src/test/kotlin/g0301_0400/s0386_lexicographical_numbers/SolutionTest.kt
+++ b/src/test/kotlin/g0301_0400/s0386_lexicographical_numbers/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun lexicalOrder() {
         assertThat(
             Solution().lexicalOrder(13),
-            equalTo(listOf(1, 10, 11, 12, 13, 2, 3, 4, 5, 6, 7, 8, 9))
+            equalTo(listOf(1, 10, 11, 12, 13, 2, 3, 4, 5, 6, 7, 8, 9)),
         )
     }
 
diff --git a/src/test/kotlin/g0301_0400/s0391_perfect_rectangle/SolutionTest.kt b/src/test/kotlin/g0301_0400/s0391_perfect_rectangle/SolutionTest.kt
index df45ec848..174bb859e 100644
--- a/src/test/kotlin/g0301_0400/s0391_perfect_rectangle/SolutionTest.kt
+++ b/src/test/kotlin/g0301_0400/s0391_perfect_rectangle/SolutionTest.kt
@@ -15,10 +15,10 @@ internal class SolutionTest {
                         intArrayOf(3, 1, 4, 2),
                         intArrayOf(3, 2, 4, 4),
                         intArrayOf(1, 3, 2, 4),
-                        intArrayOf(2, 3, 3, 4)
-                    )
+                        intArrayOf(2, 3, 3, 4),
+                    ),
                 ),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
@@ -31,10 +31,10 @@ internal class SolutionTest {
                         intArrayOf(1, 1, 2, 3),
                         intArrayOf(1, 3, 2, 4),
                         intArrayOf(3, 1, 4, 2),
-                        intArrayOf(3, 2, 4, 4)
-                    )
+                        intArrayOf(3, 2, 4, 4),
+                    ),
                 ),
-            equalTo(false)
+            equalTo(false),
         )
     }
 
@@ -47,10 +47,10 @@ internal class SolutionTest {
                         intArrayOf(1, 1, 3, 3),
                         intArrayOf(3, 1, 4, 2),
                         intArrayOf(1, 3, 2, 4),
-                        intArrayOf(3, 2, 4, 4)
-                    )
+                        intArrayOf(3, 2, 4, 4),
+                    ),
                 ),
-            equalTo(false)
+            equalTo(false),
         )
     }
 
@@ -63,10 +63,10 @@ internal class SolutionTest {
                         intArrayOf(1, 1, 3, 3),
                         intArrayOf(3, 1, 4, 2),
                         intArrayOf(1, 3, 2, 4),
-                        intArrayOf(2, 2, 4, 4)
-                    )
+                        intArrayOf(2, 2, 4, 4),
+                    ),
                 ),
-            equalTo(false)
+            equalTo(false),
         )
     }
 }
diff --git a/src/test/kotlin/g0301_0400/s0399_evaluate_division/SolutionTest.kt b/src/test/kotlin/g0301_0400/s0399_evaluate_division/SolutionTest.kt
index f4437b44c..72e2ea286 100644
--- a/src/test/kotlin/g0301_0400/s0399_evaluate_division/SolutionTest.kt
+++ b/src/test/kotlin/g0301_0400/s0399_evaluate_division/SolutionTest.kt
@@ -16,8 +16,8 @@ internal class SolutionTest {
                 arrayOf("b", "a"),
                 arrayOf("a", "e"),
                 arrayOf("a", "a"),
-                arrayOf("x", "x")
-            )
+                arrayOf("x", "x"),
+            ),
         )
         val expected = doubleArrayOf(6.00000, 0.50000, -1.00000, 1.00000, -1.00000)
         assertThat(Solution().calcEquation(equations, values, queries), equalTo(expected))
diff --git a/src/test/kotlin/g0401_0500/s0401_binary_watch/SolutionTest.kt b/src/test/kotlin/g0401_0500/s0401_binary_watch/SolutionTest.kt
index 8874d8349..4a5939c96 100644
--- a/src/test/kotlin/g0401_0500/s0401_binary_watch/SolutionTest.kt
+++ b/src/test/kotlin/g0401_0500/s0401_binary_watch/SolutionTest.kt
@@ -12,9 +12,9 @@ internal class SolutionTest {
             equalTo(
                 listOf(
                     "0:01", "0:02", "0:04", "0:08", "0:16", "0:32", "1:00", "2:00",
-                    "4:00", "8:00"
-                )
-            )
+                    "4:00", "8:00",
+                ),
+            ),
         )
     }
 
@@ -23,8 +23,8 @@ internal class SolutionTest {
         assertThat(
             Solution().readBinaryWatch(9),
             equalTo(
-                listOf()
-            )
+                listOf(),
+            ),
         )
     }
 }
diff --git a/src/test/kotlin/g0401_0500/s0404_sum_of_left_leaves/SolutionTest.kt b/src/test/kotlin/g0401_0500/s0404_sum_of_left_leaves/SolutionTest.kt
index e877d848f..180261bfc 100644
--- a/src/test/kotlin/g0401_0500/s0404_sum_of_left_leaves/SolutionTest.kt
+++ b/src/test/kotlin/g0401_0500/s0404_sum_of_left_leaves/SolutionTest.kt
@@ -11,9 +11,9 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .sumOfLeftLeaves(
-                    TreeNode.create(listOf(3, 9, 20, null, null, 15, 7))!!
+                    TreeNode.create(listOf(3, 9, 20, null, null, 15, 7))!!,
                 ),
-            equalTo(24)
+            equalTo(24),
         )
     }
 
diff --git a/src/test/kotlin/g0401_0500/s0406_queue_reconstruction_by_height/SolutionTest.kt b/src/test/kotlin/g0401_0500/s0406_queue_reconstruction_by_height/SolutionTest.kt
index 85ed64621..085caf47a 100644
--- a/src/test/kotlin/g0401_0500/s0406_queue_reconstruction_by_height/SolutionTest.kt
+++ b/src/test/kotlin/g0401_0500/s0406_queue_reconstruction_by_height/SolutionTest.kt
@@ -16,8 +16,8 @@ internal class SolutionTest {
                         intArrayOf(7, 1),
                         intArrayOf(5, 0),
                         intArrayOf(6, 1),
-                        intArrayOf(5, 2)
-                    )
+                        intArrayOf(5, 2),
+                    ),
                 ),
             equalTo(
                 arrayOf(
@@ -26,9 +26,9 @@ internal class SolutionTest {
                     intArrayOf(5, 2),
                     intArrayOf(6, 1),
                     intArrayOf(4, 4),
-                    intArrayOf(7, 1)
-                )
-            )
+                    intArrayOf(7, 1),
+                ),
+            ),
         )
     }
 
@@ -43,8 +43,8 @@ internal class SolutionTest {
                         intArrayOf(4, 0),
                         intArrayOf(3, 2),
                         intArrayOf(2, 2),
-                        intArrayOf(1, 4)
-                    )
+                        intArrayOf(1, 4),
+                    ),
                 ),
             equalTo(
                 arrayOf(
@@ -53,9 +53,9 @@ internal class SolutionTest {
                     intArrayOf(2, 2),
                     intArrayOf(3, 2),
                     intArrayOf(1, 4),
-                    intArrayOf(6, 0)
-                )
-            )
+                    intArrayOf(6, 0),
+                ),
+            ),
         )
     }
 }
diff --git a/src/test/kotlin/g0401_0500/s0407_trapping_rain_water_ii/SolutionTest.kt b/src/test/kotlin/g0401_0500/s0407_trapping_rain_water_ii/SolutionTest.kt
index 61d46da0b..4b391ab18 100644
--- a/src/test/kotlin/g0401_0500/s0407_trapping_rain_water_ii/SolutionTest.kt
+++ b/src/test/kotlin/g0401_0500/s0407_trapping_rain_water_ii/SolutionTest.kt
@@ -13,10 +13,10 @@ internal class SolutionTest {
                     arrayOf(
                         intArrayOf(1, 4, 3, 1, 3, 2),
                         intArrayOf(3, 2, 1, 3, 2, 4),
-                        intArrayOf(2, 3, 3, 2, 3, 1)
-                    )
+                        intArrayOf(2, 3, 3, 2, 3, 1),
+                    ),
                 ),
-            equalTo(4)
+            equalTo(4),
         )
     }
 
@@ -30,10 +30,10 @@ internal class SolutionTest {
                         intArrayOf(3, 2, 2, 2, 3),
                         intArrayOf(3, 2, 1, 2, 3),
                         intArrayOf(3, 2, 2, 2, 3),
-                        intArrayOf(3, 3, 3, 3, 3)
-                    )
+                        intArrayOf(3, 3, 3, 3, 3),
+                    ),
                 ),
-            equalTo(10)
+            equalTo(10),
         )
     }
 }
diff --git a/src/test/kotlin/g0401_0500/s0412_fizz_buzz/SolutionTest.kt b/src/test/kotlin/g0401_0500/s0412_fizz_buzz/SolutionTest.kt
index 06dc5589b..ed3756380 100644
--- a/src/test/kotlin/g0401_0500/s0412_fizz_buzz/SolutionTest.kt
+++ b/src/test/kotlin/g0401_0500/s0412_fizz_buzz/SolutionTest.kt
@@ -13,7 +13,8 @@ internal class SolutionTest {
     @Test
     fun fizzBuzz2() {
         assertThat(
-            Solution().fizzBuzz(5), equalTo(arrayOf("1", "2", "Fizz", "4", "Buzz"))
+            Solution().fizzBuzz(5),
+            equalTo(arrayOf("1", "2", "Fizz", "4", "Buzz")),
         )
     }
 
@@ -37,9 +38,9 @@ internal class SolutionTest {
                     "Fizz",
                     "13",
                     "14",
-                    "FizzBuzz"
-                )
-            )
+                    "FizzBuzz",
+                ),
+            ),
         )
     }
 }
diff --git a/src/test/kotlin/g0401_0500/s0417_pacific_atlantic_water_flow/SolutionTest.kt b/src/test/kotlin/g0401_0500/s0417_pacific_atlantic_water_flow/SolutionTest.kt
index 0b3655565..4a8c8b04c 100644
--- a/src/test/kotlin/g0401_0500/s0417_pacific_atlantic_water_flow/SolutionTest.kt
+++ b/src/test/kotlin/g0401_0500/s0417_pacific_atlantic_water_flow/SolutionTest.kt
@@ -17,18 +17,21 @@ internal class SolutionTest {
                         intArrayOf(0, 2),
                         intArrayOf(1, 1),
                         intArrayOf(1, 2),
-                        intArrayOf(2, 0)
-                    )
-                )
-            )
+                        intArrayOf(2, 0),
+                    ),
+                ),
+            ),
         )
     }
 
     @Test
     fun pacificAtlantic2() {
         val matrix = arrayOf(
-            intArrayOf(1, 2, 2, 3, 5), intArrayOf(3, 2, 3, 4, 4), intArrayOf(2, 4, 5, 3, 1),
-            intArrayOf(6, 7, 1, 4, 5), intArrayOf(5, 1, 1, 2, 4)
+            intArrayOf(1, 2, 2, 3, 5),
+            intArrayOf(3, 2, 3, 4, 4),
+            intArrayOf(2, 4, 5, 3, 1),
+            intArrayOf(6, 7, 1, 4, 5),
+            intArrayOf(5, 1, 1, 2, 4),
         )
         assertThat(
             Solution().pacificAtlantic(matrix),
@@ -42,9 +45,9 @@ internal class SolutionTest {
                         intArrayOf(3, 0),
                         intArrayOf(3, 1),
                         intArrayOf(4, 0),
-                    )
-                )
-            )
+                    ),
+                ),
+            ),
         )
     }
 
@@ -56,10 +59,10 @@ internal class SolutionTest {
             equalTo(
                 ArrayUtils.getLists(
                     arrayOf(
-                        intArrayOf(0, 0)
-                    )
-                )
-            )
+                        intArrayOf(0, 0),
+                    ),
+                ),
+            ),
         )
     }
 }
diff --git a/src/test/kotlin/g0401_0500/s0421_maximum_xor_of_two_numbers_in_an_array/SolutionTest.kt b/src/test/kotlin/g0401_0500/s0421_maximum_xor_of_two_numbers_in_an_array/SolutionTest.kt
index 8f3cded4a..8a6ba27a9 100644
--- a/src/test/kotlin/g0401_0500/s0421_maximum_xor_of_two_numbers_in_an_array/SolutionTest.kt
+++ b/src/test/kotlin/g0401_0500/s0421_maximum_xor_of_two_numbers_in_an_array/SolutionTest.kt
@@ -15,7 +15,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .findMaximumXOR(intArrayOf(14, 70, 53, 83, 49, 91, 36, 80, 92, 51, 66, 70)),
-            equalTo(127)
+            equalTo(127),
         )
     }
 }
diff --git a/src/test/kotlin/g0401_0500/s0427_construct_quad_tree/SolutionTest.kt b/src/test/kotlin/g0401_0500/s0427_construct_quad_tree/SolutionTest.kt
index 6995bdaca..0db6ab75f 100644
--- a/src/test/kotlin/g0401_0500/s0427_construct_quad_tree/SolutionTest.kt
+++ b/src/test/kotlin/g0401_0500/s0427_construct_quad_tree/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun construct() {
         assertThat(
             Solution().construct(arrayOf(intArrayOf(0, 1), intArrayOf(1, 0))).toString(),
-            equalTo("[0,1][1,0][1,1][1,1][1,0]")
+            equalTo("[0,1][1,0][1,1][1,1][1,0]"),
         )
     }
 
@@ -26,11 +26,11 @@ internal class SolutionTest {
                         intArrayOf(1, 1, 1, 1, 0, 0, 0, 0),
                         intArrayOf(1, 1, 1, 1, 0, 0, 0, 0),
                         intArrayOf(1, 1, 1, 1, 0, 0, 0, 0),
-                        intArrayOf(1, 1, 1, 1, 0, 0, 0, 0)
-                    )
+                        intArrayOf(1, 1, 1, 1, 0, 0, 0, 0),
+                    ),
                 )
                 .toString(),
-            equalTo("[0,1][1,1][0,1][1,1][1,0]")
+            equalTo("[0,1][1,1][0,1][1,1][1,0]"),
         )
     }
 }
diff --git a/src/test/kotlin/g0401_0500/s0430_flatten_a_multilevel_doubly_linked_list/SolutionTest.kt b/src/test/kotlin/g0401_0500/s0430_flatten_a_multilevel_doubly_linked_list/SolutionTest.kt
index 95ba6fe72..93bfb13bf 100644
--- a/src/test/kotlin/g0401_0500/s0430_flatten_a_multilevel_doubly_linked_list/SolutionTest.kt
+++ b/src/test/kotlin/g0401_0500/s0430_flatten_a_multilevel_doubly_linked_list/SolutionTest.kt
@@ -45,8 +45,8 @@ internal class SolutionTest {
                 "Node{val=1,next=Node{" +
                     "val=2,next=Node{val=3,next=Node{val=7,next=Node{val=8,next=Node{val=11,next=" +
                     "Node{val=12,next=Node{val=9,next=Node{val=10,next=Node{val=4,next=Node{val=5" +
-                    ",next=Node{val=6,next=null}}}}}}}}}}}}"
-            )
+                    ",next=Node{val=6,next=null}}}}}}}}}}}}",
+            ),
         )
     }
 }
diff --git a/src/test/kotlin/g0401_0500/s0433_minimum_genetic_mutation/SolutionTest.kt b/src/test/kotlin/g0401_0500/s0433_minimum_genetic_mutation/SolutionTest.kt
index 790d3a2f8..e43d10012 100644
--- a/src/test/kotlin/g0401_0500/s0433_minimum_genetic_mutation/SolutionTest.kt
+++ b/src/test/kotlin/g0401_0500/s0433_minimum_genetic_mutation/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun minMutation() {
         assertThat(
             Solution().minMutation("AACCGGTT", "AACCGGTA", arrayOf("AACCGGTA")),
-            equalTo(1)
+            equalTo(1),
         )
     }
 
@@ -19,9 +19,10 @@ internal class SolutionTest {
             Solution()
                 .minMutation(
                     "AACCGGTT",
-                    "AAACGGTA", arrayOf("AACCGGTA", "AACCGCTA", "AAACGGTA")
+                    "AAACGGTA",
+                    arrayOf("AACCGGTA", "AACCGCTA", "AAACGGTA"),
                 ),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -31,9 +32,10 @@ internal class SolutionTest {
             Solution()
                 .minMutation(
                     "AAAAACCC",
-                    "AACCCCCC", arrayOf("AAAACCCC", "AAACCCCC", "AACCCCCC")
+                    "AACCCCCC",
+                    arrayOf("AAAACCCC", "AAACCCCC", "AACCCCCC"),
                 ),
-            equalTo(3)
+            equalTo(3),
         )
     }
 }
diff --git a/src/test/kotlin/g0401_0500/s0435_non_overlapping_intervals/SolutionTest.kt b/src/test/kotlin/g0401_0500/s0435_non_overlapping_intervals/SolutionTest.kt
index 7b7362d62..ad4f164e4 100644
--- a/src/test/kotlin/g0401_0500/s0435_non_overlapping_intervals/SolutionTest.kt
+++ b/src/test/kotlin/g0401_0500/s0435_non_overlapping_intervals/SolutionTest.kt
@@ -13,10 +13,10 @@ internal class SolutionTest {
                     intArrayOf(1, 2),
                     intArrayOf(2, 3),
                     intArrayOf(3, 4),
-                    intArrayOf(1, 3)
-                )
+                    intArrayOf(1, 3),
+                ),
             ),
-            equalTo(1)
+            equalTo(1),
         )
     }
 
@@ -24,7 +24,7 @@ internal class SolutionTest {
     fun eraseOverlapIntervals2() {
         assertThat(
             Solution().eraseOverlapIntervals(arrayOf(intArrayOf(1, 2), intArrayOf(1, 2), intArrayOf(1, 2))),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
diff --git a/src/test/kotlin/g0401_0500/s0436_find_right_interval/SolutionTest.kt b/src/test/kotlin/g0401_0500/s0436_find_right_interval/SolutionTest.kt
index 67e455cb3..71084996e 100644
--- a/src/test/kotlin/g0401_0500/s0436_find_right_interval/SolutionTest.kt
+++ b/src/test/kotlin/g0401_0500/s0436_find_right_interval/SolutionTest.kt
@@ -14,7 +14,7 @@ internal class SolutionTest {
     fun findRightInterval2() {
         assertThat(
             Solution().findRightInterval(arrayOf(intArrayOf(3, 4), intArrayOf(2, 3), intArrayOf(1, 2))),
-            equalTo(intArrayOf(-1, 0, 1))
+            equalTo(intArrayOf(-1, 0, 1)),
         )
     }
 }
diff --git a/src/test/kotlin/g0401_0500/s0437_path_sum_iii/SolutionTest.kt b/src/test/kotlin/g0401_0500/s0437_path_sum_iii/SolutionTest.kt
index 2bfd6f49b..b97b9bd2d 100644
--- a/src/test/kotlin/g0401_0500/s0437_path_sum_iii/SolutionTest.kt
+++ b/src/test/kotlin/g0401_0500/s0437_path_sum_iii/SolutionTest.kt
@@ -12,11 +12,11 @@ internal class SolutionTest {
             Solution()
                 .pathSum(
                     TreeNode.create(
-                        listOf(10, 5, -3, 3, 2, null, 11, 3, -2, null, 1)
+                        listOf(10, 5, -3, 3, 2, null, 11, 3, -2, null, 1),
                     ),
-                    8
+                    8,
                 ),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
@@ -27,12 +27,12 @@ internal class SolutionTest {
                 .pathSum(
                     TreeNode.create(
                         listOf(
-                            5, 4, 8, 11, null, 13, 4, 7, 2, null, null, 5, 1
-                        )
+                            5, 4, 8, 11, null, 13, 4, 7, 2, null, null, 5, 1,
+                        ),
                     ),
-                    22
+                    22,
                 ),
-            equalTo(3)
+            equalTo(3),
         )
     }
 }
diff --git a/src/test/kotlin/g0401_0500/s0442_find_all_duplicates_in_an_array/SolutionTest.kt b/src/test/kotlin/g0401_0500/s0442_find_all_duplicates_in_an_array/SolutionTest.kt
index 4b38ba20e..f80177da9 100644
--- a/src/test/kotlin/g0401_0500/s0442_find_all_duplicates_in_an_array/SolutionTest.kt
+++ b/src/test/kotlin/g0401_0500/s0442_find_all_duplicates_in_an_array/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun findDuplicates() {
         assertThat(
             Solution().findDuplicates(intArrayOf(4, 3, 2, 7, 8, 2, 3, 1)),
-            equalTo(listOf(2, 3))
+            equalTo(listOf(2, 3)),
         )
     }
 
diff --git a/src/test/kotlin/g0401_0500/s0443_string_compression/SolutionTest.kt b/src/test/kotlin/g0401_0500/s0443_string_compression/SolutionTest.kt
index 9f6eca609..ea04c4094 100644
--- a/src/test/kotlin/g0401_0500/s0443_string_compression/SolutionTest.kt
+++ b/src/test/kotlin/g0401_0500/s0443_string_compression/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun compress() {
         assertThat(
             Solution().compress(charArrayOf('a', 'a', 'b', 'b', 'c', 'c', 'c')),
-            equalTo(6)
+            equalTo(6),
         )
     }
 
@@ -24,10 +24,10 @@ internal class SolutionTest {
             Solution()
                 .compress(
                     charArrayOf(
-                        'a', 'b', 'b', 'b', 'b', 'b', 'b', 'b', 'b', 'b', 'b', 'b', 'b'
-                    )
+                        'a', 'b', 'b', 'b', 'b', 'b', 'b', 'b', 'b', 'b', 'b', 'b', 'b',
+                    ),
                 ),
-            equalTo(4)
+            equalTo(4),
         )
     }
 }
diff --git a/src/test/kotlin/g0401_0500/s0447_number_of_boomerangs/SolutionTest.kt b/src/test/kotlin/g0401_0500/s0447_number_of_boomerangs/SolutionTest.kt
index 7fce8ecd7..9941c9058 100644
--- a/src/test/kotlin/g0401_0500/s0447_number_of_boomerangs/SolutionTest.kt
+++ b/src/test/kotlin/g0401_0500/s0447_number_of_boomerangs/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun numberOfBoomerangs() {
         assertThat(
             Solution().numberOfBoomerangs(arrayOf(intArrayOf(0, 0), intArrayOf(1, 0), intArrayOf(2, 0))),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun numberOfBoomerangs2() {
         assertThat(
             Solution().numberOfBoomerangs(arrayOf(intArrayOf(1, 1), intArrayOf(2, 2), intArrayOf(3, 3))),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
diff --git a/src/test/kotlin/g0401_0500/s0448_find_all_numbers_disappeared_in_an_array/SolutionTest.kt b/src/test/kotlin/g0401_0500/s0448_find_all_numbers_disappeared_in_an_array/SolutionTest.kt
index 2692d48ce..81982352e 100644
--- a/src/test/kotlin/g0401_0500/s0448_find_all_numbers_disappeared_in_an_array/SolutionTest.kt
+++ b/src/test/kotlin/g0401_0500/s0448_find_all_numbers_disappeared_in_an_array/SolutionTest.kt
@@ -9,14 +9,15 @@ internal class SolutionTest {
     fun findDisappearedNumbers() {
         assertThat(
             Solution().findDisappearedNumbers(intArrayOf(4, 3, 2, 7, 8, 2, 3, 1)),
-            equalTo(listOf(5, 6))
+            equalTo(listOf(5, 6)),
         )
     }
 
     @Test
     fun findDisappearedNumbers2() {
         assertThat(
-            Solution().findDisappearedNumbers(intArrayOf(1, 1)), equalTo(listOf(2))
+            Solution().findDisappearedNumbers(intArrayOf(1, 1)),
+            equalTo(listOf(2)),
         )
     }
 }
diff --git a/src/test/kotlin/g0401_0500/s0449_serialize_and_deserialize_bst/CodecTest.kt b/src/test/kotlin/g0401_0500/s0449_serialize_and_deserialize_bst/CodecTest.kt
index b4ba81d8f..f2c003589 100644
--- a/src/test/kotlin/g0401_0500/s0449_serialize_and_deserialize_bst/CodecTest.kt
+++ b/src/test/kotlin/g0401_0500/s0449_serialize_and_deserialize_bst/CodecTest.kt
@@ -14,19 +14,19 @@ internal class CodecTest {
         expectedRoot.left!!.right = TreeNode(2)
         assertThat(
             Codec().deserialize(Codec().serialize(expectedRoot)).toString(),
-            equalTo(expectedRoot.toString())
+            equalTo(expectedRoot.toString()),
         )
         assertThat(
             Codec().deserialize(Codec().serialize(expectedRoot)).toString(),
-            equalTo(expectedRoot.toString())
+            equalTo(expectedRoot.toString()),
         )
         assertThat(
             Codec().deserialize(Codec().serialize(expectedRoot)).toString(),
-            equalTo(expectedRoot.toString())
+            equalTo(expectedRoot.toString()),
         )
         assertThat(
             Codec().deserialize(Codec().serialize(expectedRoot)).toString(),
-            equalTo(expectedRoot.toString())
+            equalTo(expectedRoot.toString()),
         )
     }
 }
diff --git a/src/test/kotlin/g0401_0500/s0454_4sum_ii/SolutionTest.kt b/src/test/kotlin/g0401_0500/s0454_4sum_ii/SolutionTest.kt
index 207dd7714..1809b1c47 100644
--- a/src/test/kotlin/g0401_0500/s0454_4sum_ii/SolutionTest.kt
+++ b/src/test/kotlin/g0401_0500/s0454_4sum_ii/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .fourSumCount(intArrayOf(1, 2), intArrayOf(-2, -1), intArrayOf(-1, 2), intArrayOf(0, 2)),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -19,7 +19,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .fourSumCount(intArrayOf(0), intArrayOf(0), intArrayOf(0), intArrayOf(0)),
-            equalTo(1)
+            equalTo(1),
         )
     }
 }
diff --git a/src/test/kotlin/g0401_0500/s0455_assign_cookies/SolutionTest.kt b/src/test/kotlin/g0401_0500/s0455_assign_cookies/SolutionTest.kt
index f73b73ff5..34e23a816 100644
--- a/src/test/kotlin/g0401_0500/s0455_assign_cookies/SolutionTest.kt
+++ b/src/test/kotlin/g0401_0500/s0455_assign_cookies/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun findContentChildren() {
         assertThat(
             Solution().findContentChildren(intArrayOf(1, 2, 3), intArrayOf(1, 1)),
-            equalTo(1)
+            equalTo(1),
         )
     }
 
@@ -19,11 +19,12 @@ internal class SolutionTest {
             Solution()
                 .findContentChildren(
                     intArrayOf(
-                        1, 2
+                        1,
+                        2,
                     ),
-                    intArrayOf(1, 2, 3)
+                    intArrayOf(1, 2, 3),
                 ),
-            equalTo(2)
+            equalTo(2),
         )
     }
 }
diff --git a/src/test/kotlin/g0401_0500/s0463_island_perimeter/SolutionTest.kt b/src/test/kotlin/g0401_0500/s0463_island_perimeter/SolutionTest.kt
index 30ff72ff0..258835160 100644
--- a/src/test/kotlin/g0401_0500/s0463_island_perimeter/SolutionTest.kt
+++ b/src/test/kotlin/g0401_0500/s0463_island_perimeter/SolutionTest.kt
@@ -14,10 +14,10 @@ internal class SolutionTest {
                         intArrayOf(0, 1, 0, 0),
                         intArrayOf(1, 1, 1, 0),
                         intArrayOf(0, 1, 0, 0),
-                        intArrayOf(1, 1, 0, 0)
-                    )
+                        intArrayOf(1, 1, 0, 0),
+                    ),
                 ),
-            equalTo(16)
+            equalTo(16),
         )
     }
 
diff --git a/src/test/kotlin/g0401_0500/s0468_validate_ip_address/SolutionTest.kt b/src/test/kotlin/g0401_0500/s0468_validate_ip_address/SolutionTest.kt
index c472ff5c6..3044faa0d 100644
--- a/src/test/kotlin/g0401_0500/s0468_validate_ip_address/SolutionTest.kt
+++ b/src/test/kotlin/g0401_0500/s0468_validate_ip_address/SolutionTest.kt
@@ -14,7 +14,7 @@ internal class SolutionTest {
     fun validIPAddress2() {
         assertThat(
             Solution().validIPAddress("2001:0db8:85a3:0:0:8A2E:0370:7334"),
-            equalTo("IPv6")
+            equalTo("IPv6"),
         )
     }
 
diff --git a/src/test/kotlin/g0401_0500/s0472_concatenated_words/SolutionTest.kt b/src/test/kotlin/g0401_0500/s0472_concatenated_words/SolutionTest.kt
index 5b459cf07..199368efd 100644
--- a/src/test/kotlin/g0401_0500/s0472_concatenated_words/SolutionTest.kt
+++ b/src/test/kotlin/g0401_0500/s0472_concatenated_words/SolutionTest.kt
@@ -10,11 +10,11 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .findAllConcatenatedWordsInADict(
-                    arrayOf("cat", "cats", "catsdogcats", "dog", "dogcatsdog", "hippopotamuses", "rat", "ratcatdogcat")
+                    arrayOf("cat", "cats", "catsdogcats", "dog", "dogcatsdog", "hippopotamuses", "rat", "ratcatdogcat"),
                 ),
             equalTo(
-                arrayOf("dogcatsdog", "catsdogcats", "ratcatdogcat").toList()
-            )
+                arrayOf("dogcatsdog", "catsdogcats", "ratcatdogcat").toList(),
+            ),
         )
     }
 
@@ -23,11 +23,11 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .findAllConcatenatedWordsInADict(
-                    arrayOf("cat", "dog", "catdog")
+                    arrayOf("cat", "dog", "catdog"),
                 ),
             equalTo(
-                arrayOf("catdog").toList()
-            )
+                arrayOf("catdog").toList(),
+            ),
         )
     }
 }
diff --git a/src/test/kotlin/g0401_0500/s0474_ones_and_zeroes/SolutionTest.kt b/src/test/kotlin/g0401_0500/s0474_ones_and_zeroes/SolutionTest.kt
index 2a6026ab1..0202674c0 100644
--- a/src/test/kotlin/g0401_0500/s0474_ones_and_zeroes/SolutionTest.kt
+++ b/src/test/kotlin/g0401_0500/s0474_ones_and_zeroes/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun findMaxForm() {
         assertThat(
             Solution().findMaxForm(arrayOf("10", "0001", "111001", "1", "0"), 5, 3),
-            equalTo(4)
+            equalTo(4),
         )
     }
 
diff --git a/src/test/kotlin/g0401_0500/s0480_sliding_window_median/SolutionTest.kt b/src/test/kotlin/g0401_0500/s0480_sliding_window_median/SolutionTest.kt
index afb82f887..f637ed1a3 100644
--- a/src/test/kotlin/g0401_0500/s0480_sliding_window_median/SolutionTest.kt
+++ b/src/test/kotlin/g0401_0500/s0480_sliding_window_median/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun medianSlidingWindow() {
         assertThat(
             Solution().medianSlidingWindow(intArrayOf(1, 3, -1, -3, 5, 3, 6, 7), 3),
-            equalTo(doubleArrayOf(1.00000, -1.00000, -1.00000, 3.00000, 5.00000, 6.00000))
+            equalTo(doubleArrayOf(1.00000, -1.00000, -1.00000, 3.00000, 5.00000, 6.00000)),
         )
     }
 
@@ -19,9 +19,15 @@ internal class SolutionTest {
             Solution().medianSlidingWindow(intArrayOf(1, 2, 3, 4, 2, 3, 1, 4, 2), 3),
             equalTo(
                 doubleArrayOf(
-                    2.00000, 3.00000, 3.00000, 3.00000, 2.00000, 3.00000, 2.00000
-                )
-            )
+                    2.00000,
+                    3.00000,
+                    3.00000,
+                    3.00000,
+                    2.00000,
+                    3.00000,
+                    2.00000,
+                ),
+            ),
         )
     }
 }
diff --git a/src/test/kotlin/g0401_0500/s0483_smallest_good_base/SolutionTest.kt b/src/test/kotlin/g0401_0500/s0483_smallest_good_base/SolutionTest.kt
index 5197e0172..5475617af 100644
--- a/src/test/kotlin/g0401_0500/s0483_smallest_good_base/SolutionTest.kt
+++ b/src/test/kotlin/g0401_0500/s0483_smallest_good_base/SolutionTest.kt
@@ -19,7 +19,7 @@ internal class SolutionTest {
     fun smallestGoodBase3() {
         assertThat(
             Solution().smallestGoodBase("1000000000000000000"),
-            equalTo("999999999999999999")
+            equalTo("999999999999999999"),
         )
     }
 }
diff --git a/src/test/kotlin/g0401_0500/s0491_increasing_subsequences/SolutionTest.kt b/src/test/kotlin/g0401_0500/s0491_increasing_subsequences/SolutionTest.kt
index aafd4d340..0610d4e3a 100644
--- a/src/test/kotlin/g0401_0500/s0491_increasing_subsequences/SolutionTest.kt
+++ b/src/test/kotlin/g0401_0500/s0491_increasing_subsequences/SolutionTest.kt
@@ -17,17 +17,17 @@ internal class SolutionTest {
                 listOf(4, 7, 7),
                 listOf(6, 7),
                 listOf(6, 7, 7),
-                listOf(7, 7)
-            )
+                listOf(7, 7),
+            ),
         )
         val result = Solution().findSubsequences(intArrayOf(4, 6, 7, 7))
         result.forEach(
             Consumer { e: List<Int> ->
                 assertThat(
                     expected.contains(e),
-                    equalTo(true)
+                    equalTo(true),
                 )
-            }
+            },
         )
     }
 
diff --git a/src/test/kotlin/g0401_0500/s0496_next_greater_element_i/SolutionTest.kt b/src/test/kotlin/g0401_0500/s0496_next_greater_element_i/SolutionTest.kt
index e9c82b3f7..8bd4d7761 100644
--- a/src/test/kotlin/g0401_0500/s0496_next_greater_element_i/SolutionTest.kt
+++ b/src/test/kotlin/g0401_0500/s0496_next_greater_element_i/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun nextGreaterElement() {
         assertThat(
             Solution().nextGreaterElement(intArrayOf(4, 1, 2), intArrayOf(1, 3, 4, 2)),
-            equalTo(intArrayOf(-1, 3, -1))
+            equalTo(intArrayOf(-1, 3, -1)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun nextGreaterElement2() {
         assertThat(
             Solution().nextGreaterElement(intArrayOf(2, 4), intArrayOf(1, 2, 3, 4)),
-            equalTo(intArrayOf(3, -1))
+            equalTo(intArrayOf(3, -1)),
         )
     }
 }
diff --git a/src/test/kotlin/g0401_0500/s0498_diagonal_traverse/SolutionTest.kt b/src/test/kotlin/g0401_0500/s0498_diagonal_traverse/SolutionTest.kt
index 5891090c2..3c7c0e82c 100644
--- a/src/test/kotlin/g0401_0500/s0498_diagonal_traverse/SolutionTest.kt
+++ b/src/test/kotlin/g0401_0500/s0498_diagonal_traverse/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun findDiagonalOrder() {
         assertThat(
             Solution().findDiagonalOrder(arrayOf(intArrayOf(1, 2, 3), intArrayOf(4, 5, 6), intArrayOf(7, 8, 9))),
-            equalTo(intArrayOf(1, 2, 4, 7, 5, 3, 6, 8, 9))
+            equalTo(intArrayOf(1, 2, 4, 7, 5, 3, 6, 8, 9)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun findDiagonalOrder2() {
         assertThat(
             Solution().findDiagonalOrder(arrayOf(intArrayOf(1, 2), intArrayOf(3, 4))),
-            equalTo(intArrayOf(1, 2, 3, 4))
+            equalTo(intArrayOf(1, 2, 3, 4)),
         )
     }
 }
diff --git a/src/test/kotlin/g0401_0500/s0500_keyboard_row/SolutionTest.kt b/src/test/kotlin/g0401_0500/s0500_keyboard_row/SolutionTest.kt
index 17a9d5360..a51199e1c 100644
--- a/src/test/kotlin/g0401_0500/s0500_keyboard_row/SolutionTest.kt
+++ b/src/test/kotlin/g0401_0500/s0500_keyboard_row/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun findWords() {
         assertThat(
             Solution().findWords(arrayOf("Hello", "Alaska", "Dad", "Peace")),
-            equalTo(arrayOf("Alaska", "Dad"))
+            equalTo(arrayOf("Alaska", "Dad")),
         )
     }
 
@@ -22,7 +22,7 @@ internal class SolutionTest {
     fun findWords3() {
         assertThat(
             Solution().findWords(arrayOf("adsdf", "sfd")),
-            equalTo(arrayOf("adsdf", "sfd"))
+            equalTo(arrayOf("adsdf", "sfd")),
         )
     }
 }
diff --git a/src/test/kotlin/g0501_0600/s0502_ipo/SolutionTest.kt b/src/test/kotlin/g0501_0600/s0502_ipo/SolutionTest.kt
index 839eaa110..9d947600c 100644
--- a/src/test/kotlin/g0501_0600/s0502_ipo/SolutionTest.kt
+++ b/src/test/kotlin/g0501_0600/s0502_ipo/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun findMaximizedCapital() {
         assertThat(
             Solution().findMaximizedCapital(2, 0, intArrayOf(1, 2, 3), intArrayOf(0, 1, 1)),
-            equalTo(4)
+            equalTo(4),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun findMaximizedCapital2() {
         assertThat(
             Solution().findMaximizedCapital(3, 0, intArrayOf(1, 2, 3), intArrayOf(0, 1, 2)),
-            equalTo(6)
+            equalTo(6),
         )
     }
 }
diff --git a/src/test/kotlin/g0501_0600/s0503_next_greater_element_ii/SolutionTest.kt b/src/test/kotlin/g0501_0600/s0503_next_greater_element_ii/SolutionTest.kt
index 7c4818351..bb266a9ea 100644
--- a/src/test/kotlin/g0501_0600/s0503_next_greater_element_ii/SolutionTest.kt
+++ b/src/test/kotlin/g0501_0600/s0503_next_greater_element_ii/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun nextGreaterElements() {
         assertThat(
             Solution().nextGreaterElements(intArrayOf(1, 2, 1)),
-            equalTo(intArrayOf(2, -1, 2))
+            equalTo(intArrayOf(2, -1, 2)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun nextGreaterElements2() {
         assertThat(
             Solution().nextGreaterElements(intArrayOf(1, 2, 3, 4, 3)),
-            equalTo(intArrayOf(2, 3, 4, -1, 4))
+            equalTo(intArrayOf(2, 3, 4, -1, 4)),
         )
     }
 }
diff --git a/src/test/kotlin/g0501_0600/s0506_relative_ranks/SolutionTest.kt b/src/test/kotlin/g0501_0600/s0506_relative_ranks/SolutionTest.kt
index 12bc5a3b9..15929104d 100644
--- a/src/test/kotlin/g0501_0600/s0506_relative_ranks/SolutionTest.kt
+++ b/src/test/kotlin/g0501_0600/s0506_relative_ranks/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun findRelativeRanks() {
         assertThat(
             Solution().findRelativeRanks(intArrayOf(5, 4, 3, 2, 1)),
-            equalTo(arrayOf("Gold Medal", "Silver Medal", "Bronze Medal", "4", "5"))
+            equalTo(arrayOf("Gold Medal", "Silver Medal", "Bronze Medal", "4", "5")),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun findRelativeRanks2() {
         assertThat(
             Solution().findRelativeRanks(intArrayOf(10, 3, 8, 9, 4)),
-            equalTo(arrayOf("Gold Medal", "5", "Bronze Medal", "Silver Medal", "4"))
+            equalTo(arrayOf("Gold Medal", "5", "Bronze Medal", "Silver Medal", "4")),
         )
     }
 }
diff --git a/src/test/kotlin/g0501_0600/s0511_game_play_analysis_i/MysqlTest.kt b/src/test/kotlin/g0501_0600/s0511_game_play_analysis_i/MysqlTest.kt
index 82d6a2789..f19db2365 100644
--- a/src/test/kotlin/g0501_0600/s0511_game_play_analysis_i/MysqlTest.kt
+++ b/src/test/kotlin/g0501_0600/s0511_game_play_analysis_i/MysqlTest.kt
@@ -27,8 +27,8 @@ import javax.sql.DataSource
             "INSERT INTO Activity(player_id, device_id, event_date, games_played)" +
             " VALUES (3, 1, '2016-03-02', 0); " +
             "INSERT INTO Activity(player_id, device_id, event_date, games_played)" +
-            " VALUES (3, 4, '2018-07-03', 5); "
-    ]
+            " VALUES (3, 4, '2018-07-03', 5); ",
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -40,12 +40,12 @@ internal class MysqlTest {
                     BufferedReader(
                         FileReader(
                             "src/main/kotlin/g0501_0600/" +
-                                "s0511_game_play_analysis_i/script.sql"
-                        )
+                                "s0511_game_play_analysis_i/script.sql",
+                        ),
                     )
                         .lines()
                         .collect(Collectors.joining("\n"))
-                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace("#.*?\\r?\\n".toRegex(), ""),
                 ).use { resultSet ->
                     assertThat(resultSet.next(), equalTo(true))
                     assertThat(resultSet.getInt(1), equalTo(1))
diff --git a/src/test/kotlin/g0501_0600/s0524_longest_word_in_dictionary_through_deleting/SolutionTest.kt b/src/test/kotlin/g0501_0600/s0524_longest_word_in_dictionary_through_deleting/SolutionTest.kt
index 50f2f58df..fbde9ab4f 100644
--- a/src/test/kotlin/g0501_0600/s0524_longest_word_in_dictionary_through_deleting/SolutionTest.kt
+++ b/src/test/kotlin/g0501_0600/s0524_longest_word_in_dictionary_through_deleting/SolutionTest.kt
@@ -10,9 +10,10 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .findLongestWord(
-                    "abpcplea", listOf("ale", "apple", "monkey", "plea")
+                    "abpcplea",
+                    listOf("ale", "apple", "monkey", "plea"),
                 ),
-            equalTo("apple")
+            equalTo("apple"),
         )
     }
 
@@ -20,7 +21,7 @@ internal class SolutionTest {
     fun findLongestWord2() {
         assertThat(
             Solution().findLongestWord("abpcplea", listOf("a", "b", "c")),
-            equalTo("a")
+            equalTo("a"),
         )
     }
 }
diff --git a/src/test/kotlin/g0501_0600/s0529_minesweeper/SolutionTest.kt b/src/test/kotlin/g0501_0600/s0529_minesweeper/SolutionTest.kt
index ad1382084..010d53f85 100644
--- a/src/test/kotlin/g0501_0600/s0529_minesweeper/SolutionTest.kt
+++ b/src/test/kotlin/g0501_0600/s0529_minesweeper/SolutionTest.kt
@@ -11,13 +11,13 @@ internal class SolutionTest {
             charArrayOf('E', 'E', 'E', 'E', 'E'),
             charArrayOf('E', 'E', 'M', 'E', 'E'),
             charArrayOf('E', 'E', 'E', 'E', 'E'),
-            charArrayOf('E', 'E', 'E', 'E', 'E')
+            charArrayOf('E', 'E', 'E', 'E', 'E'),
         )
         val expected = arrayOf(
             charArrayOf('B', '1', 'E', '1', 'B'),
             charArrayOf('B', '1', 'M', '1', 'B'),
             charArrayOf('B', '1', '1', '1', 'B'),
-            charArrayOf('B', 'B', 'B', 'B', 'B')
+            charArrayOf('B', 'B', 'B', 'B', 'B'),
         )
         assertThat(Solution().updateBoard(input, intArrayOf(3, 0)), equalTo(expected))
     }
@@ -28,13 +28,13 @@ internal class SolutionTest {
             charArrayOf('B', '1', 'E', '1', 'B'),
             charArrayOf('B', '1', 'M', '1', 'B'),
             charArrayOf('B', '1', '1', '1', 'B'),
-            charArrayOf('B', 'B', 'B', 'B', 'B')
+            charArrayOf('B', 'B', 'B', 'B', 'B'),
         )
         val expected = arrayOf(
             charArrayOf('B', '1', 'E', '1', 'B'),
             charArrayOf('B', '1', 'X', '1', 'B'),
             charArrayOf('B', '1', '1', '1', 'B'),
-            charArrayOf('B', 'B', 'B', 'B', 'B')
+            charArrayOf('B', 'B', 'B', 'B', 'B'),
         )
         assertThat(Solution().updateBoard(input, intArrayOf(1, 2)), equalTo(expected))
     }
diff --git a/src/test/kotlin/g0501_0600/s0538_convert_bst_to_greater_tree/SolutionTest.kt b/src/test/kotlin/g0501_0600/s0538_convert_bst_to_greater_tree/SolutionTest.kt
index e1ef42f27..e944309b4 100644
--- a/src/test/kotlin/g0501_0600/s0538_convert_bst_to_greater_tree/SolutionTest.kt
+++ b/src/test/kotlin/g0501_0600/s0538_convert_bst_to_greater_tree/SolutionTest.kt
@@ -10,14 +10,14 @@ internal class SolutionTest {
     fun convertBST() {
         val treeNode: TreeNode = TreeNode.create(
             listOf(
-                4, 1, 6, 0, 2, 5, 7, null, null, null, 3, null, null, null, 8
-            )
+                4, 1, 6, 0, 2, 5, 7, null, null, null, 3, null, null, null, 8,
+            ),
         )!!
         val expected: TreeNode = TreeNode.create(
             listOf(
                 30, 36, 21, 36, 35, 26, 15, null, null, null, 33, null, null, null,
-                8
-            )
+                8,
+            ),
         )!!
         assertThat(Solution().convertBST(treeNode).toString(), equalTo(expected.toString()))
     }
diff --git a/src/test/kotlin/g0501_0600/s0539_minimum_time_difference/SolutionTest.kt b/src/test/kotlin/g0501_0600/s0539_minimum_time_difference/SolutionTest.kt
index 98238713d..33efbab76 100644
--- a/src/test/kotlin/g0501_0600/s0539_minimum_time_difference/SolutionTest.kt
+++ b/src/test/kotlin/g0501_0600/s0539_minimum_time_difference/SolutionTest.kt
@@ -15,7 +15,7 @@ internal class SolutionTest {
     fun findMinDifference2() {
         assertThat(
             Solution().findMinDifference(listOf("00:00", "23:59", "00:00")),
-            equalTo(0)
+            equalTo(0),
         )
     }
 
@@ -40,8 +40,9 @@ internal class SolutionTest {
             timePoints.add(
                 String.format(
                     "%s:%s",
-                    if (hour < 10) "0$hour" else hour, if (minute < 10) "0$minute" else minute
-                )
+                    if (hour < 10) "0$hour" else hour,
+                    if (minute < 10) "0$minute" else minute,
+                ),
             )
             index++
         }
diff --git a/src/test/kotlin/g0501_0600/s0540_single_element_in_a_sorted_array/SolutionTest.kt b/src/test/kotlin/g0501_0600/s0540_single_element_in_a_sorted_array/SolutionTest.kt
index cfe04c281..6edf823de 100644
--- a/src/test/kotlin/g0501_0600/s0540_single_element_in_a_sorted_array/SolutionTest.kt
+++ b/src/test/kotlin/g0501_0600/s0540_single_element_in_a_sorted_array/SolutionTest.kt
@@ -9,14 +9,15 @@ internal class SolutionTest {
     fun singleNonDuplicate() {
         assertThat(
             Solution().singleNonDuplicate(intArrayOf(1, 1, 2, 3, 3, 4, 4, 8, 8)),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
     @Test
     fun singleNonDuplicate2() {
         assertThat(
-            Solution().singleNonDuplicate(intArrayOf(3, 3, 7, 7, 10, 11, 11)), equalTo(10)
+            Solution().singleNonDuplicate(intArrayOf(3, 3, 7, 7, 10, 11, 11)),
+            equalTo(10),
         )
     }
 }
diff --git a/src/test/kotlin/g0501_0600/s0542_01_matrix/SolutionTest.kt b/src/test/kotlin/g0501_0600/s0542_01_matrix/SolutionTest.kt
index 1b128bdb1..f5ddf3b0e 100644
--- a/src/test/kotlin/g0501_0600/s0542_01_matrix/SolutionTest.kt
+++ b/src/test/kotlin/g0501_0600/s0542_01_matrix/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun updateMatrix() {
         assertThat(
             Solution().updateMatrix(arrayOf(intArrayOf(0, 0, 0), intArrayOf(0, 1, 0), intArrayOf(0, 0, 0))),
-            equalTo(arrayOf(intArrayOf(0, 0, 0), intArrayOf(0, 1, 0), intArrayOf(0, 0, 0)))
+            equalTo(arrayOf(intArrayOf(0, 0, 0), intArrayOf(0, 1, 0), intArrayOf(0, 0, 0))),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun updateMatrix2() {
         assertThat(
             Solution().updateMatrix(arrayOf(intArrayOf(0, 0, 0), intArrayOf(0, 1, 0), intArrayOf(1, 1, 1))),
-            equalTo(arrayOf(intArrayOf(0, 0, 0), intArrayOf(0, 1, 0), intArrayOf(1, 2, 1)))
+            equalTo(arrayOf(intArrayOf(0, 0, 0), intArrayOf(0, 1, 0), intArrayOf(1, 2, 1))),
         )
     }
 }
diff --git a/src/test/kotlin/g0501_0600/s0543_diameter_of_binary_tree/SolutionTest.kt b/src/test/kotlin/g0501_0600/s0543_diameter_of_binary_tree/SolutionTest.kt
index 8e8e8e572..e4ee4cafe 100644
--- a/src/test/kotlin/g0501_0600/s0543_diameter_of_binary_tree/SolutionTest.kt
+++ b/src/test/kotlin/g0501_0600/s0543_diameter_of_binary_tree/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
     fun diameterOfBinaryTree() {
         assertThat(
             Solution().diameterOfBinaryTree(TreeNode.create(listOf(1, 2, 3, 4, 5))),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
@@ -18,7 +18,7 @@ internal class SolutionTest {
     fun diameterOfBinaryTree2() {
         assertThat(
             Solution().diameterOfBinaryTree(TreeNode.create(listOf(1, 2))),
-            equalTo(1)
+            equalTo(1),
         )
     }
 }
diff --git a/src/test/kotlin/g0501_0600/s0547_number_of_provinces/SolutionTest.kt b/src/test/kotlin/g0501_0600/s0547_number_of_provinces/SolutionTest.kt
index e10edd077..eb876d757 100644
--- a/src/test/kotlin/g0501_0600/s0547_number_of_provinces/SolutionTest.kt
+++ b/src/test/kotlin/g0501_0600/s0547_number_of_provinces/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun findCircleNum() {
         assertThat(
             Solution().findCircleNum(arrayOf(intArrayOf(1, 1, 0), intArrayOf(1, 1, 0), intArrayOf(0, 0, 1))),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun findCircleNum2() {
         assertThat(
             Solution().findCircleNum(arrayOf(intArrayOf(1, 0, 0), intArrayOf(0, 1, 0), intArrayOf(0, 0, 1))),
-            equalTo(3)
+            equalTo(3),
         )
     }
 }
diff --git a/src/test/kotlin/g0501_0600/s0550_game_play_analysis_iv/MysqlTest.kt b/src/test/kotlin/g0501_0600/s0550_game_play_analysis_iv/MysqlTest.kt
index a1070ab81..3f4de460f 100644
--- a/src/test/kotlin/g0501_0600/s0550_game_play_analysis_iv/MysqlTest.kt
+++ b/src/test/kotlin/g0501_0600/s0550_game_play_analysis_iv/MysqlTest.kt
@@ -32,8 +32,8 @@ import javax.sql.DataSource
             " VALUES (3, 1, '2016-03-02', 0); " +
             "INSERT INTO Activity(player_id, device_id" +
             ", event_date, games_played)" +
-            " VALUES (3, 4, '2018-07-03', 5); "
-    ]
+            " VALUES (3, 4, '2018-07-03', 5); ",
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -45,12 +45,12 @@ internal class MysqlTest {
                     BufferedReader(
                         FileReader(
                             "src/main/kotlin/g0501_0600/" +
-                                "s0550_game_play_analysis_iv/script.sql"
-                        )
+                                "s0550_game_play_analysis_iv/script.sql",
+                        ),
                     )
                         .lines()
                         .collect(Collectors.joining("\n"))
-                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace("#.*?\\r?\\n".toRegex(), ""),
                 ).use { resultSet ->
                     assertThat(resultSet.next(), equalTo(true))
                     assertThat(resultSet.getNString(1), equalTo("0.33"))
diff --git a/src/test/kotlin/g0501_0600/s0553_optimal_division/SolutionTest.kt b/src/test/kotlin/g0501_0600/s0553_optimal_division/SolutionTest.kt
index b06060f08..d50720b4a 100644
--- a/src/test/kotlin/g0501_0600/s0553_optimal_division/SolutionTest.kt
+++ b/src/test/kotlin/g0501_0600/s0553_optimal_division/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun optimalDivision() {
         assertThat(
             Solution().optimalDivision(intArrayOf(1000, 100, 10, 2)),
-            equalTo("1000/(100/10/2)")
+            equalTo("1000/(100/10/2)"),
         )
     }
 
diff --git a/src/test/kotlin/g0501_0600/s0554_brick_wall/SolutionTest.kt b/src/test/kotlin/g0501_0600/s0554_brick_wall/SolutionTest.kt
index 3dbde1fb5..a057a25e2 100644
--- a/src/test/kotlin/g0501_0600/s0554_brick_wall/SolutionTest.kt
+++ b/src/test/kotlin/g0501_0600/s0554_brick_wall/SolutionTest.kt
@@ -18,11 +18,11 @@ internal class SolutionTest {
                             intArrayOf(1, 3, 2),
                             intArrayOf(2, 4),
                             intArrayOf(3, 1, 2),
-                            intArrayOf(1, 3, 1, 1)
-                        )
-                    )
+                            intArrayOf(1, 3, 1, 1),
+                        ),
+                    ),
                 ),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -30,7 +30,7 @@ internal class SolutionTest {
     fun leastBricks2() {
         assertThat(
             Solution().leastBricks(ArrayUtils.getLists(arrayOf(intArrayOf(1), intArrayOf(1), intArrayOf(1)))),
-            equalTo(3)
+            equalTo(3),
         )
     }
 }
diff --git a/src/test/kotlin/g0501_0600/s0557_reverse_words_in_a_string_iii/SolutionTest.kt b/src/test/kotlin/g0501_0600/s0557_reverse_words_in_a_string_iii/SolutionTest.kt
index 2a2874f48..6800b0b54 100644
--- a/src/test/kotlin/g0501_0600/s0557_reverse_words_in_a_string_iii/SolutionTest.kt
+++ b/src/test/kotlin/g0501_0600/s0557_reverse_words_in_a_string_iii/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun reverseWords() {
         assertThat(
             Solution().reverseWords("Let's take LeetCode contest"),
-            equalTo("s'teL ekat edoCteeL tsetnoc")
+            equalTo("s'teL ekat edoCteeL tsetnoc"),
         )
     }
 
diff --git a/src/test/kotlin/g0501_0600/s0558_logical_or_of_two_binary_grids_represented_as_quad_trees/SolutionTest.kt b/src/test/kotlin/g0501_0600/s0558_logical_or_of_two_binary_grids_represented_as_quad_trees/SolutionTest.kt
index 199ef4a09..38694ead5 100644
--- a/src/test/kotlin/g0501_0600/s0558_logical_or_of_two_binary_grids_represented_as_quad_trees/SolutionTest.kt
+++ b/src/test/kotlin/g0501_0600/s0558_logical_or_of_two_binary_grids_represented_as_quad_trees/SolutionTest.kt
@@ -23,7 +23,7 @@ internal class SolutionTest {
         node2.topRight!!.bottomRight = Node(true, true)
         assertThat(
             Solution().intersect(node1, node2).toString(),
-            equalTo("[0,0][1,1][1,1][1,1][1,0]")
+            equalTo("[0,0][1,1][1,1][1,1][1,0]"),
         )
     }
 }
diff --git a/src/test/kotlin/g0501_0600/s0570_managers_with_at_least_5_direct_reports/MysqlTest.kt b/src/test/kotlin/g0501_0600/s0570_managers_with_at_least_5_direct_reports/MysqlTest.kt
index 28f6ba4a0..68e2263ec 100644
--- a/src/test/kotlin/g0501_0600/s0570_managers_with_at_least_5_direct_reports/MysqlTest.kt
+++ b/src/test/kotlin/g0501_0600/s0570_managers_with_at_least_5_direct_reports/MysqlTest.kt
@@ -35,8 +35,8 @@ import javax.sql.DataSource
             " VALUES (105, 'Anne', 'A', 101); " +
             "INSERT INTO Employee(id, name" +
             ", department, managerId)" +
-            " VALUES (106, 'Ron', 'B', 101); "
-    ]
+            " VALUES (106, 'Ron', 'B', 101); ",
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -49,12 +49,12 @@ internal class MysqlTest {
                         FileReader(
                             "src/main/kotlin/g0501_0600/" +
                                 "s0570_managers_with_at_least_5_direct_reports" +
-                                "/script.sql"
-                        )
+                                "/script.sql",
+                        ),
                     )
                         .lines()
                         .collect(Collectors.joining("\n"))
-                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace("#.*?\\r?\\n".toRegex(), ""),
                 ).use { resultSet ->
                     assertThat(resultSet.next(), equalTo(true))
                     assertThat(resultSet.getNString(1), equalTo("John"))
diff --git a/src/test/kotlin/g0501_0600/s0572_subtree_of_another_tree/SolutionTest.kt b/src/test/kotlin/g0501_0600/s0572_subtree_of_another_tree/SolutionTest.kt
index 272b63e93..b6ce7d28f 100644
--- a/src/test/kotlin/g0501_0600/s0572_subtree_of_another_tree/SolutionTest.kt
+++ b/src/test/kotlin/g0501_0600/s0572_subtree_of_another_tree/SolutionTest.kt
@@ -16,7 +16,7 @@ internal class SolutionTest {
     @Test
     fun isSubtree2() {
         val treeNode: TreeNode = TreeNode.create(
-            listOf(3, 4, 5, 1, 2, null, null, null, null, 0)
+            listOf(3, 4, 5, 1, 2, null, null, null, null, 0),
         )!!
         val subTree: TreeNode = TreeNode.create(listOf(4, 1, 2))!!
         assertThat(Solution().isSubtree(treeNode, subTree), equalTo(false))
diff --git a/src/test/kotlin/g0501_0600/s0577_employee_bonus/MysqlTest.kt b/src/test/kotlin/g0501_0600/s0577_employee_bonus/MysqlTest.kt
index 40a1793be..88d26bca0 100644
--- a/src/test/kotlin/g0501_0600/s0577_employee_bonus/MysqlTest.kt
+++ b/src/test/kotlin/g0501_0600/s0577_employee_bonus/MysqlTest.kt
@@ -34,8 +34,8 @@ import javax.sql.DataSource
             "INSERT INTO Bonus(empId, bonus)" +
             " VALUES (2, 500); " +
             "INSERT INTO Bonus(empId, bonus)" +
-            " VALUES (4, 2000); "
-    ]
+            " VALUES (4, 2000); ",
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -47,12 +47,12 @@ internal class MysqlTest {
                     BufferedReader(
                         FileReader(
                             "src/main/kotlin/g0501_0600/" +
-                                "s0577_employee_bonus/script.sql"
-                        )
+                                "s0577_employee_bonus/script.sql",
+                        ),
                     )
                         .lines()
                         .collect(Collectors.joining("\n"))
-                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace("#.*?\\r?\\n".toRegex(), ""),
                 ).use { resultSet ->
                     assertThat(resultSet.next(), equalTo(true))
                     assertThat(resultSet.getNString(1), equalTo("John"))
diff --git a/src/test/kotlin/g0501_0600/s0581_shortest_unsorted_continuous_subarray/SolutionTest.kt b/src/test/kotlin/g0501_0600/s0581_shortest_unsorted_continuous_subarray/SolutionTest.kt
index 10f80c78f..ff208be5a 100644
--- a/src/test/kotlin/g0501_0600/s0581_shortest_unsorted_continuous_subarray/SolutionTest.kt
+++ b/src/test/kotlin/g0501_0600/s0581_shortest_unsorted_continuous_subarray/SolutionTest.kt
@@ -8,7 +8,8 @@ internal class SolutionTest {
     @Test
     fun findUnsortedSubarray() {
         assertThat(
-            Solution().findUnsortedSubarray(intArrayOf(2, 6, 4, 8, 10, 9, 15)), equalTo(5)
+            Solution().findUnsortedSubarray(intArrayOf(2, 6, 4, 8, 10, 9, 15)),
+            equalTo(5),
         )
     }
 
diff --git a/src/test/kotlin/g0501_0600/s0584_find_customer_referee/MysqlTest.kt b/src/test/kotlin/g0501_0600/s0584_find_customer_referee/MysqlTest.kt
index 0236bdc8a..d05267186 100644
--- a/src/test/kotlin/g0501_0600/s0584_find_customer_referee/MysqlTest.kt
+++ b/src/test/kotlin/g0501_0600/s0584_find_customer_referee/MysqlTest.kt
@@ -22,8 +22,8 @@ import javax.sql.DataSource
             "INSERT INTO Customer(id, name, referee_id) VALUES (3, 'Alex', 2); " +
             "INSERT INTO Customer(id, name, referee_id) VALUES (4, 'Bill', NULL); " +
             "INSERT INTO Customer(id, name, referee_id) VALUES (5, 'Zack', 1); " +
-            "INSERT INTO Customer(id, name, referee_id) VALUES (6, 'Mark', 2); "
-    ]
+            "INSERT INTO Customer(id, name, referee_id) VALUES (6, 'Mark', 2); ",
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -35,12 +35,12 @@ internal class MysqlTest {
                     BufferedReader(
                         FileReader(
                             "src/main/kotlin/g0501_0600/" +
-                                "s0584_find_customer_referee/script.sql"
-                        )
+                                "s0584_find_customer_referee/script.sql",
+                        ),
                     )
                         .lines()
                         .collect(Collectors.joining("\n"))
-                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace("#.*?\\r?\\n".toRegex(), ""),
                 ).use { resultSet ->
                     assertThat(resultSet.next(), equalTo(true))
                     assertThat(resultSet.getString(1), equalTo("Will"))
diff --git a/src/test/kotlin/g0501_0600/s0585_investments_in_2016/MysqlTest.kt b/src/test/kotlin/g0501_0600/s0585_investments_in_2016/MysqlTest.kt
index 52f550038..f5a9155e1 100644
--- a/src/test/kotlin/g0501_0600/s0585_investments_in_2016/MysqlTest.kt
+++ b/src/test/kotlin/g0501_0600/s0585_investments_in_2016/MysqlTest.kt
@@ -29,8 +29,8 @@ import javax.sql.DataSource
             " VALUES (3, 10, 30, 20, 20); " +
             "INSERT INTO Insurance(pid, tiv_2015, tiv_2016" +
             ", lat, lon)" +
-            " VALUES (4, 10, 40, 40, 40); "
-    ]
+            " VALUES (4, 10, 40, 40, 40); ",
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -43,12 +43,12 @@ internal class MysqlTest {
                         FileReader(
                             "src/main/kotlin/g0501_0600/" +
                                 "s0585_investments_in_2016" +
-                                "/script.sql"
-                        )
+                                "/script.sql",
+                        ),
                     )
                         .lines()
                         .collect(Collectors.joining("\n"))
-                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace("#.*?\\r?\\n".toRegex(), ""),
                 ).use { resultSet ->
                     assertThat(resultSet.next(), equalTo(true))
                     assertThat(resultSet.getDouble(1), equalTo(45.00))
diff --git a/src/test/kotlin/g0501_0600/s0586_customer_placing_the_largest_number_of_orders/MysqlTest.kt b/src/test/kotlin/g0501_0600/s0586_customer_placing_the_largest_number_of_orders/MysqlTest.kt
index 9b906ef73..07e4e5216 100644
--- a/src/test/kotlin/g0501_0600/s0586_customer_placing_the_largest_number_of_orders/MysqlTest.kt
+++ b/src/test/kotlin/g0501_0600/s0586_customer_placing_the_largest_number_of_orders/MysqlTest.kt
@@ -20,8 +20,8 @@ import javax.sql.DataSource
             "INSERT INTO Orders(order_number, customer_number) VALUES (1, 1); " +
             "INSERT INTO Orders(order_number, customer_number) VALUES (2, 2); " +
             "INSERT INTO Orders(order_number, customer_number) VALUES (3, 3); " +
-            "INSERT INTO Orders(order_number, customer_number) VALUES (4, 3); "
-    ]
+            "INSERT INTO Orders(order_number, customer_number) VALUES (4, 3); ",
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -35,12 +35,12 @@ internal class MysqlTest {
                             "src/main/kotlin/g0501_0600/" +
                                 "s0586_customer_placing" +
                                 "_the_largest_number_of" +
-                                "_orders/script.sql"
-                        )
+                                "_orders/script.sql",
+                        ),
                     )
                         .lines()
                         .collect(Collectors.joining("\n"))
-                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace("#.*?\\r?\\n".toRegex(), ""),
                 ).use { resultSet ->
                     assertThat(resultSet.next(), equalTo(true))
                     assertThat(resultSet.getInt(1), equalTo(3))
diff --git a/src/test/kotlin/g0501_0600/s0587_erect_the_fence/SolutionTest.kt b/src/test/kotlin/g0501_0600/s0587_erect_the_fence/SolutionTest.kt
index 2a0482eef..c9d6e67b3 100644
--- a/src/test/kotlin/g0501_0600/s0587_erect_the_fence/SolutionTest.kt
+++ b/src/test/kotlin/g0501_0600/s0587_erect_the_fence/SolutionTest.kt
@@ -16,10 +16,10 @@ internal class SolutionTest {
                         intArrayOf(2, 0),
                         intArrayOf(2, 4),
                         intArrayOf(3, 3),
-                        intArrayOf(4, 2)
-                    )
+                        intArrayOf(4, 2),
+                    ),
                 ),
-            equalTo(arrayOf(intArrayOf(2, 0), intArrayOf(4, 2), intArrayOf(3, 3), intArrayOf(2, 4), intArrayOf(1, 1)))
+            equalTo(arrayOf(intArrayOf(2, 0), intArrayOf(4, 2), intArrayOf(3, 3), intArrayOf(2, 4), intArrayOf(1, 1))),
         )
     }
 
@@ -27,7 +27,7 @@ internal class SolutionTest {
     fun outerTrees2() {
         assertThat(
             Solution().outerTrees(arrayOf(intArrayOf(1, 2), intArrayOf(2, 2), intArrayOf(4, 2))),
-            equalTo(arrayOf(intArrayOf(1, 2), intArrayOf(2, 2), intArrayOf(4, 2)))
+            equalTo(arrayOf(intArrayOf(1, 2), intArrayOf(2, 2), intArrayOf(4, 2))),
         )
     }
 }
diff --git a/src/test/kotlin/g0501_0600/s0589_n_ary_tree_preorder_traversal/SolutionTest.kt b/src/test/kotlin/g0501_0600/s0589_n_ary_tree_preorder_traversal/SolutionTest.kt
index 64681c5b7..c20b78f78 100644
--- a/src/test/kotlin/g0501_0600/s0589_n_ary_tree_preorder_traversal/SolutionTest.kt
+++ b/src/test/kotlin/g0501_0600/s0589_n_ary_tree_preorder_traversal/SolutionTest.kt
@@ -45,7 +45,7 @@ internal class SolutionTest {
         node1.neighbors = listOf(node2, node3, node4, node5)
         assertThat(
             Solution().preorder(node1),
-            equalTo(listOf(1, 2, 3, 6, 7, 11, 14, 4, 8, 12, 5, 9, 13, 10))
+            equalTo(listOf(1, 2, 3, 6, 7, 11, 14, 4, 8, 12, 5, 9, 13, 10)),
         )
     }
 
diff --git a/src/test/kotlin/g0501_0600/s0590_n_ary_tree_postorder_traversal/SolutionTest.kt b/src/test/kotlin/g0501_0600/s0590_n_ary_tree_postorder_traversal/SolutionTest.kt
index 3cdfbf940..a047b50e0 100644
--- a/src/test/kotlin/g0501_0600/s0590_n_ary_tree_postorder_traversal/SolutionTest.kt
+++ b/src/test/kotlin/g0501_0600/s0590_n_ary_tree_postorder_traversal/SolutionTest.kt
@@ -45,7 +45,7 @@ internal class SolutionTest {
         node1.neighbors = listOf(node2, node3, node4, node5)
         assertThat(
             Solution().postorder(node1),
-            equalTo(listOf(2, 6, 14, 11, 7, 3, 12, 8, 4, 13, 9, 10, 5, 1))
+            equalTo(listOf(2, 6, 14, 11, 7, 3, 12, 8, 4, 13, 9, 10, 5, 1)),
         )
     }
 
diff --git a/src/test/kotlin/g0501_0600/s0591_tag_validator/SolutionTest.kt b/src/test/kotlin/g0501_0600/s0591_tag_validator/SolutionTest.kt
index 0cd1d113f..a9e27bde6 100644
--- a/src/test/kotlin/g0501_0600/s0591_tag_validator/SolutionTest.kt
+++ b/src/test/kotlin/g0501_0600/s0591_tag_validator/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun isValid() {
         assertThat(
             Solution().isValid("<DIV>This is the first line <![CDATA[<div>]]></DIV>"),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
@@ -18,9 +18,9 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .isValid(
-                    "<ABCDEFGHIJKLMN>This is the first line <![CDATA[<div>]]></ABCDEFGHIJKLMN>"
+                    "<ABCDEFGHIJKLMN>This is the first line <![CDATA[<div>]]></ABCDEFGHIJKLMN>",
                 ),
-            equalTo(false)
+            equalTo(false),
         )
     }
 }
diff --git a/src/test/kotlin/g0501_0600/s0595_big_countries/MysqlTest.kt b/src/test/kotlin/g0501_0600/s0595_big_countries/MysqlTest.kt
index 3f8b05b96..e259a376a 100644
--- a/src/test/kotlin/g0501_0600/s0595_big_countries/MysqlTest.kt
+++ b/src/test/kotlin/g0501_0600/s0595_big_countries/MysqlTest.kt
@@ -27,8 +27,8 @@ import javax.sql.DataSource
             "INSERT INTO World(name, continent, area, population, gdp)" +
             " VALUES ('Andorra', 'Europe', 468, 78115, 3712000000); " +
             "INSERT INTO World(name, continent, area, population, gdp)" +
-            " VALUES ('Angola', 'Africa', 1246700, 20609294, 100990000000); "
-    ]
+            " VALUES ('Angola', 'Africa', 1246700, 20609294, 100990000000); ",
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -41,12 +41,12 @@ internal class MysqlTest {
                         FileReader(
                             "src/main/kotlin/g0501_0600/" +
                                 "s0595_big_countries" +
-                                "/script.sql"
-                        )
+                                "/script.sql",
+                        ),
                     )
                         .lines()
                         .collect(Collectors.joining("\n"))
-                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace("#.*?\\r?\\n".toRegex(), ""),
                 ).use { resultSet ->
                     assertThat(resultSet.next(), equalTo(true))
                     assertThat(resultSet.getNString(1), equalTo("Afghanistan"))
diff --git a/src/test/kotlin/g0501_0600/s0596_classes_more_than_5_students/MysqlTest.kt b/src/test/kotlin/g0501_0600/s0596_classes_more_than_5_students/MysqlTest.kt
index 4ac74c2ab..6e89c55ed 100644
--- a/src/test/kotlin/g0501_0600/s0596_classes_more_than_5_students/MysqlTest.kt
+++ b/src/test/kotlin/g0501_0600/s0596_classes_more_than_5_students/MysqlTest.kt
@@ -25,8 +25,8 @@ import javax.sql.DataSource
             "INSERT INTO Courses(student, class) VALUES ('F', 'Computer'); " +
             "INSERT INTO Courses(student, class) VALUES ('G', 'Math'); " +
             "INSERT INTO Courses(student, class) VALUES ('H', 'Math'); " +
-            "INSERT INTO Courses(student, class) VALUES ('I', 'Math'); "
-    ]
+            "INSERT INTO Courses(student, class) VALUES ('I', 'Math'); ",
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -40,12 +40,12 @@ internal class MysqlTest {
                             "src/main/kotlin/g0501_0600/" +
                                 "s0596_classes_more" +
                                 "_than_5_students" +
-                                "/script.sql"
-                        )
+                                "/script.sql",
+                        ),
                     )
                         .lines()
                         .collect(Collectors.joining("\n"))
-                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace("#.*?\\r?\\n".toRegex(), ""),
                 ).use { resultSet ->
                     assertThat(resultSet.next(), equalTo(true))
                     assertThat(resultSet.getNString(1), equalTo("Math"))
diff --git a/src/test/kotlin/g0501_0600/s0598_range_addition_ii/SolutionTest.kt b/src/test/kotlin/g0501_0600/s0598_range_addition_ii/SolutionTest.kt
index bbd8fe6db..a139c46c5 100644
--- a/src/test/kotlin/g0501_0600/s0598_range_addition_ii/SolutionTest.kt
+++ b/src/test/kotlin/g0501_0600/s0598_range_addition_ii/SolutionTest.kt
@@ -16,7 +16,7 @@ internal class SolutionTest {
         val javaArray: Array<IntArray> = arrayOf(
             intArrayOf(2, 2), intArrayOf(3, 3), intArrayOf(3, 3), intArrayOf(3, 3),
             intArrayOf(2, 2), intArrayOf(3, 3), intArrayOf(3, 3), intArrayOf(3, 3), intArrayOf(2, 2), intArrayOf(3, 3),
-            intArrayOf(3, 3), intArrayOf(3, 3)
+            intArrayOf(3, 3), intArrayOf(3, 3),
         )
         assertThat(Solution().maxCount(3, 3, javaArray), equalTo(4))
     }
diff --git a/src/test/kotlin/g0501_0600/s0599_minimum_index_sum_of_two_lists/SolutionTest.kt b/src/test/kotlin/g0501_0600/s0599_minimum_index_sum_of_two_lists/SolutionTest.kt
index 16f208d2b..1c1c90057 100644
--- a/src/test/kotlin/g0501_0600/s0599_minimum_index_sum_of_two_lists/SolutionTest.kt
+++ b/src/test/kotlin/g0501_0600/s0599_minimum_index_sum_of_two_lists/SolutionTest.kt
@@ -9,7 +9,10 @@ internal class SolutionTest {
     fun findRestaurant() {
         val list1 = arrayOf<String>("Shogun", "Tapioca Express", "Burger King", "KFC")
         val list2 = arrayOf(
-            "Piatti", "The Grill at Torrey Pines", "Hungry Hunter Steakhouse", "Shogun"
+            "Piatti",
+            "The Grill at Torrey Pines",
+            "Hungry Hunter Steakhouse",
+            "Shogun",
         )
         assertThat(Solution().findRestaurant(list1, list2), equalTo(arrayOf("Shogun")))
     }
diff --git a/src/test/kotlin/g0601_0700/s0601_human_traffic_of_stadium/MysqlTest.kt b/src/test/kotlin/g0601_0700/s0601_human_traffic_of_stadium/MysqlTest.kt
index 568c1df6d..8231d7695 100644
--- a/src/test/kotlin/g0601_0700/s0601_human_traffic_of_stadium/MysqlTest.kt
+++ b/src/test/kotlin/g0601_0700/s0601_human_traffic_of_stadium/MysqlTest.kt
@@ -32,8 +32,8 @@ import javax.sql.DataSource
             "INSERT INTO Stadium(id, visit_date, people)" +
             " VALUES (7, '2017-01-07', 199); " +
             "INSERT INTO Stadium(id, visit_date, people)" +
-            " VALUES (8, '2017-01-09', 188); "
-    ]
+            " VALUES (8, '2017-01-09', 188); ",
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -47,12 +47,12 @@ internal class MysqlTest {
                             "src/main/kotlin/g0601_0700/" +
                                 "s0601_human_traffic" +
                                 "_of_stadium" +
-                                "/script.sql"
-                        )
+                                "/script.sql",
+                        ),
                     )
                         .lines()
                         .collect(Collectors.joining("\n"))
-                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace("#.*?\\r?\\n".toRegex(), ""),
                 ).use { resultSet ->
                     assertThat(resultSet.next(), equalTo(true))
                     assertThat(resultSet.getInt(1), equalTo(5))
diff --git a/src/test/kotlin/g0601_0700/s0602_friend_requests_ii_who_has_the_most_friends/MysqlTest.kt b/src/test/kotlin/g0601_0700/s0602_friend_requests_ii_who_has_the_most_friends/MysqlTest.kt
index 6756b53cd..3a4281d95 100644
--- a/src/test/kotlin/g0601_0700/s0602_friend_requests_ii_who_has_the_most_friends/MysqlTest.kt
+++ b/src/test/kotlin/g0601_0700/s0602_friend_requests_ii_who_has_the_most_friends/MysqlTest.kt
@@ -24,8 +24,8 @@ import javax.sql.DataSource
             "INSERT INTO RequestAccepted(requester_id, accepter_id, accept_date)" +
             " VALUES (2, 3, '2016-06-08'); " +
             "INSERT INTO RequestAccepted(requester_id, accepter_id, accept_date)" +
-            " VALUES (3, 4, '2016-06-09'); "
-    ]
+            " VALUES (3, 4, '2016-06-09'); ",
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -37,12 +37,12 @@ internal class MysqlTest {
                     BufferedReader(
                         FileReader(
                             "src/main/kotlin/g0601_0700/" +
-                                "s0602_friend_requests_ii_who_has_the_most_friends/script.sql"
-                        )
+                                "s0602_friend_requests_ii_who_has_the_most_friends/script.sql",
+                        ),
                     )
                         .lines()
                         .collect(Collectors.joining("\n"))
-                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace("#.*?\\r?\\n".toRegex(), ""),
                 ).use { resultSet ->
                     assertThat(resultSet.next(), equalTo(true))
                     assertThat(resultSet.getInt(1), equalTo(3))
diff --git a/src/test/kotlin/g0601_0700/s0607_sales_person/MysqlTest.kt b/src/test/kotlin/g0601_0700/s0607_sales_person/MysqlTest.kt
index ef15345f7..a844d9e3e 100644
--- a/src/test/kotlin/g0601_0700/s0607_sales_person/MysqlTest.kt
+++ b/src/test/kotlin/g0601_0700/s0607_sales_person/MysqlTest.kt
@@ -42,8 +42,8 @@ import javax.sql.DataSource
             "INSERT INTO Orders(order_id, order_date, com_id, sales_id, amount)" +
             " VALUES (3, '2014-01-03', 1, 1, 50000); " +
             "INSERT INTO Orders(order_id, order_date, com_id, sales_id, amount)" +
-            " VALUES (4, '2014-01-04', 1, 4, 25000); "
-    ]
+            " VALUES (4, '2014-01-04', 1, 4, 25000); ",
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -56,12 +56,12 @@ internal class MysqlTest {
                         FileReader(
                             "src/main/kotlin/g0601_0700/" +
                                 "s0607_sales_person" +
-                                "/script.sql"
-                        )
+                                "/script.sql",
+                        ),
                     )
                         .lines()
                         .collect(Collectors.joining("\n"))
-                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace("#.*?\\r?\\n".toRegex(), ""),
                 ).use { resultSet ->
                     assertThat(resultSet.next(), equalTo(true))
                     assertThat(resultSet.getNString(1), equalTo("Amy"))
diff --git a/src/test/kotlin/g0601_0700/s0608_tree_node/MysqlTest.kt b/src/test/kotlin/g0601_0700/s0608_tree_node/MysqlTest.kt
index 5b99f6d40..173c06660 100644
--- a/src/test/kotlin/g0601_0700/s0608_tree_node/MysqlTest.kt
+++ b/src/test/kotlin/g0601_0700/s0608_tree_node/MysqlTest.kt
@@ -21,8 +21,8 @@ import javax.sql.DataSource
             "INSERT INTO Tree(id, p_id) VALUES (2, 1); " +
             "INSERT INTO Tree(id, p_id) VALUES (3, 1); " +
             "INSERT INTO Tree(id, p_id) VALUES (4, 2); " +
-            "INSERT INTO Tree(id, p_id) VALUES (5, 2); "
-    ]
+            "INSERT INTO Tree(id, p_id) VALUES (5, 2); ",
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -35,12 +35,12 @@ internal class MysqlTest {
                         FileReader(
                             "src/main/kotlin/g0601_0700/" +
                                 "s0608_tree_node" +
-                                "/script.sql"
-                        )
+                                "/script.sql",
+                        ),
                     )
                         .lines()
                         .collect(Collectors.joining("\n"))
-                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace("#.*?\\r?\\n".toRegex(), ""),
                 ).use { resultSet ->
                     assertThat(resultSet.next(), equalTo(true))
                     assertThat(resultSet.getInt(1), equalTo(1))
diff --git a/src/test/kotlin/g0601_0700/s0609_find_duplicate_file_in_system/SolutionTest.kt b/src/test/kotlin/g0601_0700/s0609_find_duplicate_file_in_system/SolutionTest.kt
index 00697c951..a7801f754 100644
--- a/src/test/kotlin/g0601_0700/s0609_find_duplicate_file_in_system/SolutionTest.kt
+++ b/src/test/kotlin/g0601_0700/s0609_find_duplicate_file_in_system/SolutionTest.kt
@@ -14,15 +14,15 @@ internal class SolutionTest {
                         "root/a 1.txt(abcd) 2.txt(efgh)",
                         "root/c 3.txt(abcd)",
                         "root/c/d 4.txt(efgh)",
-                        "root 4.txt(efgh)"
-                    )
+                        "root 4.txt(efgh)",
+                    ),
                 ),
             equalTo(
                 listOf(
                     listOf("root/a/2.txt", "root/c/d/4.txt", "root/4.txt"),
-                    listOf("root/a/1.txt", "root/c/3.txt")
-                )
-            )
+                    listOf("root/a/1.txt", "root/c/3.txt"),
+                ),
+            ),
         )
     }
 
@@ -34,15 +34,15 @@ internal class SolutionTest {
                     arrayOf(
                         "root/a 1.txt(abcd) 2.txt(efgh)",
                         "root/c 3.txt(abcd)",
-                        "root/c/d 4.txt(efgh)"
-                    )
+                        "root/c/d 4.txt(efgh)",
+                    ),
                 ),
             equalTo(
                 listOf(
                     listOf("root/a/2.txt", "root/c/d/4.txt"),
-                    listOf("root/a/1.txt", "root/c/3.txt")
-                )
-            )
+                    listOf("root/a/1.txt", "root/c/3.txt"),
+                ),
+            ),
         )
     }
 }
diff --git a/src/test/kotlin/g0601_0700/s0610_triangle_judgement/MysqlTest.kt b/src/test/kotlin/g0601_0700/s0610_triangle_judgement/MysqlTest.kt
index 765085a4a..1fe9265d8 100644
--- a/src/test/kotlin/g0601_0700/s0610_triangle_judgement/MysqlTest.kt
+++ b/src/test/kotlin/g0601_0700/s0610_triangle_judgement/MysqlTest.kt
@@ -20,8 +20,8 @@ import javax.sql.DataSource
             "INSERT INTO Triangle(x, y, z)" +
             " VALUES (13, 15, 30); " +
             "INSERT INTO Triangle(x, y, z)" +
-            " VALUES (10, 20, 15); "
-    ]
+            " VALUES (10, 20, 15); ",
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -33,12 +33,12 @@ internal class MysqlTest {
                     BufferedReader(
                         FileReader(
                             "src/main/kotlin/g0601_0700/" +
-                                "s0610_triangle_judgement/script.sql"
-                        )
+                                "s0610_triangle_judgement/script.sql",
+                        ),
                     )
                         .lines()
                         .collect(Collectors.joining("\n"))
-                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace("#.*?\\r?\\n".toRegex(), ""),
                 ).use { resultSet ->
                     assertThat(resultSet.next(), equalTo(true))
                     assertThat(resultSet.getInt(1), equalTo(13))
diff --git a/src/test/kotlin/g0601_0700/s0619_biggest_single_number/MysqlTest.kt b/src/test/kotlin/g0601_0700/s0619_biggest_single_number/MysqlTest.kt
index fd940d721..1c8ea94dd 100644
--- a/src/test/kotlin/g0601_0700/s0619_biggest_single_number/MysqlTest.kt
+++ b/src/test/kotlin/g0601_0700/s0619_biggest_single_number/MysqlTest.kt
@@ -24,8 +24,8 @@ import javax.sql.DataSource
             "INSERT INTO MyNumbers(num) VALUES (1); " +
             "INSERT INTO MyNumbers(num) VALUES (4); " +
             "INSERT INTO MyNumbers(num) VALUES (5); " +
-            "INSERT INTO MyNumbers(num) VALUES (6); "
-    ]
+            "INSERT INTO MyNumbers(num) VALUES (6); ",
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -37,12 +37,12 @@ internal class MysqlTest {
                     BufferedReader(
                         FileReader(
                             "src/main/kotlin/g0601_0700/" +
-                                "s0619_biggest_single_number/script.sql"
-                        )
+                                "s0619_biggest_single_number/script.sql",
+                        ),
                     )
                         .lines()
                         .collect(Collectors.joining("\n"))
-                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace("#.*?\\r?\\n".toRegex(), ""),
                 ).use { resultSet ->
                     assertThat(resultSet.next(), equalTo(true))
                     assertThat(resultSet.getInt(1), equalTo(6))
diff --git a/src/test/kotlin/g0601_0700/s0620_not_boring_movies/MysqlTest.kt b/src/test/kotlin/g0601_0700/s0620_not_boring_movies/MysqlTest.kt
index 832a27ea4..59ec9aa38 100644
--- a/src/test/kotlin/g0601_0700/s0620_not_boring_movies/MysqlTest.kt
+++ b/src/test/kotlin/g0601_0700/s0620_not_boring_movies/MysqlTest.kt
@@ -27,8 +27,8 @@ import javax.sql.DataSource
             "INSERT INTO cinema(id, movie, description, rating)" +
             " VALUES (4, 'Ice song', 'Fantacy', 8.6);" +
             "INSERT INTO cinema(id, movie, description, rating)" +
-            " VALUES (5, 'House card', 'Interesting', 9.1);"
-    ]
+            " VALUES (5, 'House card', 'Interesting', 9.1);",
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -40,12 +40,12 @@ internal class MysqlTest {
                     BufferedReader(
                         FileReader(
                             "src/main/kotlin/g0601_0700/" +
-                                "s0620_not_boring_movies/script.sql"
-                        )
+                                "s0620_not_boring_movies/script.sql",
+                        ),
                     )
                         .lines()
                         .collect(Collectors.joining("\n"))
-                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace("#.*?\\r?\\n".toRegex(), ""),
                 ).use { resultSet ->
                     assertThat(resultSet.next(), equalTo(true))
                     assertThat(resultSet.getInt(1), equalTo(5))
diff --git a/src/test/kotlin/g0601_0700/s0621_task_scheduler/SolutionTest.kt b/src/test/kotlin/g0601_0700/s0621_task_scheduler/SolutionTest.kt
index 8f5912363..77d3af65b 100644
--- a/src/test/kotlin/g0601_0700/s0621_task_scheduler/SolutionTest.kt
+++ b/src/test/kotlin/g0601_0700/s0621_task_scheduler/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun leastInterval() {
         assertThat(
             Solution().leastInterval(charArrayOf('A', 'A', 'A', 'B', 'B', 'B'), 2),
-            equalTo(8)
+            equalTo(8),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun leastInterval2() {
         assertThat(
             Solution().leastInterval(charArrayOf('A', 'A', 'A', 'B', 'B', 'B'), 0),
-            equalTo(6)
+            equalTo(6),
         )
     }
 
@@ -27,11 +27,11 @@ internal class SolutionTest {
             Solution()
                 .leastInterval(
                     charArrayOf(
-                        'A', 'A', 'A', 'A', 'A', 'A', 'B', 'C', 'D', 'E', 'F', 'G'
+                        'A', 'A', 'A', 'A', 'A', 'A', 'B', 'C', 'D', 'E', 'F', 'G',
                     ),
-                    2
+                    2,
                 ),
-            equalTo(16)
+            equalTo(16),
         )
     }
 }
diff --git a/src/test/kotlin/g0601_0700/s0623_add_one_row_to_tree/SolutionTest.kt b/src/test/kotlin/g0601_0700/s0623_add_one_row_to_tree/SolutionTest.kt
index e1ed76e34..dcd288e24 100644
--- a/src/test/kotlin/g0601_0700/s0623_add_one_row_to_tree/SolutionTest.kt
+++ b/src/test/kotlin/g0601_0700/s0623_add_one_row_to_tree/SolutionTest.kt
@@ -11,7 +11,8 @@ internal class SolutionTest {
         val treeNode: TreeNode = TreeNode.create(listOf(4, 2, 6, 3, 1, 5))!!
         val expected: TreeNode = TreeNode.create(listOf(4, 1, 1, 2, null, null, 6, 3, 1, 5))!!
         assertThat(
-            Solution().addOneRow(treeNode, 1, 2).toString(), equalTo(expected.toString())
+            Solution().addOneRow(treeNode, 1, 2).toString(),
+            equalTo(expected.toString()),
         )
     }
 
@@ -20,7 +21,8 @@ internal class SolutionTest {
         val treeNode: TreeNode = TreeNode.create(listOf(4, 2, null, 3, 1))!!
         val expected: TreeNode = TreeNode.create(listOf(4, 2, null, 1, 1, 3, null, null, 1))!!
         assertThat(
-            Solution().addOneRow(treeNode, 1, 3).toString(), equalTo(expected.toString())
+            Solution().addOneRow(treeNode, 1, 3).toString(),
+            equalTo(expected.toString()),
         )
     }
 }
diff --git a/src/test/kotlin/g0601_0700/s0626_exchange_seats/MysqlTest.kt b/src/test/kotlin/g0601_0700/s0626_exchange_seats/MysqlTest.kt
index 70b373f95..4eecbf2ba 100644
--- a/src/test/kotlin/g0601_0700/s0626_exchange_seats/MysqlTest.kt
+++ b/src/test/kotlin/g0601_0700/s0626_exchange_seats/MysqlTest.kt
@@ -21,8 +21,8 @@ import javax.sql.DataSource
             "INSERT INTO seat(id, student) VALUES (2, 'Doris'); " +
             "INSERT INTO seat(id, student) VALUES (3, 'Emerson'); " +
             "INSERT INTO seat(id, student) VALUES (4, 'Green'); " +
-            "INSERT INTO seat(id, student) VALUES (5, 'Jeames'); "
-    ]
+            "INSERT INTO seat(id, student) VALUES (5, 'Jeames'); ",
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -34,12 +34,12 @@ internal class MysqlTest {
                     BufferedReader(
                         FileReader(
                             "src/main/kotlin/g0601_0700/" +
-                                "s0626_exchange_seats/script.sql"
-                        )
+                                "s0626_exchange_seats/script.sql",
+                        ),
                     )
                         .lines()
                         .collect(Collectors.joining("\n"))
-                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace("#.*?\\r?\\n".toRegex(), ""),
                 ).use { resultSet ->
                     assertThat(resultSet.next(), equalTo(true))
                     assertThat(resultSet.getInt(1), equalTo(1))
diff --git a/src/test/kotlin/g0601_0700/s0627_swap_salary/MysqlTest.kt b/src/test/kotlin/g0601_0700/s0627_swap_salary/MysqlTest.kt
index b8c5ac96b..ec0654ee1 100644
--- a/src/test/kotlin/g0601_0700/s0627_swap_salary/MysqlTest.kt
+++ b/src/test/kotlin/g0601_0700/s0627_swap_salary/MysqlTest.kt
@@ -25,8 +25,8 @@ import javax.sql.DataSource
             "INSERT INTO Salary(id, name, sex, salary)" +
             " VALUES (3, 'C', 'm', 5500); " +
             "INSERT INTO Salary(id, name, sex, salary)" +
-            " VALUES (4, 'D', 'f', 500); "
-    ]
+            " VALUES (4, 'D', 'f', 500); ",
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -38,12 +38,12 @@ internal class MysqlTest {
                     BufferedReader(
                         FileReader(
                             "src/main/kotlin/g0601_0700/" +
-                                "s0627_swap_salary/script.sql"
-                        )
+                                "s0627_swap_salary/script.sql",
+                        ),
                     )
                         .lines()
                         .collect(Collectors.joining("\n"))
-                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace("#.*?\\r?\\n".toRegex(), ""),
                 )
                 val resultSet = statement.executeQuery("select id, name, sex, salary from Salary")
                 assertThat(resultSet.next(), equalTo(true))
diff --git a/src/test/kotlin/g0601_0700/s0630_course_schedule_iii/SolutionTest.kt b/src/test/kotlin/g0601_0700/s0630_course_schedule_iii/SolutionTest.kt
index 99c5a1bca..221245fce 100644
--- a/src/test/kotlin/g0601_0700/s0630_course_schedule_iii/SolutionTest.kt
+++ b/src/test/kotlin/g0601_0700/s0630_course_schedule_iii/SolutionTest.kt
@@ -28,7 +28,7 @@ internal class SolutionTest {
             intArrayOf(200, 1300),
             intArrayOf(1000, 1250),
             intArrayOf(2000, 3200),
-            intArrayOf(300, 1200)
+            intArrayOf(300, 1200),
         )
         assertThat(Solution().scheduleCourse(input), equalTo(4))
     }
diff --git a/src/test/kotlin/g0601_0700/s0632_smallest_range_covering_elements_from_k_lists/SolutionTest.kt b/src/test/kotlin/g0601_0700/s0632_smallest_range_covering_elements_from_k_lists/SolutionTest.kt
index 8b38a5b4e..be041f103 100644
--- a/src/test/kotlin/g0601_0700/s0632_smallest_range_covering_elements_from_k_lists/SolutionTest.kt
+++ b/src/test/kotlin/g0601_0700/s0632_smallest_range_covering_elements_from_k_lists/SolutionTest.kt
@@ -13,10 +13,10 @@ internal class SolutionTest {
                     listOf(
                         listOf(4, 10, 15, 24, 26),
                         listOf(0, 9, 12, 20),
-                        listOf(5, 18, 22, 30)
-                    )
+                        listOf(5, 18, 22, 30),
+                    ),
                 ),
-            equalTo(intArrayOf(24, 20))
+            equalTo(intArrayOf(24, 20)),
         )
     }
 
@@ -28,10 +28,10 @@ internal class SolutionTest {
                     listOf(
                         listOf(1, 2, 3),
                         listOf(1, 2, 3),
-                        listOf(1, 2, 3)
-                    )
+                        listOf(1, 2, 3),
+                    ),
                 ),
-            equalTo(intArrayOf(1, 1))
+            equalTo(intArrayOf(1, 1)),
         )
     }
 }
diff --git a/src/test/kotlin/g0601_0700/s0636_exclusive_time_of_functions/SolutionTest.kt b/src/test/kotlin/g0601_0700/s0636_exclusive_time_of_functions/SolutionTest.kt
index c5d063ed5..cd05c896e 100644
--- a/src/test/kotlin/g0601_0700/s0636_exclusive_time_of_functions/SolutionTest.kt
+++ b/src/test/kotlin/g0601_0700/s0636_exclusive_time_of_functions/SolutionTest.kt
@@ -10,9 +10,10 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .exclusiveTime(
-                    2, listOf("0:start:0", "1:start:2", "1:end:5", "0:end:6")
+                    2,
+                    listOf("0:start:0", "1:start:2", "1:end:5", "0:end:6"),
                 ),
-            equalTo(intArrayOf(3, 4))
+            equalTo(intArrayOf(3, 4)),
         )
     }
 
@@ -28,10 +29,10 @@ internal class SolutionTest {
                         "0:end:5",
                         "0:start:6",
                         "0:end:6",
-                        "0:end:7"
-                    )
+                        "0:end:7",
+                    ),
                 ),
-            equalTo(intArrayOf(8))
+            equalTo(intArrayOf(8)),
         )
     }
 
@@ -47,10 +48,10 @@ internal class SolutionTest {
                         "0:end:5",
                         "1:start:6",
                         "1:end:6",
-                        "0:end:7"
-                    )
+                        "0:end:7",
+                    ),
                 ),
-            equalTo(intArrayOf(7, 1))
+            equalTo(intArrayOf(7, 1)),
         )
     }
 }
diff --git a/src/test/kotlin/g0601_0700/s0637_average_of_levels_in_binary_tree/SolutionTest.kt b/src/test/kotlin/g0601_0700/s0637_average_of_levels_in_binary_tree/SolutionTest.kt
index fe6e1781c..9c8379779 100644
--- a/src/test/kotlin/g0601_0700/s0637_average_of_levels_in_binary_tree/SolutionTest.kt
+++ b/src/test/kotlin/g0601_0700/s0637_average_of_levels_in_binary_tree/SolutionTest.kt
@@ -11,7 +11,7 @@ internal class SolutionTest {
         val treeNode: TreeNode? = TreeNode.create(listOf(3, 9, 20, null, null, 15, 7))
         assertThat(
             Solution().averageOfLevels(treeNode),
-            equalTo(listOf(3.00000, 14.50000, 11.00000))
+            equalTo(listOf(3.00000, 14.50000, 11.00000)),
         )
     }
 
@@ -20,7 +20,7 @@ internal class SolutionTest {
         val treeNode: TreeNode? = TreeNode.create(listOf(3, 9, 20, 15, 7))
         assertThat(
             Solution().averageOfLevels(treeNode),
-            equalTo(listOf(3.00000, 14.50000, 11.00000))
+            equalTo(listOf(3.00000, 14.50000, 11.00000)),
         )
     }
 }
diff --git a/src/test/kotlin/g0601_0700/s0638_shopping_offers/SolutionTest.kt b/src/test/kotlin/g0601_0700/s0638_shopping_offers/SolutionTest.kt
index 0ef1ad89c..bafe6b398 100644
--- a/src/test/kotlin/g0601_0700/s0638_shopping_offers/SolutionTest.kt
+++ b/src/test/kotlin/g0601_0700/s0638_shopping_offers/SolutionTest.kt
@@ -12,9 +12,9 @@ internal class SolutionTest {
                 .shoppingOffers(
                     listOf(2, 5),
                     listOf(listOf(3, 0, 5), listOf(1, 2, 10)),
-                    listOf(3, 2)
+                    listOf(3, 2),
                 ),
-            equalTo(14)
+            equalTo(14),
         )
     }
 
@@ -25,9 +25,9 @@ internal class SolutionTest {
                 .shoppingOffers(
                     listOf(2, 3, 4),
                     listOf(listOf(1, 1, 0, 4), listOf(2, 2, 1, 9)),
-                    listOf(1, 2, 1)
+                    listOf(1, 2, 1),
                 ),
-            equalTo(11)
+            equalTo(11),
         )
     }
 }
diff --git a/src/test/kotlin/g0601_0700/s0643_maximum_average_subarray_i/SolutionTest.kt b/src/test/kotlin/g0601_0700/s0643_maximum_average_subarray_i/SolutionTest.kt
index d2963b6aa..e1da3882d 100644
--- a/src/test/kotlin/g0601_0700/s0643_maximum_average_subarray_i/SolutionTest.kt
+++ b/src/test/kotlin/g0601_0700/s0643_maximum_average_subarray_i/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun findMaxAverage() {
         assertThat(
             Solution().findMaxAverage(intArrayOf(1, 12, -5, -6, 50, 3), 4),
-            equalTo(12.75000)
+            equalTo(12.75000),
         )
     }
 
diff --git a/src/test/kotlin/g0601_0700/s0646_maximum_length_of_pair_chain/SolutionTest.kt b/src/test/kotlin/g0601_0700/s0646_maximum_length_of_pair_chain/SolutionTest.kt
index a6ec45e2d..c0462ffcb 100644
--- a/src/test/kotlin/g0601_0700/s0646_maximum_length_of_pair_chain/SolutionTest.kt
+++ b/src/test/kotlin/g0601_0700/s0646_maximum_length_of_pair_chain/SolutionTest.kt
@@ -8,14 +8,16 @@ internal class SolutionTest {
     @Test
     fun findLongestChain() {
         assertThat(
-            Solution().findLongestChain(arrayOf(intArrayOf(1, 2), intArrayOf(2, 3), intArrayOf(3, 4))), equalTo(2)
+            Solution().findLongestChain(arrayOf(intArrayOf(1, 2), intArrayOf(2, 3), intArrayOf(3, 4))),
+            equalTo(2),
         )
     }
 
     @Test
     fun findLongestChain2() {
         assertThat(
-            Solution().findLongestChain(arrayOf(intArrayOf(1, 2), intArrayOf(7, 8), intArrayOf(4, 5))), equalTo(3)
+            Solution().findLongestChain(arrayOf(intArrayOf(1, 2), intArrayOf(7, 8), intArrayOf(4, 5))),
+            equalTo(3),
         )
     }
 }
diff --git a/src/test/kotlin/g0601_0700/s0648_replace_words/SolutionTest.kt b/src/test/kotlin/g0601_0700/s0648_replace_words/SolutionTest.kt
index e69ce3dea..912835dc1 100644
--- a/src/test/kotlin/g0601_0700/s0648_replace_words/SolutionTest.kt
+++ b/src/test/kotlin/g0601_0700/s0648_replace_words/SolutionTest.kt
@@ -11,9 +11,9 @@ internal class SolutionTest {
             Solution()
                 .replaceWords(
                     listOf("cat", "bat", "rat"),
-                    "the cattle was rattled by the battery"
+                    "the cattle was rattled by the battery",
                 ),
-            equalTo("the cat was rat by the bat")
+            equalTo("the cat was rat by the bat"),
         )
     }
 
@@ -22,7 +22,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .replaceWords(listOf("a", "b", "c"), "aadsfasf absbs bbab cadsfafs"),
-            equalTo("a a b c")
+            equalTo("a a b c"),
         )
     }
 }
diff --git a/src/test/kotlin/g0601_0700/s0652_find_duplicate_subtrees/SolutionTest.kt b/src/test/kotlin/g0601_0700/s0652_find_duplicate_subtrees/SolutionTest.kt
index d93a11671..d1d5cd2b6 100644
--- a/src/test/kotlin/g0601_0700/s0652_find_duplicate_subtrees/SolutionTest.kt
+++ b/src/test/kotlin/g0601_0700/s0652_find_duplicate_subtrees/SolutionTest.kt
@@ -14,7 +14,7 @@ internal class SolutionTest {
         val expected: List<TreeNode?> = listOf(item2, item1)
         assertThat(
             Solution().findDuplicateSubtrees(treeNode).toString(),
-            equalTo(expected.toString())
+            equalTo(expected.toString()),
         )
     }
 
@@ -26,7 +26,7 @@ internal class SolutionTest {
         val expected: List<TreeNode?> = listOf(item2, item1)
         assertThat(
             Solution().findDuplicateSubtrees(treeNode).toString(),
-            equalTo(expected.toString())
+            equalTo(expected.toString()),
         )
     }
 }
diff --git a/src/test/kotlin/g0601_0700/s0654_maximum_binary_tree/SolutionTest.kt b/src/test/kotlin/g0601_0700/s0654_maximum_binary_tree/SolutionTest.kt
index a9803e45c..fca3f7015 100644
--- a/src/test/kotlin/g0601_0700/s0654_maximum_binary_tree/SolutionTest.kt
+++ b/src/test/kotlin/g0601_0700/s0654_maximum_binary_tree/SolutionTest.kt
@@ -11,7 +11,7 @@ internal class SolutionTest {
         val expected = TreeNode.create(listOf(6, 3, 5, null, 2, 0, null, null, 1))
         assertThat(
             Solution().constructMaximumBinaryTree(intArrayOf(3, 2, 1, 6, 0, 5)).toString(),
-            equalTo(expected.toString())
+            equalTo(expected.toString()),
         )
     }
 
@@ -20,7 +20,7 @@ internal class SolutionTest {
         val expected = TreeNode.create(listOf(3, null, 2, null, 1))
         assertThat(
             Solution().constructMaximumBinaryTree(intArrayOf(3, 2, 1)).toString(),
-            equalTo(expected.toString())
+            equalTo(expected.toString()),
         )
     }
 }
diff --git a/src/test/kotlin/g0601_0700/s0655_print_binary_tree/SolutionTest.kt b/src/test/kotlin/g0601_0700/s0655_print_binary_tree/SolutionTest.kt
index ecc815787..be1245733 100644
--- a/src/test/kotlin/g0601_0700/s0655_print_binary_tree/SolutionTest.kt
+++ b/src/test/kotlin/g0601_0700/s0655_print_binary_tree/SolutionTest.kt
@@ -19,7 +19,7 @@ internal class SolutionTest {
         val expected = listOf(
             listOf("", "", "", "1", "", "", ""),
             listOf("", "2", "", "", "", "3", ""),
-            listOf("", "", "4", "", "", "", "")
+            listOf("", "", "4", "", "", "", ""),
         )
         assertThat(Solution().printTree(treeNode), equalTo(expected))
     }
diff --git a/src/test/kotlin/g0601_0700/s0658_find_k_closest_elements/SolutionTest.kt b/src/test/kotlin/g0601_0700/s0658_find_k_closest_elements/SolutionTest.kt
index a76f00942..2754895b3 100644
--- a/src/test/kotlin/g0601_0700/s0658_find_k_closest_elements/SolutionTest.kt
+++ b/src/test/kotlin/g0601_0700/s0658_find_k_closest_elements/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun findClosestElements() {
         assertThat(
             Solution().findClosestElements(intArrayOf(1, 2, 3, 4, 5), 4, 3),
-            equalTo(listOf(1, 2, 3, 4))
+            equalTo(listOf(1, 2, 3, 4)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun findClosestElements2() {
         assertThat(
             Solution().findClosestElements(intArrayOf(1, 2, 3, 4, 5), 4, -1),
-            equalTo(listOf(1, 2, 3, 4))
+            equalTo(listOf(1, 2, 3, 4)),
         )
     }
 }
diff --git a/src/test/kotlin/g0601_0700/s0661_image_smoother/SolutionTest.kt b/src/test/kotlin/g0601_0700/s0661_image_smoother/SolutionTest.kt
index 08addb818..1dc05397c 100644
--- a/src/test/kotlin/g0601_0700/s0661_image_smoother/SolutionTest.kt
+++ b/src/test/kotlin/g0601_0700/s0661_image_smoother/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun imageSmoother() {
         assertThat(
             Solution().imageSmoother(arrayOf(intArrayOf(1, 1, 1), intArrayOf(1, 0, 1), intArrayOf(1, 1, 1))),
-            equalTo(arrayOf(intArrayOf(0, 0, 0), intArrayOf(0, 0, 0), intArrayOf(0, 0, 0)))
+            equalTo(arrayOf(intArrayOf(0, 0, 0), intArrayOf(0, 0, 0), intArrayOf(0, 0, 0))),
         )
     }
 
@@ -18,7 +18,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .imageSmoother(arrayOf(intArrayOf(100, 200, 100), intArrayOf(200, 50, 200), intArrayOf(100, 200, 100))),
-            equalTo(arrayOf(intArrayOf(137, 141, 137), intArrayOf(141, 138, 141), intArrayOf(137, 141, 137)))
+            equalTo(arrayOf(intArrayOf(137, 141, 137), intArrayOf(141, 138, 141), intArrayOf(137, 141, 137))),
         )
     }
 }
diff --git a/src/test/kotlin/g0601_0700/s0675_cut_off_trees_for_golf_event/SolutionTest.kt b/src/test/kotlin/g0601_0700/s0675_cut_off_trees_for_golf_event/SolutionTest.kt
index d509303ff..e77d3e983 100644
--- a/src/test/kotlin/g0601_0700/s0675_cut_off_trees_for_golf_event/SolutionTest.kt
+++ b/src/test/kotlin/g0601_0700/s0675_cut_off_trees_for_golf_event/SolutionTest.kt
@@ -8,7 +8,9 @@ internal class SolutionTest {
     @Test
     fun cutOffTree() {
         val input = listOf(
-            listOf(1, 2, 3), listOf(0, 0, 4), listOf(7, 6, 5)
+            listOf(1, 2, 3),
+            listOf(0, 0, 4),
+            listOf(7, 6, 5),
         )
         assertThat(Solution().cutOffTree(input), equalTo(6))
     }
@@ -16,7 +18,9 @@ internal class SolutionTest {
     @Test
     fun cutOffTree2() {
         val input = listOf(
-            listOf(1, 2, 3), listOf(0, 0, 0), listOf(7, 6, 5)
+            listOf(1, 2, 3),
+            listOf(0, 0, 0),
+            listOf(7, 6, 5),
         )
         assertThat(Solution().cutOffTree(input), equalTo(-1))
     }
@@ -24,7 +28,9 @@ internal class SolutionTest {
     @Test
     fun cutOffTree3() {
         val input = listOf(
-            listOf(2, 3, 4), listOf(0, 0, 5), listOf(8, 7, 6)
+            listOf(2, 3, 4),
+            listOf(0, 0, 5),
+            listOf(8, 7, 6),
         )
         assertThat(Solution().cutOffTree(input), equalTo(6))
     }
diff --git a/src/test/kotlin/g0601_0700/s0682_baseball_game/SolutionTest.kt b/src/test/kotlin/g0601_0700/s0682_baseball_game/SolutionTest.kt
index 268e8ce10..e5c06858e 100644
--- a/src/test/kotlin/g0601_0700/s0682_baseball_game/SolutionTest.kt
+++ b/src/test/kotlin/g0601_0700/s0682_baseball_game/SolutionTest.kt
@@ -14,7 +14,7 @@ internal class SolutionTest {
     fun calPoints2() {
         assertThat(
             Solution().calPoints(arrayOf("5", "-2", "4", "C", "D", "9", "+", "+")),
-            equalTo(27)
+            equalTo(27),
         )
     }
 
diff --git a/src/test/kotlin/g0601_0700/s0684_redundant_connection/SolutionTest.kt b/src/test/kotlin/g0601_0700/s0684_redundant_connection/SolutionTest.kt
index a6c367aff..500d4eb1b 100644
--- a/src/test/kotlin/g0601_0700/s0684_redundant_connection/SolutionTest.kt
+++ b/src/test/kotlin/g0601_0700/s0684_redundant_connection/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun findRedundantConnection() {
         assertThat(
             Solution().findRedundantConnection(arrayOf(intArrayOf(1, 2), intArrayOf(1, 3), intArrayOf(2, 3))),
-            equalTo(intArrayOf(2, 3))
+            equalTo(intArrayOf(2, 3)),
         )
     }
 
@@ -23,10 +23,10 @@ internal class SolutionTest {
                         intArrayOf(2, 3),
                         intArrayOf(3, 4),
                         intArrayOf(1, 4),
-                        intArrayOf(1, 5)
-                    )
+                        intArrayOf(1, 5),
+                    ),
                 ),
-            equalTo(intArrayOf(1, 4))
+            equalTo(intArrayOf(1, 4)),
         )
     }
 }
diff --git a/src/test/kotlin/g0601_0700/s0685_redundant_connection_ii/SolutionTest.kt b/src/test/kotlin/g0601_0700/s0685_redundant_connection_ii/SolutionTest.kt
index 5162b785e..4aece3f16 100644
--- a/src/test/kotlin/g0601_0700/s0685_redundant_connection_ii/SolutionTest.kt
+++ b/src/test/kotlin/g0601_0700/s0685_redundant_connection_ii/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .findRedundantDirectedConnection(arrayOf(intArrayOf(1, 2), intArrayOf(1, 3), intArrayOf(2, 3))),
-            equalTo(intArrayOf(2, 3))
+            equalTo(intArrayOf(2, 3)),
         )
     }
 
@@ -24,10 +24,10 @@ internal class SolutionTest {
                         intArrayOf(2, 3),
                         intArrayOf(3, 4),
                         intArrayOf(4, 1),
-                        intArrayOf(1, 5)
-                    )
+                        intArrayOf(1, 5),
+                    ),
                 ),
-            equalTo(intArrayOf(4, 1))
+            equalTo(intArrayOf(4, 1)),
         )
     }
 }
diff --git a/src/test/kotlin/g0601_0700/s0689_maximum_sum_of_3_non_overlapping_subarrays/SolutionTest.kt b/src/test/kotlin/g0601_0700/s0689_maximum_sum_of_3_non_overlapping_subarrays/SolutionTest.kt
index 51b347dea..d2ca84e25 100644
--- a/src/test/kotlin/g0601_0700/s0689_maximum_sum_of_3_non_overlapping_subarrays/SolutionTest.kt
+++ b/src/test/kotlin/g0601_0700/s0689_maximum_sum_of_3_non_overlapping_subarrays/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun maxSumOfThreeSubarrays() {
         assertThat(
             Solution().maxSumOfThreeSubarrays(intArrayOf(1, 2, 1, 2, 6, 7, 5, 1), 2),
-            equalTo(intArrayOf(0, 3, 5))
+            equalTo(intArrayOf(0, 3, 5)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun maxSumOfThreeSubarrays2() {
         assertThat(
             Solution().maxSumOfThreeSubarrays(intArrayOf(1, 2, 1, 2, 1, 2, 1, 2, 1), 2),
-            equalTo(intArrayOf(0, 2, 4))
+            equalTo(intArrayOf(0, 2, 4)),
         )
     }
 }
diff --git a/src/test/kotlin/g0601_0700/s0690_employee_importance/SolutionTest.kt b/src/test/kotlin/g0601_0700/s0690_employee_importance/SolutionTest.kt
index b961978be..c7c03824f 100644
--- a/src/test/kotlin/g0601_0700/s0690_employee_importance/SolutionTest.kt
+++ b/src/test/kotlin/g0601_0700/s0690_employee_importance/SolutionTest.kt
@@ -11,7 +11,7 @@ internal class SolutionTest {
         val employees = listOf(
             Employee(1, 5, listOf(2, 3)),
             Employee(2, 3, listOf()),
-            Employee(3, 3, listOf())
+            Employee(3, 3, listOf()),
         )
         assertThat(Solution().getImportance(employees, 1), equalTo(11))
     }
@@ -22,7 +22,7 @@ internal class SolutionTest {
             Employee(1, 5, listOf(2, 3)),
             Employee(2, 3, listOf(4)),
             Employee(3, 4, listOf()),
-            Employee(4, 1, listOf())
+            Employee(4, 1, listOf()),
         )
         assertThat(Solution().getImportance(employees, 1), equalTo(13))
     }
diff --git a/src/test/kotlin/g0601_0700/s0691_stickers_to_spell_word/SolutionTest.kt b/src/test/kotlin/g0601_0700/s0691_stickers_to_spell_word/SolutionTest.kt
index f22a46a20..07026923b 100644
--- a/src/test/kotlin/g0601_0700/s0691_stickers_to_spell_word/SolutionTest.kt
+++ b/src/test/kotlin/g0601_0700/s0691_stickers_to_spell_word/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun minStickers() {
         assertThat(
             Solution().minStickers(arrayOf("with", "example", "science"), "thehat"),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun minStickers2() {
         assertThat(
             Solution().minStickers(arrayOf("notice", "possible"), "basicbasic"),
-            equalTo(-1)
+            equalTo(-1),
         )
     }
 }
diff --git a/src/test/kotlin/g0601_0700/s0692_top_k_frequent_words/SolutionTest.kt b/src/test/kotlin/g0601_0700/s0692_top_k_frequent_words/SolutionTest.kt
index 1259837d3..d0e89d5a6 100644
--- a/src/test/kotlin/g0601_0700/s0692_top_k_frequent_words/SolutionTest.kt
+++ b/src/test/kotlin/g0601_0700/s0692_top_k_frequent_words/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .topKFrequent(arrayOf("i", "love", "leetcode", "i", "love", "coding"), 2),
-            equalTo(listOf("i", "love"))
+            equalTo(listOf("i", "love")),
         )
     }
 
@@ -21,11 +21,11 @@ internal class SolutionTest {
                 .topKFrequent(
                     arrayOf(
                         "the", "day", "is", "sunny", "the", "the", "the", "sunny", "is",
-                        "is"
+                        "is",
                     ),
-                    4
+                    4,
                 ),
-            equalTo(listOf("the", "is", "sunny", "day"))
+            equalTo(listOf("the", "is", "sunny", "day")),
         )
     }
 }
diff --git a/src/test/kotlin/g0601_0700/s0695_max_area_of_island/SolutionTest.kt b/src/test/kotlin/g0601_0700/s0695_max_area_of_island/SolutionTest.kt
index 808afb41c..0dc10fd00 100644
--- a/src/test/kotlin/g0601_0700/s0695_max_area_of_island/SolutionTest.kt
+++ b/src/test/kotlin/g0601_0700/s0695_max_area_of_island/SolutionTest.kt
@@ -15,7 +15,7 @@ internal class SolutionTest {
             intArrayOf(0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0),
             intArrayOf(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0),
             intArrayOf(0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0),
-            intArrayOf(0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0)
+            intArrayOf(0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0),
         )
         assertThat(Solution().maxAreaOfIsland(grid), equalTo(6))
     }
diff --git a/src/test/kotlin/g0601_0700/s0697_degree_of_an_array/SolutionTest.kt b/src/test/kotlin/g0601_0700/s0697_degree_of_an_array/SolutionTest.kt
index e4d5ee579..c9b5ea803 100644
--- a/src/test/kotlin/g0601_0700/s0697_degree_of_an_array/SolutionTest.kt
+++ b/src/test/kotlin/g0601_0700/s0697_degree_of_an_array/SolutionTest.kt
@@ -13,7 +13,8 @@ internal class SolutionTest {
     @Test
     fun findShortestSubArray2() {
         assertThat(
-            Solution().findShortestSubArray(intArrayOf(1, 2, 2, 3, 1, 4, 2)), equalTo(6)
+            Solution().findShortestSubArray(intArrayOf(1, 2, 2, 3, 1, 4, 2)),
+            equalTo(6),
         )
     }
 }
diff --git a/src/test/kotlin/g0601_0700/s0698_partition_to_k_equal_sum_subsets/SolutionTest.kt b/src/test/kotlin/g0601_0700/s0698_partition_to_k_equal_sum_subsets/SolutionTest.kt
index 70b67629d..9f0af239f 100644
--- a/src/test/kotlin/g0601_0700/s0698_partition_to_k_equal_sum_subsets/SolutionTest.kt
+++ b/src/test/kotlin/g0601_0700/s0698_partition_to_k_equal_sum_subsets/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun canPartitionKSubsets() {
         assertThat(
             Solution().canPartitionKSubsets(intArrayOf(4, 3, 2, 3, 5, 2, 1), 4),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
diff --git a/src/test/kotlin/g0601_0700/s0699_falling_squares/SolutionTest.kt b/src/test/kotlin/g0601_0700/s0699_falling_squares/SolutionTest.kt
index 2693d8789..f5e672337 100644
--- a/src/test/kotlin/g0601_0700/s0699_falling_squares/SolutionTest.kt
+++ b/src/test/kotlin/g0601_0700/s0699_falling_squares/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun fallingSquares() {
         assertThat(
             Solution().fallingSquares(arrayOf(intArrayOf(1, 2), intArrayOf(2, 3), intArrayOf(6, 1))),
-            equalTo(listOf(2, 5, 5))
+            equalTo(listOf(2, 5, 5)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun fallingSquares2() {
         assertThat(
             Solution().fallingSquares(arrayOf(intArrayOf(100, 100), intArrayOf(200, 100))),
-            equalTo(listOf(100, 100))
+            equalTo(listOf(100, 100)),
         )
     }
 }
diff --git a/src/test/kotlin/g0701_0800/s0701_insert_into_a_binary_search_tree/SolutionTest.kt b/src/test/kotlin/g0701_0800/s0701_insert_into_a_binary_search_tree/SolutionTest.kt
index f17e20b9e..a4b9ce710 100644
--- a/src/test/kotlin/g0701_0800/s0701_insert_into_a_binary_search_tree/SolutionTest.kt
+++ b/src/test/kotlin/g0701_0800/s0701_insert_into_a_binary_search_tree/SolutionTest.kt
@@ -11,7 +11,8 @@ internal class SolutionTest {
         val treeNode: TreeNode? = TreeNode.create(listOf(4, 2, 7, 1, 3))
         val expected: TreeNode? = TreeNode.create(listOf(4, 2, 7, 1, 3, 5))
         assertThat(
-            Solution().insertIntoBST(treeNode, 5).toString(), equalTo(expected.toString())
+            Solution().insertIntoBST(treeNode, 5).toString(),
+            equalTo(expected.toString()),
         )
     }
 
@@ -21,7 +22,7 @@ internal class SolutionTest {
         val expected: TreeNode? = TreeNode.create(listOf(40, 20, 60, 10, 30, 50, 70, null, null, 25))
         assertThat(
             Solution().insertIntoBST(treeNode, 25).toString(),
-            equalTo(expected.toString())
+            equalTo(expected.toString()),
         )
     }
 
@@ -30,7 +31,8 @@ internal class SolutionTest {
         val treeNode: TreeNode? = TreeNode.create(listOf(4, 2, 7, 1, 3, null, null, null, null, null, null))
         val expected: TreeNode? = TreeNode.create(listOf(4, 2, 7, 1, 3, 5))
         assertThat(
-            Solution().insertIntoBST(treeNode, 5).toString(), equalTo(expected.toString())
+            Solution().insertIntoBST(treeNode, 5).toString(),
+            equalTo(expected.toString()),
         )
     }
 }
diff --git a/src/test/kotlin/g0701_0800/s0713_subarray_product_less_than_k/SolutionTest.kt b/src/test/kotlin/g0701_0800/s0713_subarray_product_less_than_k/SolutionTest.kt
index 54c482425..2f0457970 100644
--- a/src/test/kotlin/g0701_0800/s0713_subarray_product_less_than_k/SolutionTest.kt
+++ b/src/test/kotlin/g0701_0800/s0713_subarray_product_less_than_k/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun numSubarrayProductLessThanK() {
         assertThat(
             Solution().numSubarrayProductLessThanK(intArrayOf(10, 5, 2, 6), 100),
-            equalTo(8)
+            equalTo(8),
         )
     }
 
diff --git a/src/test/kotlin/g0701_0800/s0718_maximum_length_of_repeated_subarray/SolutionTest.kt b/src/test/kotlin/g0701_0800/s0718_maximum_length_of_repeated_subarray/SolutionTest.kt
index 52eada8fb..89e60db66 100644
--- a/src/test/kotlin/g0701_0800/s0718_maximum_length_of_repeated_subarray/SolutionTest.kt
+++ b/src/test/kotlin/g0701_0800/s0718_maximum_length_of_repeated_subarray/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun findLength() {
         assertThat(
             Solution().findLength(intArrayOf(1, 2, 3, 2, 1), intArrayOf(3, 2, 1, 4, 7)),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun findLength2() {
         assertThat(
             Solution().findLength(intArrayOf(0, 0, 0, 0, 0), intArrayOf(0, 0, 0, 0, 0)),
-            equalTo(5)
+            equalTo(5),
         )
     }
 }
diff --git a/src/test/kotlin/g0701_0800/s0720_longest_word_in_dictionary/SolutionTest.kt b/src/test/kotlin/g0701_0800/s0720_longest_word_in_dictionary/SolutionTest.kt
index 70f648048..3cc8f4a2b 100644
--- a/src/test/kotlin/g0701_0800/s0720_longest_word_in_dictionary/SolutionTest.kt
+++ b/src/test/kotlin/g0701_0800/s0720_longest_word_in_dictionary/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun longestWord() {
         assertThat(
             Solution().longestWord(arrayOf("w", "wo", "wor", "worl", "world")),
-            equalTo("world")
+            equalTo("world"),
         )
     }
 
@@ -19,10 +19,16 @@ internal class SolutionTest {
             Solution()
                 .longestWord(
                     arrayOf(
-                        "a", "banana", "app", "appl", "ap", "apply", "apple"
-                    )
+                        "a",
+                        "banana",
+                        "app",
+                        "appl",
+                        "ap",
+                        "apply",
+                        "apple",
+                    ),
                 ),
-            equalTo("apple")
+            equalTo("apple"),
         )
     }
 }
diff --git a/src/test/kotlin/g0701_0800/s0721_accounts_merge/SolutionTest.kt b/src/test/kotlin/g0701_0800/s0721_accounts_merge/SolutionTest.kt
index d16995c52..8b47afc62 100644
--- a/src/test/kotlin/g0701_0800/s0721_accounts_merge/SolutionTest.kt
+++ b/src/test/kotlin/g0701_0800/s0721_accounts_merge/SolutionTest.kt
@@ -11,17 +11,17 @@ internal class SolutionTest {
             listOf("John", "johnsmith@mail.com", "john_newyork@mail.com"),
             listOf("John", "johnsmith@mail.com", "john00@mail.com"),
             listOf("Mary", "mary@mail.com"),
-            listOf("John", "johnnybravo@mail.com")
+            listOf("John", "johnnybravo@mail.com"),
         )
         val expected = listOf(
             listOf(
                 "John",
                 "john00@mail.com",
                 "john_newyork@mail.com",
-                "johnsmith@mail.com"
+                "johnsmith@mail.com",
             ),
             listOf("Mary", "mary@mail.com"),
-            listOf("John", "johnnybravo@mail.com")
+            listOf("John", "johnnybravo@mail.com"),
         )
         assertThat(Solution().accountsMerge(input).toString(), equalTo(expected.toString()))
     }
@@ -33,7 +33,7 @@ internal class SolutionTest {
             listOf("Kevin", "Kevin3@m.co", "Kevin5@m.co", "Kevin0@m.co"),
             listOf("Ethan", "Ethan5@m.co", "Ethan4@m.co", "Ethan0@m.co"),
             listOf("Hanzo", "Hanzo3@m.co", "Hanzo1@m.co", "Hanzo0@m.co"),
-            listOf("Fern", "Fern5@m.co", "Fern1@m.co", "Fern0@m.co")
+            listOf("Fern", "Fern5@m.co", "Fern1@m.co", "Fern0@m.co"),
         )
         val expected = listOf(
             listOf("Gabe", "Gabe0@m.co", "Gabe1@m.co", "Gabe3@m.co"),
diff --git a/src/test/kotlin/g0701_0800/s0722_remove_comments/SolutionTest.kt b/src/test/kotlin/g0701_0800/s0722_remove_comments/SolutionTest.kt
index 2c1ad37b0..74ab6316e 100644
--- a/src/test/kotlin/g0701_0800/s0722_remove_comments/SolutionTest.kt
+++ b/src/test/kotlin/g0701_0800/s0722_remove_comments/SolutionTest.kt
@@ -18,7 +18,7 @@ internal class SolutionTest {
             "   comment for ",
             "   testing */",
             "a = b + c;",
-            "}"
+            "}",
         )
         val expected = listOf("int main()", "{ ", "  ", "int a, b, c;", "a = b + c;", "}")
         assertThat(Solution().removeComments(input), equalTo(expected))
diff --git a/src/test/kotlin/g0701_0800/s0725_split_linked_list_in_parts/SolutionTest.kt b/src/test/kotlin/g0701_0800/s0725_split_linked_list_in_parts/SolutionTest.kt
index b86a53a10..56d4b8f54 100644
--- a/src/test/kotlin/g0701_0800/s0725_split_linked_list_in_parts/SolutionTest.kt
+++ b/src/test/kotlin/g0701_0800/s0725_split_linked_list_in_parts/SolutionTest.kt
@@ -14,11 +14,11 @@ internal class SolutionTest {
             contructLinkedList(intArrayOf(2)),
             contructLinkedList(intArrayOf(3)),
             contructLinkedList(intArrayOf()),
-            contructLinkedList(intArrayOf())
+            contructLinkedList(intArrayOf()),
         )
         assertThat(
             Solution().splitListToParts(listNode, 5).contentToString(),
-            equalTo(expected.contentToString())
+            equalTo(expected.contentToString()),
         )
     }
 
@@ -28,11 +28,11 @@ internal class SolutionTest {
         val expected = arrayOf(
             contructLinkedList(intArrayOf(1, 2, 3, 4)),
             contructLinkedList(intArrayOf(5, 6, 7)),
-            contructLinkedList(intArrayOf(8, 9, 10))
+            contructLinkedList(intArrayOf(8, 9, 10)),
         )
         assertThat(
             Solution().splitListToParts(listNode, 3).contentToString(),
-            equalTo(expected.contentToString())
+            equalTo(expected.contentToString()),
         )
     }
 }
diff --git a/src/test/kotlin/g0701_0800/s0728_self_dividing_numbers/SolutionTest.kt b/src/test/kotlin/g0701_0800/s0728_self_dividing_numbers/SolutionTest.kt
index 5d26dd240..91d7b087c 100644
--- a/src/test/kotlin/g0701_0800/s0728_self_dividing_numbers/SolutionTest.kt
+++ b/src/test/kotlin/g0701_0800/s0728_self_dividing_numbers/SolutionTest.kt
@@ -9,14 +9,15 @@ internal class SolutionTest {
     fun selfDividingNumbers() {
         assertThat(
             Solution().selfDividingNumbers(1, 22),
-            equalTo(listOf(1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 15, 22))
+            equalTo(listOf(1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 15, 22)),
         )
     }
 
     @Test
     fun selfDividingNumbers2() {
         assertThat(
-            Solution().selfDividingNumbers(47, 85), equalTo(listOf(48, 55, 66, 77))
+            Solution().selfDividingNumbers(47, 85),
+            equalTo(listOf(48, 55, 66, 77)),
         )
     }
 }
diff --git a/src/test/kotlin/g0701_0800/s0730_count_different_palindromic_subsequences/SolutionTest.kt b/src/test/kotlin/g0701_0800/s0730_count_different_palindromic_subsequences/SolutionTest.kt
index 7f795be3e..28d709e51 100644
--- a/src/test/kotlin/g0701_0800/s0730_count_different_palindromic_subsequences/SolutionTest.kt
+++ b/src/test/kotlin/g0701_0800/s0730_count_different_palindromic_subsequences/SolutionTest.kt
@@ -15,9 +15,9 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .countPalindromicSubsequences(
-                    "abcdabcdabcdabcdabcdabcdabcdabcddcbadcbadcbadcbadcbadcbadcbadcba"
+                    "abcdabcdabcdabcdabcdabcdabcdabcddcbadcbadcbadcbadcbadcbadcbadcba",
                 ),
-            equalTo(104860361)
+            equalTo(104860361),
         )
     }
 }
diff --git a/src/test/kotlin/g0701_0800/s0733_flood_fill/SolutionTest.kt b/src/test/kotlin/g0701_0800/s0733_flood_fill/SolutionTest.kt
index 6c9ce859c..e0003439a 100644
--- a/src/test/kotlin/g0701_0800/s0733_flood_fill/SolutionTest.kt
+++ b/src/test/kotlin/g0701_0800/s0733_flood_fill/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun floodFill() {
         assertThat(
             Solution().floodFill(arrayOf(intArrayOf(1, 1, 1), intArrayOf(1, 1, 0), intArrayOf(1, 0, 1)), 1, 1, 2),
-            equalTo(arrayOf(intArrayOf(2, 2, 2), intArrayOf(2, 2, 0), intArrayOf(2, 0, 1)))
+            equalTo(arrayOf(intArrayOf(2, 2, 2), intArrayOf(2, 2, 0), intArrayOf(2, 0, 1))),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun floodFill2() {
         assertThat(
             Solution().floodFill(arrayOf(intArrayOf(0, 0, 0), intArrayOf(0, 0, 0)), 1, 1, 2),
-            equalTo(arrayOf(intArrayOf(2, 2, 2), intArrayOf(2, 2, 2)))
+            equalTo(arrayOf(intArrayOf(2, 2, 2), intArrayOf(2, 2, 2))),
         )
     }
 }
diff --git a/src/test/kotlin/g0701_0800/s0735_asteroid_collision/SolutionTest.kt b/src/test/kotlin/g0701_0800/s0735_asteroid_collision/SolutionTest.kt
index 810e36cef..95e1e3736 100644
--- a/src/test/kotlin/g0701_0800/s0735_asteroid_collision/SolutionTest.kt
+++ b/src/test/kotlin/g0701_0800/s0735_asteroid_collision/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun asteroidCollision() {
         assertThat(
             Solution().asteroidCollision(intArrayOf(5, 10, -5)),
-            equalTo(intArrayOf(5, 10))
+            equalTo(intArrayOf(5, 10)),
         )
     }
 
@@ -21,7 +21,8 @@ internal class SolutionTest {
     @Test
     fun asteroidCollision3() {
         assertThat(
-            Solution().asteroidCollision(intArrayOf(10, 2, -5)), equalTo(intArrayOf(10))
+            Solution().asteroidCollision(intArrayOf(10, 2, -5)),
+            equalTo(intArrayOf(10)),
         )
     }
 }
diff --git a/src/test/kotlin/g0701_0800/s0736_parse_lisp_expression/SolutionTest.kt b/src/test/kotlin/g0701_0800/s0736_parse_lisp_expression/SolutionTest.kt
index cdd933075..a30f30190 100644
--- a/src/test/kotlin/g0701_0800/s0736_parse_lisp_expression/SolutionTest.kt
+++ b/src/test/kotlin/g0701_0800/s0736_parse_lisp_expression/SolutionTest.kt
@@ -8,7 +8,8 @@ internal class SolutionTest {
     @Test
     fun evaluate() {
         assertThat(
-            Solution().evaluate("(let x 2 (mult x (let x 3 y 4 (add x y))))"), equalTo(14)
+            Solution().evaluate("(let x 2 (mult x (let x 3 y 4 (add x y))))"),
+            equalTo(14),
         )
     }
 
diff --git a/src/test/kotlin/g0701_0800/s0739_daily_temperatures/SolutionTest.kt b/src/test/kotlin/g0701_0800/s0739_daily_temperatures/SolutionTest.kt
index 4fe32baed..862f5fdb0 100644
--- a/src/test/kotlin/g0701_0800/s0739_daily_temperatures/SolutionTest.kt
+++ b/src/test/kotlin/g0701_0800/s0739_daily_temperatures/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun dailyTemperatures() {
         assertThat(
             Solution().dailyTemperatures(intArrayOf(73, 74, 75, 71, 69, 72, 76, 73)),
-            equalTo(intArrayOf(1, 1, 4, 2, 1, 1, 0, 0))
+            equalTo(intArrayOf(1, 1, 4, 2, 1, 1, 0, 0)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun dailyTemperatures2() {
         assertThat(
             Solution().dailyTemperatures(intArrayOf(30, 40, 50, 60)),
-            equalTo(intArrayOf(1, 1, 1, 0))
+            equalTo(intArrayOf(1, 1, 1, 0)),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun dailyTemperatures3() {
         assertThat(
             Solution().dailyTemperatures(intArrayOf(30, 60, 90)),
-            equalTo(intArrayOf(1, 1, 0))
+            equalTo(intArrayOf(1, 1, 0)),
         )
     }
 }
diff --git a/src/test/kotlin/g0701_0800/s0741_cherry_pickup/SolutionTest.kt b/src/test/kotlin/g0701_0800/s0741_cherry_pickup/SolutionTest.kt
index 075ce536b..14504d35b 100644
--- a/src/test/kotlin/g0701_0800/s0741_cherry_pickup/SolutionTest.kt
+++ b/src/test/kotlin/g0701_0800/s0741_cherry_pickup/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun cherryPickup() {
         assertThat(
             Solution().cherryPickup(arrayOf(intArrayOf(0, 1, -1), intArrayOf(1, 0, -1), intArrayOf(1, 1, 1))),
-            equalTo(5)
+            equalTo(5),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun cherryPickup2() {
         assertThat(
             Solution().cherryPickup(arrayOf(intArrayOf(1, 1, -1), intArrayOf(1, -1, 1), intArrayOf(-1, 1, 1))),
-            equalTo(0)
+            equalTo(0),
         )
     }
 }
diff --git a/src/test/kotlin/g0701_0800/s0743_network_delay_time/SolutionTest.kt b/src/test/kotlin/g0701_0800/s0743_network_delay_time/SolutionTest.kt
index be0371806..b59a84ce0 100644
--- a/src/test/kotlin/g0701_0800/s0743_network_delay_time/SolutionTest.kt
+++ b/src/test/kotlin/g0701_0800/s0743_network_delay_time/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .networkDelayTime(arrayOf(intArrayOf(2, 1, 1), intArrayOf(2, 3, 1), intArrayOf(3, 4, 1)), 4, 2),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
diff --git a/src/test/kotlin/g0701_0800/s0744_find_smallest_letter_greater_than_target/SolutionTest.kt b/src/test/kotlin/g0701_0800/s0744_find_smallest_letter_greater_than_target/SolutionTest.kt
index a3a40a0c5..a79a7505d 100644
--- a/src/test/kotlin/g0701_0800/s0744_find_smallest_letter_greater_than_target/SolutionTest.kt
+++ b/src/test/kotlin/g0701_0800/s0744_find_smallest_letter_greater_than_target/SolutionTest.kt
@@ -8,28 +8,32 @@ internal class SolutionTest {
     @Test
     fun nextGreatestLetter() {
         assertThat(
-            Solution().nextGreatestLetter(charArrayOf('c', 'f', 'j'), 'a'), equalTo('c')
+            Solution().nextGreatestLetter(charArrayOf('c', 'f', 'j'), 'a'),
+            equalTo('c'),
         )
     }
 
     @Test
     fun nextGreatestLetter2() {
         assertThat(
-            Solution().nextGreatestLetter(charArrayOf('c', 'f', 'j'), 'c'), equalTo('f')
+            Solution().nextGreatestLetter(charArrayOf('c', 'f', 'j'), 'c'),
+            equalTo('f'),
         )
     }
 
     @Test
     fun nextGreatestLetter3() {
         assertThat(
-            Solution().nextGreatestLetter(charArrayOf('c', 'f', 'j'), 'd'), equalTo('f')
+            Solution().nextGreatestLetter(charArrayOf('c', 'f', 'j'), 'd'),
+            equalTo('f'),
         )
     }
 
     @Test
     fun nextGreatestLetter4() {
         assertThat(
-            Solution().nextGreatestLetter(charArrayOf('c', 'f', 'j'), 'k'), equalTo('c')
+            Solution().nextGreatestLetter(charArrayOf('c', 'f', 'j'), 'k'),
+            equalTo('c'),
         )
     }
 }
diff --git a/src/test/kotlin/g0701_0800/s0746_min_cost_climbing_stairs/SolutionTest.kt b/src/test/kotlin/g0701_0800/s0746_min_cost_climbing_stairs/SolutionTest.kt
index 39b81e427..34dec2dc6 100644
--- a/src/test/kotlin/g0701_0800/s0746_min_cost_climbing_stairs/SolutionTest.kt
+++ b/src/test/kotlin/g0701_0800/s0746_min_cost_climbing_stairs/SolutionTest.kt
@@ -15,7 +15,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .minCostClimbingStairs(intArrayOf(1, 100, 1, 1, 1, 100, 1, 1, 100, 1)),
-            equalTo(6)
+            equalTo(6),
         )
     }
 }
diff --git a/src/test/kotlin/g0701_0800/s0748_shortest_completing_word/SolutionTest.kt b/src/test/kotlin/g0701_0800/s0748_shortest_completing_word/SolutionTest.kt
index 205a71a0f..7f34533dc 100644
--- a/src/test/kotlin/g0701_0800/s0748_shortest_completing_word/SolutionTest.kt
+++ b/src/test/kotlin/g0701_0800/s0748_shortest_completing_word/SolutionTest.kt
@@ -10,9 +10,10 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .shortestCompletingWord(
-                    "1s3 PSt", arrayOf("step", "steps", "stripe", "stepple")
+                    "1s3 PSt",
+                    arrayOf("step", "steps", "stripe", "stepple"),
                 ),
-            equalTo("steps")
+            equalTo("steps"),
         )
     }
 
@@ -21,9 +22,10 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .shortestCompletingWord(
-                    "1s3 456", arrayOf("looks", "pest", "stew", "show")
+                    "1s3 456",
+                    arrayOf("looks", "pest", "stew", "show"),
                 ),
-            equalTo("pest")
+            equalTo("pest"),
         )
     }
 }
diff --git a/src/test/kotlin/g0701_0800/s0749_contain_virus/SolutionTest.kt b/src/test/kotlin/g0701_0800/s0749_contain_virus/SolutionTest.kt
index c1c5c9e42..bddc7b925 100644
--- a/src/test/kotlin/g0701_0800/s0749_contain_virus/SolutionTest.kt
+++ b/src/test/kotlin/g0701_0800/s0749_contain_virus/SolutionTest.kt
@@ -11,7 +11,7 @@ internal class SolutionTest {
             intArrayOf(0, 1, 0, 0, 0, 0, 0, 1),
             intArrayOf(0, 1, 0, 0, 0, 0, 0, 1),
             intArrayOf(0, 0, 0, 0, 0, 0, 0, 1),
-            intArrayOf(0, 0, 0, 0, 0, 0, 0, 0)
+            intArrayOf(0, 0, 0, 0, 0, 0, 0, 0),
         )
         assertThat(Solution().containVirus(input), equalTo(10))
     }
@@ -27,7 +27,7 @@ internal class SolutionTest {
         val input = arrayOf(
             intArrayOf(1, 1, 1, 0, 0, 0, 0, 0, 0),
             intArrayOf(1, 0, 1, 0, 1, 1, 1, 1, 1),
-            intArrayOf(1, 1, 1, 0, 0, 0, 0, 0, 0)
+            intArrayOf(1, 1, 1, 0, 0, 0, 0, 0, 0),
         )
         assertThat(Solution().containVirus(input), equalTo(13))
     }
diff --git a/src/test/kotlin/g0701_0800/s0752_open_the_lock/SolutionTest.kt b/src/test/kotlin/g0701_0800/s0752_open_the_lock/SolutionTest.kt
index 105a6c33c..bbebe3814 100644
--- a/src/test/kotlin/g0701_0800/s0752_open_the_lock/SolutionTest.kt
+++ b/src/test/kotlin/g0701_0800/s0752_open_the_lock/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .openLock(arrayOf("0201", "0101", "0102", "1212", "2002"), "0202"),
-            equalTo(6)
+            equalTo(6),
         )
     }
 
@@ -25,11 +25,18 @@ internal class SolutionTest {
             Solution()
                 .openLock(
                     arrayOf(
-                        "8887", "8889", "8878", "8898", "8788", "8988", "7888", "9888"
+                        "8887",
+                        "8889",
+                        "8878",
+                        "8898",
+                        "8788",
+                        "8988",
+                        "7888",
+                        "9888",
                     ),
-                    "8888"
+                    "8888",
                 ),
-            equalTo(-1)
+            equalTo(-1),
         )
     }
 }
diff --git a/src/test/kotlin/g0701_0800/s0756_pyramid_transition_matrix/SolutionTest.kt b/src/test/kotlin/g0701_0800/s0756_pyramid_transition_matrix/SolutionTest.kt
index 80a4b1d57..c458edbfa 100644
--- a/src/test/kotlin/g0701_0800/s0756_pyramid_transition_matrix/SolutionTest.kt
+++ b/src/test/kotlin/g0701_0800/s0756_pyramid_transition_matrix/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun pyramidTransition() {
         assertThat(
             Solution().pyramidTransition("BCD", listOf("BCC", "CDE", "CEA", "FFF")),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
@@ -18,9 +18,10 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .pyramidTransition(
-                    "AAAA", listOf("AAB", "AAC", "BCD", "BBE", "DEF")
+                    "AAAA",
+                    listOf("AAB", "AAC", "BCD", "BBE", "DEF"),
                 ),
-            equalTo(false)
+            equalTo(false),
         )
     }
 }
diff --git a/src/test/kotlin/g0701_0800/s0757_set_intersection_size_at_least_two/SolutionTest.kt b/src/test/kotlin/g0701_0800/s0757_set_intersection_size_at_least_two/SolutionTest.kt
index f1ecf5420..b146329b5 100644
--- a/src/test/kotlin/g0701_0800/s0757_set_intersection_size_at_least_two/SolutionTest.kt
+++ b/src/test/kotlin/g0701_0800/s0757_set_intersection_size_at_least_two/SolutionTest.kt
@@ -13,10 +13,10 @@ internal class SolutionTest {
                     intArrayOf(1, 3),
                     intArrayOf(1, 4),
                     intArrayOf(2, 5),
-                    intArrayOf(3, 5)
-                )
+                    intArrayOf(3, 5),
+                ),
             ),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
@@ -28,10 +28,10 @@ internal class SolutionTest {
                     intArrayOf(1, 2),
                     intArrayOf(2, 3),
                     intArrayOf(2, 4),
-                    intArrayOf(4, 5)
-                )
+                    intArrayOf(4, 5),
+                ),
             ),
-            equalTo(5)
+            equalTo(5),
         )
     }
 }
diff --git a/src/test/kotlin/g0701_0800/s0763_partition_labels/SolutionTest.kt b/src/test/kotlin/g0701_0800/s0763_partition_labels/SolutionTest.kt
index c554e6061..4ed608d93 100644
--- a/src/test/kotlin/g0701_0800/s0763_partition_labels/SolutionTest.kt
+++ b/src/test/kotlin/g0701_0800/s0763_partition_labels/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun partitionLabels() {
         assertThat(
             Solution().partitionLabels("ababcbacadefegdehijhklij"),
-            equalTo(listOf(9, 7, 8))
+            equalTo(listOf(9, 7, 8)),
         )
     }
 
diff --git a/src/test/kotlin/g0701_0800/s0765_couples_holding_hands/SolutionTest.kt b/src/test/kotlin/g0701_0800/s0765_couples_holding_hands/SolutionTest.kt
index 1a338183e..631689515 100644
--- a/src/test/kotlin/g0701_0800/s0765_couples_holding_hands/SolutionTest.kt
+++ b/src/test/kotlin/g0701_0800/s0765_couples_holding_hands/SolutionTest.kt
@@ -14,7 +14,7 @@ internal class SolutionTest {
     fun minSwapsCouples2() {
         assertThat(
             Solution().minSwapsCouples(intArrayOf(0, 4, 7, 3, 1, 5, 2, 8, 6, 9)),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
@@ -22,7 +22,7 @@ internal class SolutionTest {
     fun minSwapsCouples3() {
         assertThat(
             Solution().minSwapsCouples(intArrayOf(5, 6, 4, 0, 2, 1, 9, 3, 8, 7, 11, 10)),
-            equalTo(4)
+            equalTo(4),
         )
     }
 }
diff --git a/src/test/kotlin/g0701_0800/s0766_toeplitz_matrix/SolutionTest.kt b/src/test/kotlin/g0701_0800/s0766_toeplitz_matrix/SolutionTest.kt
index 1d2e54425..c6c158dcd 100644
--- a/src/test/kotlin/g0701_0800/s0766_toeplitz_matrix/SolutionTest.kt
+++ b/src/test/kotlin/g0701_0800/s0766_toeplitz_matrix/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .isToeplitzMatrix(arrayOf(intArrayOf(1, 2, 3, 4), intArrayOf(5, 1, 2, 3), intArrayOf(9, 5, 1, 2))),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
@@ -19,7 +19,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .isToeplitzMatrix(arrayOf(intArrayOf(1, 2), intArrayOf(2, 2))),
-            equalTo(false)
+            equalTo(false),
         )
     }
 
@@ -31,10 +31,10 @@ internal class SolutionTest {
                     arrayOf(
                         intArrayOf(1, 2, 3, 4, 5, 9),
                         intArrayOf(5, 1, 2, 3, 4, 5),
-                        intArrayOf(9, 5, 1, 2, 3, 4)
-                    )
+                        intArrayOf(9, 5, 1, 2, 3, 4),
+                    ),
                 ),
-            equalTo(true)
+            equalTo(true),
         )
     }
 }
diff --git a/src/test/kotlin/g0701_0800/s0770_basic_calculator_iv/SolutionTest.kt b/src/test/kotlin/g0701_0800/s0770_basic_calculator_iv/SolutionTest.kt
index f05a14bc0..0461acc70 100644
--- a/src/test/kotlin/g0701_0800/s0770_basic_calculator_iv/SolutionTest.kt
+++ b/src/test/kotlin/g0701_0800/s0770_basic_calculator_iv/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .basicCalculatorIV("e + 8 - a + 5", arrayOf("e"), intArrayOf(1)),
-            equalTo(listOf("-1*a", "14"))
+            equalTo(listOf("-1*a", "14")),
         )
     }
 
@@ -19,9 +19,11 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .basicCalculatorIV(
-                    "e - 8 + temperature - pressure", arrayOf("e", "temperature"), intArrayOf(1, 12)
+                    "e - 8 + temperature - pressure",
+                    arrayOf("e", "temperature"),
+                    intArrayOf(1, 12),
                 ),
-            equalTo(listOf("-1*pressure", "5"))
+            equalTo(listOf("-1*pressure", "5")),
         )
     }
 
@@ -30,7 +32,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .basicCalculatorIV("(e + 8) * (e - 8)", arrayOf(), intArrayOf()),
-            equalTo(listOf("1*e*e", "-64"))
+            equalTo(listOf("1*e*e", "-64")),
         )
     }
 }
diff --git a/src/test/kotlin/g0701_0800/s0778_swim_in_rising_water/SolutionTest.kt b/src/test/kotlin/g0701_0800/s0778_swim_in_rising_water/SolutionTest.kt
index 1bca46157..efb1cd808 100644
--- a/src/test/kotlin/g0701_0800/s0778_swim_in_rising_water/SolutionTest.kt
+++ b/src/test/kotlin/g0701_0800/s0778_swim_in_rising_water/SolutionTest.kt
@@ -20,10 +20,10 @@ internal class SolutionTest {
                         intArrayOf(24, 23, 22, 21, 5),
                         intArrayOf(12, 13, 14, 15, 16),
                         intArrayOf(11, 17, 18, 19, 20),
-                        intArrayOf(10, 9, 8, 7, 6)
-                    )
+                        intArrayOf(10, 9, 8, 7, 6),
+                    ),
                 ),
-            equalTo(16)
+            equalTo(16),
         )
     }
 }
diff --git a/src/test/kotlin/g0701_0800/s0782_transform_to_chessboard/SolutionTest.kt b/src/test/kotlin/g0701_0800/s0782_transform_to_chessboard/SolutionTest.kt
index 1177e5912..bbe5bd8b8 100644
--- a/src/test/kotlin/g0701_0800/s0782_transform_to_chessboard/SolutionTest.kt
+++ b/src/test/kotlin/g0701_0800/s0782_transform_to_chessboard/SolutionTest.kt
@@ -14,10 +14,10 @@ internal class SolutionTest {
                         intArrayOf(0, 1, 1, 0),
                         intArrayOf(0, 1, 1, 0),
                         intArrayOf(1, 0, 0, 1),
-                        intArrayOf(1, 0, 0, 1)
-                    )
+                        intArrayOf(1, 0, 0, 1),
+                    ),
                 ),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -40,10 +40,10 @@ internal class SolutionTest {
                         intArrayOf(0, 0, 1, 1),
                         intArrayOf(1, 1, 0, 0),
                         intArrayOf(0, 1, 0, 1),
-                        intArrayOf(1, 0, 1, 0)
-                    )
+                        intArrayOf(1, 0, 1, 0),
+                    ),
                 ),
-            equalTo(-1)
+            equalTo(-1),
         )
     }
 
@@ -56,10 +56,10 @@ internal class SolutionTest {
                         intArrayOf(1, 1, 1, 1),
                         intArrayOf(1, 1, 1, 1),
                         intArrayOf(0, 0, 0, 0),
-                        intArrayOf(0, 0, 0, 0)
-                    )
+                        intArrayOf(0, 0, 0, 0),
+                    ),
                 ),
-            equalTo(-1)
+            equalTo(-1),
         )
     }
 
@@ -71,10 +71,10 @@ internal class SolutionTest {
                     arrayOf(
                         intArrayOf(1, 1, 0),
                         intArrayOf(0, 0, 1),
-                        intArrayOf(0, 0, 1)
-                    )
+                        intArrayOf(0, 0, 1),
+                    ),
                 ),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -86,10 +86,10 @@ internal class SolutionTest {
                     arrayOf(
                         intArrayOf(1, 0, 0),
                         intArrayOf(0, 1, 1),
-                        intArrayOf(1, 0, 0)
-                    )
+                        intArrayOf(1, 0, 0),
+                    ),
                 ),
-            equalTo(1)
+            equalTo(1),
         )
     }
 }
diff --git a/src/test/kotlin/g0701_0800/s0783_minimum_distance_between_bst_nodes/SolutionTest.kt b/src/test/kotlin/g0701_0800/s0783_minimum_distance_between_bst_nodes/SolutionTest.kt
index f054bbb03..8e735f203 100644
--- a/src/test/kotlin/g0701_0800/s0783_minimum_distance_between_bst_nodes/SolutionTest.kt
+++ b/src/test/kotlin/g0701_0800/s0783_minimum_distance_between_bst_nodes/SolutionTest.kt
@@ -12,10 +12,10 @@ internal class SolutionTest {
             Solution()
                 .minDiffInBST(
                     TreeNode.create(
-                        listOf(4, 2, 6, 1, 3, null, null)
-                    )
+                        listOf(4, 2, 6, 1, 3, null, null),
+                    ),
                 ),
-            equalTo(1)
+            equalTo(1),
         )
     }
 
@@ -25,10 +25,10 @@ internal class SolutionTest {
             Solution()
                 .minDiffInBST(
                     TreeNode.create(
-                        listOf(1, 0, 48, null, null, 12, 49)
-                    )
+                        listOf(1, 0, 48, null, null, 12, 49),
+                    ),
                 ),
-            equalTo(1)
+            equalTo(1),
         )
     }
 }
diff --git a/src/test/kotlin/g0701_0800/s0784_letter_case_permutation/SolutionTest.kt b/src/test/kotlin/g0701_0800/s0784_letter_case_permutation/SolutionTest.kt
index 28859e0f4..14ff60a4b 100644
--- a/src/test/kotlin/g0701_0800/s0784_letter_case_permutation/SolutionTest.kt
+++ b/src/test/kotlin/g0701_0800/s0784_letter_case_permutation/SolutionTest.kt
@@ -9,14 +9,15 @@ internal class SolutionTest {
     fun letterCasePermutation() {
         assertThat(
             Solution().letterCasePermutation("a1b2"),
-            equalTo(listOf("a1b2", "a1B2", "A1b2", "A1B2"))
+            equalTo(listOf("a1b2", "a1B2", "A1b2", "A1B2")),
         )
     }
 
     @Test
     fun letterCasePermutation2() {
         assertThat(
-            Solution().letterCasePermutation("3z4"), equalTo(listOf("3z4", "3Z4"))
+            Solution().letterCasePermutation("3z4"),
+            equalTo(listOf("3z4", "3Z4")),
         )
     }
 
diff --git a/src/test/kotlin/g0701_0800/s0785_is_graph_bipartite/SolutionTest.kt b/src/test/kotlin/g0701_0800/s0785_is_graph_bipartite/SolutionTest.kt
index 9a89faaee..1485b77a3 100644
--- a/src/test/kotlin/g0701_0800/s0785_is_graph_bipartite/SolutionTest.kt
+++ b/src/test/kotlin/g0701_0800/s0785_is_graph_bipartite/SolutionTest.kt
@@ -13,10 +13,10 @@ internal class SolutionTest {
                     intArrayOf(1, 2, 3),
                     intArrayOf(0, 2),
                     intArrayOf(0, 1, 3),
-                    intArrayOf(0, 2)
-                )
+                    intArrayOf(0, 2),
+                ),
             ),
-            equalTo(false)
+            equalTo(false),
         )
     }
 
@@ -24,7 +24,7 @@ internal class SolutionTest {
     fun isBipartite2() {
         assertThat(
             Solution().isBipartite(arrayOf(intArrayOf(1, 3), intArrayOf(0, 2), intArrayOf(1, 3), intArrayOf(0, 2))),
-            equalTo(true)
+            equalTo(true),
         )
     }
 }
diff --git a/src/test/kotlin/g0701_0800/s0786_k_th_smallest_prime_fraction/SolutionTest.kt b/src/test/kotlin/g0701_0800/s0786_k_th_smallest_prime_fraction/SolutionTest.kt
index 2b549dbf3..852d90123 100644
--- a/src/test/kotlin/g0701_0800/s0786_k_th_smallest_prime_fraction/SolutionTest.kt
+++ b/src/test/kotlin/g0701_0800/s0786_k_th_smallest_prime_fraction/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun kthSmallestPrimeFraction() {
         assertThat(
             Solution().kthSmallestPrimeFraction(intArrayOf(1, 2, 3, 5), 3),
-            equalTo(intArrayOf(2, 5))
+            equalTo(intArrayOf(2, 5)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun kthSmallestPrimeFraction2() {
         assertThat(
             Solution().kthSmallestPrimeFraction(intArrayOf(1, 7), 1),
-            equalTo(intArrayOf(1, 7))
+            equalTo(intArrayOf(1, 7)),
         )
     }
 }
diff --git a/src/test/kotlin/g0701_0800/s0787_cheapest_flights_within_k_stops/SolutionTest.kt b/src/test/kotlin/g0701_0800/s0787_cheapest_flights_within_k_stops/SolutionTest.kt
index 68adfdb95..b455d5a53 100644
--- a/src/test/kotlin/g0701_0800/s0787_cheapest_flights_within_k_stops/SolutionTest.kt
+++ b/src/test/kotlin/g0701_0800/s0787_cheapest_flights_within_k_stops/SolutionTest.kt
@@ -10,9 +10,13 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .findCheapestPrice(
-                    3, arrayOf(intArrayOf(0, 1, 100), intArrayOf(1, 2, 100), intArrayOf(0, 2, 500)), 0, 2, 1
+                    3,
+                    arrayOf(intArrayOf(0, 1, 100), intArrayOf(1, 2, 100), intArrayOf(0, 2, 500)),
+                    0,
+                    2,
+                    1,
                 ),
-            equalTo(200)
+            equalTo(200),
         )
     }
 
@@ -21,9 +25,13 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .findCheapestPrice(
-                    3, arrayOf(intArrayOf(0, 1, 100), intArrayOf(1, 2, 100), intArrayOf(0, 2, 500)), 0, 2, 0
+                    3,
+                    arrayOf(intArrayOf(0, 1, 100), intArrayOf(1, 2, 100), intArrayOf(0, 2, 500)),
+                    0,
+                    2,
+                    0,
                 ),
-            equalTo(500)
+            equalTo(500),
         )
     }
 }
diff --git a/src/test/kotlin/g0701_0800/s0789_escape_the_ghosts/SolutionTest.kt b/src/test/kotlin/g0701_0800/s0789_escape_the_ghosts/SolutionTest.kt
index c7309216c..098f936f0 100644
--- a/src/test/kotlin/g0701_0800/s0789_escape_the_ghosts/SolutionTest.kt
+++ b/src/test/kotlin/g0701_0800/s0789_escape_the_ghosts/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun escapeGhosts() {
         assertThat(
             Solution().escapeGhosts(arrayOf(intArrayOf(1, 0), intArrayOf(0, 3)), intArrayOf(0, 1)),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun escapeGhosts2() {
         assertThat(
             Solution().escapeGhosts(arrayOf(intArrayOf(1, 0)), intArrayOf(2, 0)),
-            equalTo(false)
+            equalTo(false),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun escapeGhosts3() {
         assertThat(
             Solution().escapeGhosts(arrayOf(intArrayOf(2, 0)), intArrayOf(1, 0)),
-            equalTo(false)
+            equalTo(false),
         )
     }
 }
diff --git a/src/test/kotlin/g0701_0800/s0792_number_of_matching_subsequences/SolutionTest.kt b/src/test/kotlin/g0701_0800/s0792_number_of_matching_subsequences/SolutionTest.kt
index 5a54c90e1..b9fb795cb 100644
--- a/src/test/kotlin/g0701_0800/s0792_number_of_matching_subsequences/SolutionTest.kt
+++ b/src/test/kotlin/g0701_0800/s0792_number_of_matching_subsequences/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun numMatchingSubseq() {
         assertThat(
             Solution().numMatchingSubseq("abcde", arrayOf("a", "bb", "acd", "ace")),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
@@ -18,9 +18,10 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .numMatchingSubseq(
-                    "dsahjpjauf", arrayOf("ahjpjau", "ja", "ahbwzgqnuk", "tnmlanowax")
+                    "dsahjpjauf",
+                    arrayOf("ahjpjau", "ja", "ahbwzgqnuk", "tnmlanowax"),
                 ),
-            equalTo(2)
+            equalTo(2),
         )
     }
 }
diff --git a/src/test/kotlin/g0701_0800/s0794_valid_tic_tac_toe_state/SolutionTest.kt b/src/test/kotlin/g0701_0800/s0794_valid_tic_tac_toe_state/SolutionTest.kt
index 754273dbb..592dee170 100644
--- a/src/test/kotlin/g0701_0800/s0794_valid_tic_tac_toe_state/SolutionTest.kt
+++ b/src/test/kotlin/g0701_0800/s0794_valid_tic_tac_toe_state/SolutionTest.kt
@@ -8,21 +8,24 @@ internal class SolutionTest {
     @Test
     fun validTicTacToe() {
         assertThat(
-            Solution().validTicTacToe(arrayOf("O  ", "   ", "   ")), equalTo(false)
+            Solution().validTicTacToe(arrayOf("O  ", "   ", "   ")),
+            equalTo(false),
         )
     }
 
     @Test
     fun validTicTacToe2() {
         assertThat(
-            Solution().validTicTacToe(arrayOf("XOX", " X ", "   ")), equalTo(false)
+            Solution().validTicTacToe(arrayOf("XOX", " X ", "   ")),
+            equalTo(false),
         )
     }
 
     @Test
     fun validTicTacToe3() {
         assertThat(
-            Solution().validTicTacToe(arrayOf("XOX", "O O", "XOX")), equalTo(true)
+            Solution().validTicTacToe(arrayOf("XOX", "O O", "XOX")),
+            equalTo(true),
         )
     }
 }
diff --git a/src/test/kotlin/g0701_0800/s0795_number_of_subarrays_with_bounded_maximum/SolutionTest.kt b/src/test/kotlin/g0701_0800/s0795_number_of_subarrays_with_bounded_maximum/SolutionTest.kt
index 2c1c20a49..7bc5b5bef 100644
--- a/src/test/kotlin/g0701_0800/s0795_number_of_subarrays_with_bounded_maximum/SolutionTest.kt
+++ b/src/test/kotlin/g0701_0800/s0795_number_of_subarrays_with_bounded_maximum/SolutionTest.kt
@@ -13,7 +13,8 @@ internal class SolutionTest {
     @Test
     fun numSubarrayBoundedMax2() {
         assertThat(
-            Solution().numSubarrayBoundedMax(intArrayOf(2, 9, 2, 5, 6), 2, 8), equalTo(7)
+            Solution().numSubarrayBoundedMax(intArrayOf(2, 9, 2, 5, 6), 2, 8),
+            equalTo(7),
         )
     }
 }
diff --git a/src/test/kotlin/g0701_0800/s0797_all_paths_from_source_to_target/SolutionTest.kt b/src/test/kotlin/g0701_0800/s0797_all_paths_from_source_to_target/SolutionTest.kt
index c04b99a63..2d94f5004 100644
--- a/src/test/kotlin/g0701_0800/s0797_all_paths_from_source_to_target/SolutionTest.kt
+++ b/src/test/kotlin/g0701_0800/s0797_all_paths_from_source_to_target/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
     fun allPathsSourceTarget() {
         assertThat(
             Solution().allPathsSourceTarget(arrayOf(intArrayOf(1, 2), intArrayOf(3), intArrayOf(3), intArrayOf())),
-            equalTo(ArrayUtils.getLists(arrayOf(intArrayOf(0, 1, 3), intArrayOf(0, 2, 3))))
+            equalTo(ArrayUtils.getLists(arrayOf(intArrayOf(0, 1, 3), intArrayOf(0, 2, 3)))),
         )
     }
 
@@ -24,8 +24,8 @@ internal class SolutionTest {
                         intArrayOf(3, 2, 4),
                         intArrayOf(3),
                         intArrayOf(4),
-                        intArrayOf()
-                    )
+                        intArrayOf(),
+                    ),
                 ),
             equalTo(
                 ArrayUtils.getLists(
@@ -34,10 +34,10 @@ internal class SolutionTest {
                         intArrayOf(0, 3, 4),
                         intArrayOf(0, 1, 3, 4),
                         intArrayOf(0, 1, 2, 3, 4),
-                        intArrayOf(0, 1, 4)
-                    )
-                )
-            )
+                        intArrayOf(0, 1, 4),
+                    ),
+                ),
+            ),
         )
     }
 }
diff --git a/src/test/kotlin/g0801_0900/s0801_minimum_swaps_to_make_sequences_increasing/SolutionTest.kt b/src/test/kotlin/g0801_0900/s0801_minimum_swaps_to_make_sequences_increasing/SolutionTest.kt
index 54fe207f7..3e6bbf283 100644
--- a/src/test/kotlin/g0801_0900/s0801_minimum_swaps_to_make_sequences_increasing/SolutionTest.kt
+++ b/src/test/kotlin/g0801_0900/s0801_minimum_swaps_to_make_sequences_increasing/SolutionTest.kt
@@ -8,7 +8,8 @@ internal class SolutionTest {
     @Test
     fun minSwap() {
         assertThat(
-            Solution().minSwap(intArrayOf(1, 3, 5, 4), intArrayOf(1, 2, 3, 7)), equalTo(1)
+            Solution().minSwap(intArrayOf(1, 3, 5, 4), intArrayOf(1, 2, 3, 7)),
+            equalTo(1),
         )
     }
 
@@ -16,7 +17,7 @@ internal class SolutionTest {
     fun minSwap2() {
         assertThat(
             Solution().minSwap(intArrayOf(0, 3, 5, 8, 9), intArrayOf(2, 1, 4, 6, 9)),
-            equalTo(1)
+            equalTo(1),
         )
     }
 }
diff --git a/src/test/kotlin/g0801_0900/s0802_find_eventual_safe_states/SolutionTest.kt b/src/test/kotlin/g0801_0900/s0802_find_eventual_safe_states/SolutionTest.kt
index 296c3ccfa..9862b54eb 100644
--- a/src/test/kotlin/g0801_0900/s0802_find_eventual_safe_states/SolutionTest.kt
+++ b/src/test/kotlin/g0801_0900/s0802_find_eventual_safe_states/SolutionTest.kt
@@ -17,10 +17,10 @@ internal class SolutionTest {
                         intArrayOf(0),
                         intArrayOf(5),
                         intArrayOf(),
-                        intArrayOf()
-                    )
+                        intArrayOf(),
+                    ),
                 ),
-            equalTo(listOf(2, 4, 5, 6))
+            equalTo(listOf(2, 4, 5, 6)),
         )
     }
 
@@ -34,10 +34,10 @@ internal class SolutionTest {
                         intArrayOf(1, 2),
                         intArrayOf(3, 4),
                         intArrayOf(0, 4),
-                        intArrayOf()
-                    )
+                        intArrayOf(),
+                    ),
                 ),
-            equalTo(listOf(4))
+            equalTo(listOf(4)),
         )
     }
 }
diff --git a/src/test/kotlin/g0801_0900/s0803_bricks_falling_when_hit/SolutionTest.kt b/src/test/kotlin/g0801_0900/s0803_bricks_falling_when_hit/SolutionTest.kt
index cc2451787..c30a53be4 100644
--- a/src/test/kotlin/g0801_0900/s0803_bricks_falling_when_hit/SolutionTest.kt
+++ b/src/test/kotlin/g0801_0900/s0803_bricks_falling_when_hit/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .hitBricks(arrayOf(intArrayOf(1, 0, 0, 0), intArrayOf(1, 1, 1, 0)), arrayOf(intArrayOf(1, 0))),
-            equalTo(intArrayOf(2))
+            equalTo(intArrayOf(2)),
         )
     }
 
@@ -20,9 +20,9 @@ internal class SolutionTest {
             Solution()
                 .hitBricks(
                     arrayOf(intArrayOf(1, 0, 0, 0), intArrayOf(1, 1, 0, 0)),
-                    arrayOf(intArrayOf(1, 1), intArrayOf(1, 0))
+                    arrayOf(intArrayOf(1, 1), intArrayOf(1, 0)),
                 ),
-            equalTo(intArrayOf(0, 0))
+            equalTo(intArrayOf(0, 0)),
         )
     }
 }
diff --git a/src/test/kotlin/g0801_0900/s0804_unique_morse_code_words/SolutionTest.kt b/src/test/kotlin/g0801_0900/s0804_unique_morse_code_words/SolutionTest.kt
index 7f99d89fc..53eee9cde 100644
--- a/src/test/kotlin/g0801_0900/s0804_unique_morse_code_words/SolutionTest.kt
+++ b/src/test/kotlin/g0801_0900/s0804_unique_morse_code_words/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .uniqueMorseRepresentations(arrayOf("gin", "zen", "gig", "msg")),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
diff --git a/src/test/kotlin/g0801_0900/s0805_split_array_with_same_average/SolutionTest.kt b/src/test/kotlin/g0801_0900/s0805_split_array_with_same_average/SolutionTest.kt
index bf4247817..b6eb97535 100644
--- a/src/test/kotlin/g0801_0900/s0805_split_array_with_same_average/SolutionTest.kt
+++ b/src/test/kotlin/g0801_0900/s0805_split_array_with_same_average/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun splitArraySameAverage() {
         assertThat(
             Solution().splitArraySameAverage(intArrayOf(1, 2, 3, 4, 5, 6, 7, 8)),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
diff --git a/src/test/kotlin/g0801_0900/s0806_number_of_lines_to_write_string/SolutionTest.kt b/src/test/kotlin/g0801_0900/s0806_number_of_lines_to_write_string/SolutionTest.kt
index 236b5c63a..b68b315b0 100644
--- a/src/test/kotlin/g0801_0900/s0806_number_of_lines_to_write_string/SolutionTest.kt
+++ b/src/test/kotlin/g0801_0900/s0806_number_of_lines_to_write_string/SolutionTest.kt
@@ -12,11 +12,11 @@ internal class SolutionTest {
                 .numberOfLines(
                     intArrayOf(
                         10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10,
-                        10, 10, 10, 10, 10, 10, 10, 10, 10, 10
+                        10, 10, 10, 10, 10, 10, 10, 10, 10, 10,
                     ),
-                    "abcdefghijklmnopqrstuvwxyz"
+                    "abcdefghijklmnopqrstuvwxyz",
                 ),
-            equalTo(intArrayOf(3, 60))
+            equalTo(intArrayOf(3, 60)),
         )
     }
 
@@ -27,11 +27,11 @@ internal class SolutionTest {
                 .numberOfLines(
                     intArrayOf(
                         4, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10,
-                        10, 10, 10, 10, 10, 10, 10, 10, 10, 10
+                        10, 10, 10, 10, 10, 10, 10, 10, 10, 10,
                     ),
-                    "bbbcccdddaaa"
+                    "bbbcccdddaaa",
                 ),
-            equalTo(intArrayOf(2, 4))
+            equalTo(intArrayOf(2, 4)),
         )
     }
 }
diff --git a/src/test/kotlin/g0801_0900/s0807_max_increase_to_keep_city_skyline/SolutionTest.kt b/src/test/kotlin/g0801_0900/s0807_max_increase_to_keep_city_skyline/SolutionTest.kt
index 60adea496..3a8331b3b 100644
--- a/src/test/kotlin/g0801_0900/s0807_max_increase_to_keep_city_skyline/SolutionTest.kt
+++ b/src/test/kotlin/g0801_0900/s0807_max_increase_to_keep_city_skyline/SolutionTest.kt
@@ -14,10 +14,10 @@ internal class SolutionTest {
                         intArrayOf(3, 0, 8, 4),
                         intArrayOf(2, 4, 5, 7),
                         intArrayOf(9, 2, 6, 3),
-                        intArrayOf(0, 3, 1, 0)
-                    )
+                        intArrayOf(0, 3, 1, 0),
+                    ),
                 ),
-            equalTo(35)
+            equalTo(35),
         )
     }
 
@@ -26,7 +26,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .maxIncreaseKeepingSkyline(arrayOf(intArrayOf(0, 0, 0), intArrayOf(0, 0, 0), intArrayOf(0, 0, 0))),
-            equalTo(0)
+            equalTo(0),
         )
     }
 }
diff --git a/src/test/kotlin/g0801_0900/s0809_expressive_words/SolutionTest.kt b/src/test/kotlin/g0801_0900/s0809_expressive_words/SolutionTest.kt
index 9064334f1..87d128d18 100644
--- a/src/test/kotlin/g0801_0900/s0809_expressive_words/SolutionTest.kt
+++ b/src/test/kotlin/g0801_0900/s0809_expressive_words/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun expressiveWords() {
         assertThat(
             Solution().expressiveWords("heeellooo", arrayOf("hello", "hi", "helo")),
-            equalTo(1)
+            equalTo(1),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun expressiveWords2() {
         assertThat(
             Solution().expressiveWords("zzzzzyyyyy", arrayOf("zzyy", "zy", "zyy")),
-            equalTo(3)
+            equalTo(3),
         )
     }
 }
diff --git a/src/test/kotlin/g0801_0900/s0811_subdomain_visit_count/SolutionTest.kt b/src/test/kotlin/g0801_0900/s0811_subdomain_visit_count/SolutionTest.kt
index 9a3dfd46d..21c1ecd37 100644
--- a/src/test/kotlin/g0801_0900/s0811_subdomain_visit_count/SolutionTest.kt
+++ b/src/test/kotlin/g0801_0900/s0811_subdomain_visit_count/SolutionTest.kt
@@ -11,9 +11,11 @@ internal class SolutionTest {
             Solution().subdomainVisits(arrayOf("9001 discuss.leetcode.com")),
             equalTo(
                 listOf(
-                    "9001 com", "9001 leetcode.com", "9001 discuss.leetcode.com"
-                )
-            )
+                    "9001 com",
+                    "9001 leetcode.com",
+                    "9001 discuss.leetcode.com",
+                ),
+            ),
         )
     }
 
@@ -26,8 +28,8 @@ internal class SolutionTest {
                         "900 google.mail.com",
                         "50 yahoo.com",
                         "1 intel.mail.com",
-                        "5 wiki.org"
-                    )
+                        "5 wiki.org",
+                    ),
                 ),
             equalTo(
                 listOf(
@@ -37,9 +39,9 @@ internal class SolutionTest {
                     "5 org",
                     "5 wiki.org",
                     "901 mail.com",
-                    "50 yahoo.com"
-                )
-            )
+                    "50 yahoo.com",
+                ),
+            ),
         )
     }
 }
diff --git a/src/test/kotlin/g0801_0900/s0812_largest_triangle_area/SolutionTest.kt b/src/test/kotlin/g0801_0900/s0812_largest_triangle_area/SolutionTest.kt
index e1ebeab3a..eb7329840 100644
--- a/src/test/kotlin/g0801_0900/s0812_largest_triangle_area/SolutionTest.kt
+++ b/src/test/kotlin/g0801_0900/s0812_largest_triangle_area/SolutionTest.kt
@@ -15,10 +15,10 @@ internal class SolutionTest {
                         intArrayOf(0, 1),
                         intArrayOf(1, 0),
                         intArrayOf(0, 2),
-                        intArrayOf(2, 0)
-                    )
+                        intArrayOf(2, 0),
+                    ),
                 ),
-            equalTo(2.0)
+            equalTo(2.0),
         )
     }
 
@@ -26,7 +26,7 @@ internal class SolutionTest {
     fun largestTriangleArea2() {
         assertThat(
             Solution().largestTriangleArea(arrayOf(intArrayOf(1, 0), intArrayOf(0, 0), intArrayOf(0, 1))),
-            equalTo(0.5)
+            equalTo(0.5),
         )
     }
 }
diff --git a/src/test/kotlin/g0801_0900/s0813_largest_sum_of_averages/SolutionTest.kt b/src/test/kotlin/g0801_0900/s0813_largest_sum_of_averages/SolutionTest.kt
index 4cd8fb0d3..1544e8940 100644
--- a/src/test/kotlin/g0801_0900/s0813_largest_sum_of_averages/SolutionTest.kt
+++ b/src/test/kotlin/g0801_0900/s0813_largest_sum_of_averages/SolutionTest.kt
@@ -8,7 +8,8 @@ internal class SolutionTest {
     @Test
     fun largestSumOfAverages() {
         assertThat(
-            Solution().largestSumOfAverages(intArrayOf(9, 1, 2, 3, 9), 3), equalTo(20.0)
+            Solution().largestSumOfAverages(intArrayOf(9, 1, 2, 3, 9), 3),
+            equalTo(20.0),
         )
     }
 
@@ -16,7 +17,7 @@ internal class SolutionTest {
     fun largestSumOfAverages2() {
         assertThat(
             Solution().largestSumOfAverages(intArrayOf(1, 2, 3, 4, 5, 6, 7), 4),
-            equalTo(20.5)
+            equalTo(20.5),
         )
     }
 }
diff --git a/src/test/kotlin/g0801_0900/s0815_bus_routes/SolutionTest.kt b/src/test/kotlin/g0801_0900/s0815_bus_routes/SolutionTest.kt
index 2abe2d722..91300e204 100644
--- a/src/test/kotlin/g0801_0900/s0815_bus_routes/SolutionTest.kt
+++ b/src/test/kotlin/g0801_0900/s0815_bus_routes/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun numBusesToDestination() {
         assertThat(
             Solution().numBusesToDestination(arrayOf(intArrayOf(1, 2, 7), intArrayOf(3, 6, 7)), 1, 6),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -23,12 +23,12 @@ internal class SolutionTest {
                         intArrayOf(4, 5, 15),
                         intArrayOf(6),
                         intArrayOf(15, 19),
-                        intArrayOf(9, 12, 13)
+                        intArrayOf(9, 12, 13),
                     ),
                     15,
-                    12
+                    12,
                 ),
-            equalTo(-1)
+            equalTo(-1),
         )
     }
 }
diff --git a/src/test/kotlin/g0801_0900/s0816_ambiguous_coordinates/SolutionTest.kt b/src/test/kotlin/g0801_0900/s0816_ambiguous_coordinates/SolutionTest.kt
index 73dbe024b..530ba5d20 100644
--- a/src/test/kotlin/g0801_0900/s0816_ambiguous_coordinates/SolutionTest.kt
+++ b/src/test/kotlin/g0801_0900/s0816_ambiguous_coordinates/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun ambiguousCoordinates() {
         assertThat(
             Solution().ambiguousCoordinates("(123)"),
-            equalTo(listOf("(1, 23)", "(1, 2.3)", "(12, 3)", "(1.2, 3)"))
+            equalTo(listOf("(1, 23)", "(1, 2.3)", "(12, 3)", "(1.2, 3)")),
         )
     }
 
@@ -24,9 +24,9 @@ internal class SolutionTest {
                     "(0, 12.3)",
                     "(0.1, 23)",
                     "(0.1, 2.3)",
-                    "(0.12, 3)"
-                )
-            )
+                    "(0.12, 3)",
+                ),
+            ),
         )
     }
 
@@ -34,7 +34,7 @@ internal class SolutionTest {
     fun ambiguousCoordinates3() {
         assertThat(
             Solution().ambiguousCoordinates("(00011)"),
-            equalTo(listOf("(0, 0.011)", "(0.001, 1)"))
+            equalTo(listOf("(0, 0.011)", "(0.001, 1)")),
         )
     }
 }
diff --git a/src/test/kotlin/g0801_0900/s0819_most_common_word/SolutionTest.kt b/src/test/kotlin/g0801_0900/s0819_most_common_word/SolutionTest.kt
index 218f8956d..d5a6d06d6 100644
--- a/src/test/kotlin/g0801_0900/s0819_most_common_word/SolutionTest.kt
+++ b/src/test/kotlin/g0801_0900/s0819_most_common_word/SolutionTest.kt
@@ -10,9 +10,10 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .mostCommonWord(
-                    "Bob hit a ball, the hit BALL flew far after it was hit.", arrayOf("hit")
+                    "Bob hit a ball, the hit BALL flew far after it was hit.",
+                    arrayOf("hit"),
                 ),
-            equalTo("ball")
+            equalTo("ball"),
         )
     }
 
diff --git a/src/test/kotlin/g0801_0900/s0820_short_encoding_of_words/SolutionTest.kt b/src/test/kotlin/g0801_0900/s0820_short_encoding_of_words/SolutionTest.kt
index 2fdb7e07d..6b140eb6c 100644
--- a/src/test/kotlin/g0801_0900/s0820_short_encoding_of_words/SolutionTest.kt
+++ b/src/test/kotlin/g0801_0900/s0820_short_encoding_of_words/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun minimumLengthEncoding() {
         assertThat(
             Solution().minimumLengthEncoding(arrayOf("time", "me", "bell")),
-            equalTo(10)
+            equalTo(10),
         )
     }
 
diff --git a/src/test/kotlin/g0801_0900/s0821_shortest_distance_to_a_character/SolutionTest.kt b/src/test/kotlin/g0801_0900/s0821_shortest_distance_to_a_character/SolutionTest.kt
index 0b66868ea..6b7d5c671 100644
--- a/src/test/kotlin/g0801_0900/s0821_shortest_distance_to_a_character/SolutionTest.kt
+++ b/src/test/kotlin/g0801_0900/s0821_shortest_distance_to_a_character/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun shortestToChar() {
         assertThat(
             Solution().shortestToChar("loveleetcode", 'e'),
-            equalTo(intArrayOf(3, 2, 1, 0, 1, 0, 0, 1, 2, 2, 1, 0))
+            equalTo(intArrayOf(3, 2, 1, 0, 1, 0, 0, 1, 2, 2, 1, 0)),
         )
     }
 
diff --git a/src/test/kotlin/g0801_0900/s0822_card_flipping_game/SolutionTest.kt b/src/test/kotlin/g0801_0900/s0822_card_flipping_game/SolutionTest.kt
index a170f8b7b..270e4d127 100644
--- a/src/test/kotlin/g0801_0900/s0822_card_flipping_game/SolutionTest.kt
+++ b/src/test/kotlin/g0801_0900/s0822_card_flipping_game/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun flipame() {
         assertThat(
             Solution().flipgame(intArrayOf(1, 2, 4, 4, 7), intArrayOf(1, 3, 4, 1, 3)),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
diff --git a/src/test/kotlin/g0801_0900/s0824_goat_latin/SolutionTest.kt b/src/test/kotlin/g0801_0900/s0824_goat_latin/SolutionTest.kt
index 642130183..5b4927b65 100644
--- a/src/test/kotlin/g0801_0900/s0824_goat_latin/SolutionTest.kt
+++ b/src/test/kotlin/g0801_0900/s0824_goat_latin/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun toGoatLatin() {
         assertThat(
             Solution().toGoatLatin("I speak Goat Latin"),
-            equalTo("Imaa peaksmaaa oatGmaaaa atinLmaaaaa")
+            equalTo("Imaa peaksmaaa oatGmaaaa atinLmaaaaa"),
         )
     }
 
@@ -19,8 +19,8 @@ internal class SolutionTest {
             Solution().toGoatLatin("The quick brown fox jumped over the lazy dog"),
             equalTo(
                 "heTmaa uickqmaaa rownbmaaaa oxfmaaaaa umpedjmaaaaaa " +
-                    "overmaaaaaaa hetmaaaaaaaa azylmaaaaaaaaa ogdmaaaaaaaaaa"
-            )
+                    "overmaaaaaaa hetmaaaaaaaa azylmaaaaaaaaa ogdmaaaaaaaaaa",
+            ),
         )
     }
 }
diff --git a/src/test/kotlin/g0801_0900/s0826_most_profit_assigning_work/SolutionTest.kt b/src/test/kotlin/g0801_0900/s0826_most_profit_assigning_work/SolutionTest.kt
index ebe94d463..6713defa2 100644
--- a/src/test/kotlin/g0801_0900/s0826_most_profit_assigning_work/SolutionTest.kt
+++ b/src/test/kotlin/g0801_0900/s0826_most_profit_assigning_work/SolutionTest.kt
@@ -12,9 +12,9 @@ internal class SolutionTest {
                 .maxProfitAssignment(
                     intArrayOf(2, 4, 6, 8, 10),
                     intArrayOf(10, 20, 30, 40, 50),
-                    intArrayOf(4, 5, 6, 7)
+                    intArrayOf(4, 5, 6, 7),
                 ),
-            equalTo(100)
+            equalTo(100),
         )
     }
 
@@ -23,7 +23,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .maxProfitAssignment(intArrayOf(85, 47, 57), intArrayOf(24, 66, 99), intArrayOf(40, 25, 25)),
-            equalTo(0)
+            equalTo(0),
         )
     }
 }
diff --git a/src/test/kotlin/g0801_0900/s0830_positions_of_large_groups/SolutionTest.kt b/src/test/kotlin/g0801_0900/s0830_positions_of_large_groups/SolutionTest.kt
index 82a396a5d..28709570a 100644
--- a/src/test/kotlin/g0801_0900/s0830_positions_of_large_groups/SolutionTest.kt
+++ b/src/test/kotlin/g0801_0900/s0830_positions_of_large_groups/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun largeGroupPositions() {
         assertThat(
             Solution().largeGroupPositions("abbxxxxzzy"),
-            equalTo(listOf(listOf(3, 6)))
+            equalTo(listOf(listOf(3, 6))),
         )
     }
 
@@ -24,9 +24,11 @@ internal class SolutionTest {
             Solution().largeGroupPositions("abcdddeeeeaabbbcd"),
             equalTo(
                 listOf(
-                    listOf(3, 5), listOf(6, 9), listOf(12, 14)
-                )
-            )
+                    listOf(3, 5),
+                    listOf(6, 9),
+                    listOf(12, 14),
+                ),
+            ),
         )
     }
 }
diff --git a/src/test/kotlin/g0801_0900/s0831_masking_personal_information/SolutionTest.kt b/src/test/kotlin/g0801_0900/s0831_masking_personal_information/SolutionTest.kt
index f4e74deb8..1ad7fbd4d 100644
--- a/src/test/kotlin/g0801_0900/s0831_masking_personal_information/SolutionTest.kt
+++ b/src/test/kotlin/g0801_0900/s0831_masking_personal_information/SolutionTest.kt
@@ -8,7 +8,8 @@ internal class SolutionTest {
     @Test
     fun maskPII() {
         assertThat(
-            Solution().maskPII("LeetCode@LeetCode.com"), equalTo("l*****e@leetcode.com")
+            Solution().maskPII("LeetCode@LeetCode.com"),
+            equalTo("l*****e@leetcode.com"),
         )
     }
 
diff --git a/src/test/kotlin/g0801_0900/s0832_flipping_an_image/SolutionTest.kt b/src/test/kotlin/g0801_0900/s0832_flipping_an_image/SolutionTest.kt
index 62fd10ba7..2801d7138 100644
--- a/src/test/kotlin/g0801_0900/s0832_flipping_an_image/SolutionTest.kt
+++ b/src/test/kotlin/g0801_0900/s0832_flipping_an_image/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun flipAndInvertImage() {
         assertThat(
             Solution().flipAndInvertImage(arrayOf(intArrayOf(1, 1, 0), intArrayOf(1, 0, 1), intArrayOf(0, 0, 0))),
-            equalTo(arrayOf(intArrayOf(1, 0, 0), intArrayOf(0, 1, 0), intArrayOf(1, 1, 1)))
+            equalTo(arrayOf(intArrayOf(1, 0, 0), intArrayOf(0, 1, 0), intArrayOf(1, 1, 1))),
         )
     }
 
@@ -22,17 +22,17 @@ internal class SolutionTest {
                         intArrayOf(1, 1, 0, 0),
                         intArrayOf(1, 0, 0, 1),
                         intArrayOf(0, 1, 1, 1),
-                        intArrayOf(1, 0, 1, 0)
-                    )
+                        intArrayOf(1, 0, 1, 0),
+                    ),
                 ),
             equalTo(
                 arrayOf(
                     intArrayOf(1, 1, 0, 0),
                     intArrayOf(0, 1, 1, 0),
                     intArrayOf(0, 0, 0, 1),
-                    intArrayOf(1, 0, 1, 0)
-                )
-            )
+                    intArrayOf(1, 0, 1, 0),
+                ),
+            ),
         )
     }
 }
diff --git a/src/test/kotlin/g0801_0900/s0833_find_and_replace_in_string/SolutionTest.kt b/src/test/kotlin/g0801_0900/s0833_find_and_replace_in_string/SolutionTest.kt
index 66f2f06f8..3c3c65d55 100644
--- a/src/test/kotlin/g0801_0900/s0833_find_and_replace_in_string/SolutionTest.kt
+++ b/src/test/kotlin/g0801_0900/s0833_find_and_replace_in_string/SolutionTest.kt
@@ -10,9 +10,12 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .findReplaceString(
-                    "abcd", intArrayOf(0, 2), arrayOf("a", "cd"), arrayOf("eee", "ffff")
+                    "abcd",
+                    intArrayOf(0, 2),
+                    arrayOf("a", "cd"),
+                    arrayOf("eee", "ffff"),
                 ),
-            equalTo("eeebffff")
+            equalTo("eeebffff"),
         )
     }
 
@@ -21,9 +24,12 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .findReplaceString(
-                    "abcd", intArrayOf(0, 2), arrayOf("ab", "ec"), arrayOf("eee", "ffff")
+                    "abcd",
+                    intArrayOf(0, 2),
+                    arrayOf("ab", "ec"),
+                    arrayOf("eee", "ffff"),
                 ),
-            equalTo("eeecd")
+            equalTo("eeecd"),
         )
     }
 }
diff --git a/src/test/kotlin/g0801_0900/s0834_sum_of_distances_in_tree/SolutionTest.kt b/src/test/kotlin/g0801_0900/s0834_sum_of_distances_in_tree/SolutionTest.kt
index 6d5ad7ee9..e8be779d3 100644
--- a/src/test/kotlin/g0801_0900/s0834_sum_of_distances_in_tree/SolutionTest.kt
+++ b/src/test/kotlin/g0801_0900/s0834_sum_of_distances_in_tree/SolutionTest.kt
@@ -10,9 +10,10 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .sumOfDistancesInTree(
-                    6, arrayOf(intArrayOf(0, 1), intArrayOf(0, 2), intArrayOf(2, 3), intArrayOf(2, 4), intArrayOf(2, 5))
+                    6,
+                    arrayOf(intArrayOf(0, 1), intArrayOf(0, 2), intArrayOf(2, 3), intArrayOf(2, 4), intArrayOf(2, 5)),
                 ),
-            equalTo(intArrayOf(8, 12, 6, 10, 10, 10))
+            equalTo(intArrayOf(8, 12, 6, 10, 10, 10)),
         )
     }
 
@@ -25,7 +26,7 @@ internal class SolutionTest {
     fun sumOfDistancesInTree3() {
         assertThat(
             Solution().sumOfDistancesInTree(2, arrayOf(intArrayOf(1, 0))),
-            equalTo(intArrayOf(1, 1))
+            equalTo(intArrayOf(1, 1)),
         )
     }
 }
diff --git a/src/test/kotlin/g0801_0900/s0835_image_overlap/SolutionTest.kt b/src/test/kotlin/g0801_0900/s0835_image_overlap/SolutionTest.kt
index a3ed101ad..f5ceedf54 100644
--- a/src/test/kotlin/g0801_0900/s0835_image_overlap/SolutionTest.kt
+++ b/src/test/kotlin/g0801_0900/s0835_image_overlap/SolutionTest.kt
@@ -11,9 +11,9 @@ internal class SolutionTest {
             Solution()
                 .largestOverlap(
                     arrayOf(intArrayOf(1, 1, 0), intArrayOf(0, 1, 0), intArrayOf(0, 1, 0)),
-                    arrayOf(intArrayOf(0, 0, 0), intArrayOf(0, 1, 1), intArrayOf(0, 0, 1))
+                    arrayOf(intArrayOf(0, 0, 0), intArrayOf(0, 1, 1), intArrayOf(0, 0, 1)),
                 ),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
diff --git a/src/test/kotlin/g0801_0900/s0836_rectangle_overlap/SolutionTest.kt b/src/test/kotlin/g0801_0900/s0836_rectangle_overlap/SolutionTest.kt
index b7f0d648e..4201bee24 100644
--- a/src/test/kotlin/g0801_0900/s0836_rectangle_overlap/SolutionTest.kt
+++ b/src/test/kotlin/g0801_0900/s0836_rectangle_overlap/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun isRectangleOverlap() {
         assertThat(
             Solution().isRectangleOverlap(intArrayOf(0, 0, 2, 2), intArrayOf(1, 1, 3, 3)),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun isRectangleOverlap2() {
         assertThat(
             Solution().isRectangleOverlap(intArrayOf(0, 0, 1, 1), intArrayOf(1, 0, 2, 1)),
-            equalTo(false)
+            equalTo(false),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun isRectangleOverlap3() {
         assertThat(
             Solution().isRectangleOverlap(intArrayOf(0, 0, 1, 1), intArrayOf(2, 2, 3, 3)),
-            equalTo(false)
+            equalTo(false),
         )
     }
 }
diff --git a/src/test/kotlin/g0801_0900/s0837_new_21_game/SolutionTest.kt b/src/test/kotlin/g0801_0900/s0837_new_21_game/SolutionTest.kt
index 097b51edf..87f369233 100644
--- a/src/test/kotlin/g0801_0900/s0837_new_21_game/SolutionTest.kt
+++ b/src/test/kotlin/g0801_0900/s0837_new_21_game/SolutionTest.kt
@@ -11,7 +11,8 @@ internal class SolutionTest {
     @Test
     fun new21Game() {
         assertThat(
-            (Solution().new21Game(10, 1, 10) * n).roundToInt().toDouble() / n, equalTo(1.00000)
+            (Solution().new21Game(10, 1, 10) * n).roundToInt().toDouble() / n,
+            equalTo(1.00000),
         )
     }
 
@@ -24,7 +25,7 @@ internal class SolutionTest {
     fun new21Game3() {
         assertThat(
             (Solution().new21Game(21, 17, 10) * n).roundToInt().toDouble() / n,
-            equalTo(0.73278)
+            equalTo(0.73278),
         )
     }
 }
diff --git a/src/test/kotlin/g0801_0900/s0839_similar_string_groups/SolutionTest.kt b/src/test/kotlin/g0801_0900/s0839_similar_string_groups/SolutionTest.kt
index 7d6f17248..f28f18031 100644
--- a/src/test/kotlin/g0801_0900/s0839_similar_string_groups/SolutionTest.kt
+++ b/src/test/kotlin/g0801_0900/s0839_similar_string_groups/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun numSimilarGroups() {
         assertThat(
             Solution().numSimilarGroups(arrayOf("tars", "rats", "arts", "star")),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
diff --git a/src/test/kotlin/g0801_0900/s0840_magic_squares_in_grid/SolutionTest.kt b/src/test/kotlin/g0801_0900/s0840_magic_squares_in_grid/SolutionTest.kt
index 9db6c774c..a0f6f6947 100644
--- a/src/test/kotlin/g0801_0900/s0840_magic_squares_in_grid/SolutionTest.kt
+++ b/src/test/kotlin/g0801_0900/s0840_magic_squares_in_grid/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .numMagicSquaresInside(arrayOf(intArrayOf(4, 3, 8, 4), intArrayOf(9, 5, 1, 9), intArrayOf(2, 7, 6, 2))),
-            equalTo(1)
+            equalTo(1),
         )
     }
 
diff --git a/src/test/kotlin/g0801_0900/s0841_keys_and_rooms/SolutionTest.kt b/src/test/kotlin/g0801_0900/s0841_keys_and_rooms/SolutionTest.kt
index e4306a534..327482638 100644
--- a/src/test/kotlin/g0801_0900/s0841_keys_and_rooms/SolutionTest.kt
+++ b/src/test/kotlin/g0801_0900/s0841_keys_and_rooms/SolutionTest.kt
@@ -10,9 +10,9 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .canVisitAllRooms(
-                    listOf(listOf(1), listOf(2), listOf(3), emptyList())
+                    listOf(listOf(1), listOf(2), listOf(3), emptyList()),
                 ),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
@@ -23,10 +23,12 @@ internal class SolutionTest {
                 .canVisitAllRooms(
                     listOf(
                         listOf(1, 3),
-                        listOf(3, 0, 1), listOf(2), listOf(0)
-                    )
+                        listOf(3, 0, 1),
+                        listOf(2),
+                        listOf(0),
+                    ),
                 ),
-            equalTo(false)
+            equalTo(false),
         )
     }
 }
diff --git a/src/test/kotlin/g0801_0900/s0842_split_array_into_fibonacci_sequence/SolutionTest.kt b/src/test/kotlin/g0801_0900/s0842_split_array_into_fibonacci_sequence/SolutionTest.kt
index cb7f68adb..28df01ae2 100644
--- a/src/test/kotlin/g0801_0900/s0842_split_array_into_fibonacci_sequence/SolutionTest.kt
+++ b/src/test/kotlin/g0801_0900/s0842_split_array_into_fibonacci_sequence/SolutionTest.kt
@@ -9,14 +9,15 @@ internal class SolutionTest {
     fun splitIntoFibonacci() {
         assertThat(
             Solution().splitIntoFibonacci("1101111"),
-            equalTo(listOf(11, 0, 11, 11))
+            equalTo(listOf(11, 0, 11, 11)),
         )
     }
 
     @Test
     fun splitIntoFibonacci2() {
         assertThat(
-            Solution().splitIntoFibonacci("112358130"), equalTo(emptyList())
+            Solution().splitIntoFibonacci("112358130"),
+            equalTo(emptyList()),
         )
     }
 
diff --git a/src/test/kotlin/g0801_0900/s0843_guess_the_word/SolutionTest.kt b/src/test/kotlin/g0801_0900/s0843_guess_the_word/SolutionTest.kt
index 626fc3d46..96057ae7b 100644
--- a/src/test/kotlin/g0801_0900/s0843_guess_the_word/SolutionTest.kt
+++ b/src/test/kotlin/g0801_0900/s0843_guess_the_word/SolutionTest.kt
@@ -43,7 +43,7 @@ internal class SolutionTest {
                         }
                         return result
                     }
-                }
+                },
             )
     }
 }
diff --git a/src/test/kotlin/g0801_0900/s0846_hand_of_straights/SolutionTest.kt b/src/test/kotlin/g0801_0900/s0846_hand_of_straights/SolutionTest.kt
index 25068c529..50de2d5e0 100644
--- a/src/test/kotlin/g0801_0900/s0846_hand_of_straights/SolutionTest.kt
+++ b/src/test/kotlin/g0801_0900/s0846_hand_of_straights/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun isNStraightHand() {
         assertThat(
             Solution().isNStraightHand(intArrayOf(1, 2, 3, 6, 2, 3, 4, 7, 8), 3),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
diff --git a/src/test/kotlin/g0801_0900/s0847_shortest_path_visiting_all_nodes/SolutionTest.kt b/src/test/kotlin/g0801_0900/s0847_shortest_path_visiting_all_nodes/SolutionTest.kt
index 5b74a6901..918a0a5a3 100644
--- a/src/test/kotlin/g0801_0900/s0847_shortest_path_visiting_all_nodes/SolutionTest.kt
+++ b/src/test/kotlin/g0801_0900/s0847_shortest_path_visiting_all_nodes/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun shortestPathLength() {
         assertThat(
             Solution().shortestPathLength(arrayOf(intArrayOf(1, 2, 3), intArrayOf(0), intArrayOf(0), intArrayOf(0))),
-            equalTo(4)
+            equalTo(4),
         )
     }
 
@@ -23,10 +23,10 @@ internal class SolutionTest {
                         intArrayOf(0, 2, 3),
                         intArrayOf(1, 3, 4),
                         intArrayOf(2),
-                        intArrayOf(1, 2)
-                    )
+                        intArrayOf(1, 2),
+                    ),
                 ),
-            equalTo(4)
+            equalTo(4),
         )
     }
 }
diff --git a/src/test/kotlin/g0801_0900/s0850_rectangle_area_ii/SolutionTest.kt b/src/test/kotlin/g0801_0900/s0850_rectangle_area_ii/SolutionTest.kt
index 621db16a5..97b9121ec 100644
--- a/src/test/kotlin/g0801_0900/s0850_rectangle_area_ii/SolutionTest.kt
+++ b/src/test/kotlin/g0801_0900/s0850_rectangle_area_ii/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .rectangleArea(arrayOf(intArrayOf(0, 0, 2, 2), intArrayOf(1, 0, 2, 3), intArrayOf(1, 0, 3, 1))),
-            equalTo(6)
+            equalTo(6),
         )
     }
 
@@ -18,7 +18,7 @@ internal class SolutionTest {
     fun rectangleArea2() {
         assertThat(
             Solution().rectangleArea(arrayOf(intArrayOf(0, 0, 1000000000, 1000000000))),
-            equalTo(49)
+            equalTo(49),
         )
     }
 }
diff --git a/src/test/kotlin/g0801_0900/s0851_loud_and_rich/SolutionTest.kt b/src/test/kotlin/g0801_0900/s0851_loud_and_rich/SolutionTest.kt
index 048a2c6e9..059f0f963 100644
--- a/src/test/kotlin/g0801_0900/s0851_loud_and_rich/SolutionTest.kt
+++ b/src/test/kotlin/g0801_0900/s0851_loud_and_rich/SolutionTest.kt
@@ -17,18 +17,19 @@ internal class SolutionTest {
                         intArrayOf(3, 7),
                         intArrayOf(4, 3),
                         intArrayOf(5, 3),
-                        intArrayOf(6, 3)
+                        intArrayOf(6, 3),
                     ),
-                    intArrayOf(3, 2, 5, 4, 6, 1, 7, 0)
+                    intArrayOf(3, 2, 5, 4, 6, 1, 7, 0),
                 ),
-            equalTo(intArrayOf(5, 5, 2, 5, 4, 5, 6, 7))
+            equalTo(intArrayOf(5, 5, 2, 5, 4, 5, 6, 7)),
         )
     }
 
     @Test
     fun loudAndRich2() {
         assertThat(
-            Solution().loudAndRich(arrayOf(), intArrayOf(0)), equalTo(intArrayOf(0))
+            Solution().loudAndRich(arrayOf(), intArrayOf(0)),
+            equalTo(intArrayOf(0)),
         )
     }
 }
diff --git a/src/test/kotlin/g0801_0900/s0853_car_fleet/SolutionTest.kt b/src/test/kotlin/g0801_0900/s0853_car_fleet/SolutionTest.kt
index 5e49c1461..c077a7b67 100644
--- a/src/test/kotlin/g0801_0900/s0853_car_fleet/SolutionTest.kt
+++ b/src/test/kotlin/g0801_0900/s0853_car_fleet/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun carFleet() {
         assertThat(
             Solution().carFleet(12, intArrayOf(10, 8, 0, 5, 3), intArrayOf(2, 4, 1, 1, 3)),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
@@ -21,7 +21,8 @@ internal class SolutionTest {
     @Test
     fun carFleet3() {
         assertThat(
-            Solution().carFleet(100, intArrayOf(0, 2, 4), intArrayOf(4, 2, 1)), equalTo(1)
+            Solution().carFleet(100, intArrayOf(0, 2, 4), intArrayOf(4, 2, 1)),
+            equalTo(1),
         )
     }
 }
diff --git a/src/test/kotlin/g0801_0900/s0857_minimum_cost_to_hire_k_workers/SolutionTest.kt b/src/test/kotlin/g0801_0900/s0857_minimum_cost_to_hire_k_workers/SolutionTest.kt
index 2635f3cf8..14b90a2f5 100644
--- a/src/test/kotlin/g0801_0900/s0857_minimum_cost_to_hire_k_workers/SolutionTest.kt
+++ b/src/test/kotlin/g0801_0900/s0857_minimum_cost_to_hire_k_workers/SolutionTest.kt
@@ -13,7 +13,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .mincostToHireWorkers(intArrayOf(10, 20, 5), intArrayOf(70, 50, 30), 2),
-            equalTo(105.00000)
+            equalTo(105.00000),
         )
     }
 
@@ -24,11 +24,11 @@ internal class SolutionTest {
                 Solution()
                     .mincostToHireWorkers(
                         intArrayOf(3, 1, 10, 10, 1), intArrayOf(4, 8, 2, 2, 7),
-                        3
+                        3,
                     ) *
                     n
                 ).roundToInt().toDouble() / n,
-            equalTo(30.66667)
+            equalTo(30.66667),
         )
     }
 }
diff --git a/src/test/kotlin/g0801_0900/s0861_score_after_flipping_matrix/SolutionTest.kt b/src/test/kotlin/g0801_0900/s0861_score_after_flipping_matrix/SolutionTest.kt
index 4ee00b8d5..aefafea20 100644
--- a/src/test/kotlin/g0801_0900/s0861_score_after_flipping_matrix/SolutionTest.kt
+++ b/src/test/kotlin/g0801_0900/s0861_score_after_flipping_matrix/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun matrixScore() {
         assertThat(
             Solution().matrixScore(arrayOf(intArrayOf(0, 0, 1, 1), intArrayOf(1, 0, 1, 0), intArrayOf(1, 1, 0, 0))),
-            equalTo(39)
+            equalTo(39),
         )
     }
 
diff --git a/src/test/kotlin/g0801_0900/s0863_all_nodes_distance_k_in_binary_tree/SolutionTest.kt b/src/test/kotlin/g0801_0900/s0863_all_nodes_distance_k_in_binary_tree/SolutionTest.kt
index 5af8b9573..25701c3df 100644
--- a/src/test/kotlin/g0801_0900/s0863_all_nodes_distance_k_in_binary_tree/SolutionTest.kt
+++ b/src/test/kotlin/g0801_0900/s0863_all_nodes_distance_k_in_binary_tree/SolutionTest.kt
@@ -12,12 +12,12 @@ internal class SolutionTest {
             Solution()
                 .distanceK(
                     TreeNode.create(
-                        listOf(3, 5, 1, 6, 2, 0, 8, null, null, 7, 4)
+                        listOf(3, 5, 1, 6, 2, 0, 8, null, null, 7, 4),
                     ),
                     TreeNode(5),
-                    2
+                    2,
                 ),
-            equalTo(listOf(7, 4, 1))
+            equalTo(listOf(7, 4, 1)),
         )
     }
 
@@ -28,9 +28,9 @@ internal class SolutionTest {
                 .distanceK(
                     TreeNode.create(listOf(1)),
                     TreeNode(1),
-                    3
+                    3,
                 ),
-            equalTo(emptyList())
+            equalTo(emptyList()),
         )
     }
 }
diff --git a/src/test/kotlin/g0801_0900/s0864_shortest_path_to_get_all_keys/SolutionTest.kt b/src/test/kotlin/g0801_0900/s0864_shortest_path_to_get_all_keys/SolutionTest.kt
index cc07eb5c6..ebd10e7de 100644
--- a/src/test/kotlin/g0801_0900/s0864_shortest_path_to_get_all_keys/SolutionTest.kt
+++ b/src/test/kotlin/g0801_0900/s0864_shortest_path_to_get_all_keys/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun shortestPathAllKeys() {
         assertThat(
             Solution().shortestPathAllKeys(arrayOf("@.a.#", "###.#", "b.A.B")),
-            equalTo(8)
+            equalTo(8),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun shortestPathAllKeys2() {
         assertThat(
             Solution().shortestPathAllKeys(arrayOf("@..aA", "..B#.", "....b")),
-            equalTo(6)
+            equalTo(6),
         )
     }
 
diff --git a/src/test/kotlin/g0801_0900/s0865_smallest_subtree_with_all_the_deepest_nodes/SolutionTest.kt b/src/test/kotlin/g0801_0900/s0865_smallest_subtree_with_all_the_deepest_nodes/SolutionTest.kt
index 38011098a..d506fc540 100644
--- a/src/test/kotlin/g0801_0900/s0865_smallest_subtree_with_all_the_deepest_nodes/SolutionTest.kt
+++ b/src/test/kotlin/g0801_0900/s0865_smallest_subtree_with_all_the_deepest_nodes/SolutionTest.kt
@@ -12,11 +12,11 @@ internal class SolutionTest {
             Solution()
                 .subtreeWithAllDeepest(
                     TreeNode.create(
-                        listOf(3, 5, 1, 6, 2, 0, 8, null, null, 7, 4)
-                    )
+                        listOf(3, 5, 1, 6, 2, 0, 8, null, null, 7, 4),
+                    ),
                 )
                 .toString(),
-            equalTo("2,7,4")
+            equalTo("2,7,4"),
         )
     }
 
@@ -26,7 +26,7 @@ internal class SolutionTest {
             Solution()
                 .subtreeWithAllDeepest(TreeNode.create(listOf(1)))
                 .toString(),
-            equalTo("1")
+            equalTo("1"),
         )
     }
 
@@ -35,10 +35,10 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .subtreeWithAllDeepest(
-                    TreeNode.create(listOf(0, 1, 3, null, 2))
+                    TreeNode.create(listOf(0, 1, 3, null, 2)),
                 )
                 .toString(),
-            equalTo("2")
+            equalTo("2"),
         )
     }
 }
diff --git a/src/test/kotlin/g0801_0900/s0867_transpose_matrix/SolutionTest.kt b/src/test/kotlin/g0801_0900/s0867_transpose_matrix/SolutionTest.kt
index 41f65bdf3..ccbbc3e64 100644
--- a/src/test/kotlin/g0801_0900/s0867_transpose_matrix/SolutionTest.kt
+++ b/src/test/kotlin/g0801_0900/s0867_transpose_matrix/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun transpose() {
         assertThat(
             Solution().transpose(arrayOf(intArrayOf(1, 2, 3), intArrayOf(4, 5, 6), intArrayOf(7, 8, 9))),
-            equalTo(arrayOf(intArrayOf(1, 4, 7), intArrayOf(2, 5, 8), intArrayOf(3, 6, 9)))
+            equalTo(arrayOf(intArrayOf(1, 4, 7), intArrayOf(2, 5, 8), intArrayOf(3, 6, 9))),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun transpose2() {
         assertThat(
             Solution().transpose(arrayOf(intArrayOf(1, 2, 3), intArrayOf(4, 5, 6))),
-            equalTo(arrayOf(intArrayOf(1, 4), intArrayOf(2, 5), intArrayOf(3, 6)))
+            equalTo(arrayOf(intArrayOf(1, 4), intArrayOf(2, 5), intArrayOf(3, 6))),
         )
     }
 }
diff --git a/src/test/kotlin/g0801_0900/s0870_advantage_shuffle/SolutionTest.kt b/src/test/kotlin/g0801_0900/s0870_advantage_shuffle/SolutionTest.kt
index 815f94064..bbbb4eb36 100644
--- a/src/test/kotlin/g0801_0900/s0870_advantage_shuffle/SolutionTest.kt
+++ b/src/test/kotlin/g0801_0900/s0870_advantage_shuffle/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun advantageCount() {
         assertThat(
             Solution().advantageCount(intArrayOf(2, 7, 11, 15), intArrayOf(1, 10, 4, 11)),
-            equalTo(intArrayOf(2, 11, 7, 15))
+            equalTo(intArrayOf(2, 11, 7, 15)),
         )
     }
 
@@ -18,7 +18,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .advantageCount(intArrayOf(12, 24, 8, 32), intArrayOf(13, 25, 32, 11)),
-            equalTo(intArrayOf(24, 32, 8, 12))
+            equalTo(intArrayOf(24, 32, 8, 12)),
         )
     }
 }
diff --git a/src/test/kotlin/g0801_0900/s0871_minimum_number_of_refueling_stops/SolutionTest.kt b/src/test/kotlin/g0801_0900/s0871_minimum_number_of_refueling_stops/SolutionTest.kt
index c97b150d8..485d75c63 100644
--- a/src/test/kotlin/g0801_0900/s0871_minimum_number_of_refueling_stops/SolutionTest.kt
+++ b/src/test/kotlin/g0801_0900/s0871_minimum_number_of_refueling_stops/SolutionTest.kt
@@ -20,9 +20,11 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .minRefuelStops(
-                    100, 10, arrayOf(intArrayOf(10, 60), intArrayOf(20, 30), intArrayOf(30, 30), intArrayOf(60, 40))
+                    100,
+                    10,
+                    arrayOf(intArrayOf(10, 60), intArrayOf(20, 30), intArrayOf(30, 30), intArrayOf(60, 40)),
                 ),
-            equalTo(2)
+            equalTo(2),
         )
     }
 }
diff --git a/src/test/kotlin/g0801_0900/s0872_leaf_similar_trees/SolutionTest.kt b/src/test/kotlin/g0801_0900/s0872_leaf_similar_trees/SolutionTest.kt
index afa623c07..6b52c9e88 100644
--- a/src/test/kotlin/g0801_0900/s0872_leaf_similar_trees/SolutionTest.kt
+++ b/src/test/kotlin/g0801_0900/s0872_leaf_similar_trees/SolutionTest.kt
@@ -18,8 +18,8 @@ internal class SolutionTest {
         val root1: TreeNode? = TreeNode.create(listOf(3, 5, 1, 6, 2, 9, 8, null, null, 7, 4))
         val root2: TreeNode? = TreeNode.create(
             listOf(
-                3, 5, 1, 6, 7, 4, 2, null, null, null, null, null, null, 9, 8
-            )
+                3, 5, 1, 6, 7, 4, 2, null, null, null, null, null, null, 9, 8,
+            ),
         )
         assertThat(Solution().leafSimilar(root1, root2), equalTo(true))
     }
diff --git a/src/test/kotlin/g0801_0900/s0873_length_of_longest_fibonacci_subsequence/SolutionTest.kt b/src/test/kotlin/g0801_0900/s0873_length_of_longest_fibonacci_subsequence/SolutionTest.kt
index 1b11481e9..faaa01d82 100644
--- a/src/test/kotlin/g0801_0900/s0873_length_of_longest_fibonacci_subsequence/SolutionTest.kt
+++ b/src/test/kotlin/g0801_0900/s0873_length_of_longest_fibonacci_subsequence/SolutionTest.kt
@@ -8,7 +8,8 @@ internal class SolutionTest {
     @Test
     fun lenLongestFibSubseq() {
         assertThat(
-            Solution().lenLongestFibSubseq(intArrayOf(1, 2, 3, 4, 5, 6, 7, 8)), equalTo(5)
+            Solution().lenLongestFibSubseq(intArrayOf(1, 2, 3, 4, 5, 6, 7, 8)),
+            equalTo(5),
         )
     }
 
@@ -16,7 +17,7 @@ internal class SolutionTest {
     fun lenLongestFibSubseq2() {
         assertThat(
             Solution().lenLongestFibSubseq(intArrayOf(1, 3, 7, 11, 12, 14, 18)),
-            equalTo(3)
+            equalTo(3),
         )
     }
 }
diff --git a/src/test/kotlin/g0801_0900/s0874_walking_robot_simulation/SolutionTest.kt b/src/test/kotlin/g0801_0900/s0874_walking_robot_simulation/SolutionTest.kt
index c55c3683b..0885553a3 100644
--- a/src/test/kotlin/g0801_0900/s0874_walking_robot_simulation/SolutionTest.kt
+++ b/src/test/kotlin/g0801_0900/s0874_walking_robot_simulation/SolutionTest.kt
@@ -14,7 +14,7 @@ internal class SolutionTest {
     fun robotSim2() {
         assertThat(
             Solution().robotSim(intArrayOf(4, -1, 4, -2, 4), arrayOf(intArrayOf(2, 4))),
-            equalTo(65)
+            equalTo(65),
         )
     }
 
@@ -25,11 +25,11 @@ internal class SolutionTest {
                 .robotSim(
                     intArrayOf(
                         4, -1, 4, -2, 4, 3, 5, -1, 3, -2, 4, -1, 3, -1, 2, -1, 4, -1, 5,
-                        -1, 3, -1, 2
+                        -1, 3, -1, 2,
                     ),
-                    arrayOf(intArrayOf(2, 4), intArrayOf(4, 5), intArrayOf(2, 3), intArrayOf(0, 1), intArrayOf(1, 6))
+                    arrayOf(intArrayOf(2, 4), intArrayOf(4, 5), intArrayOf(2, 3), intArrayOf(0, 1), intArrayOf(1, 6)),
                 ),
-            equalTo(202)
+            equalTo(202),
         )
     }
 }
diff --git a/src/test/kotlin/g0801_0900/s0876_middle_of_the_linked_list/SolutionTest.kt b/src/test/kotlin/g0801_0900/s0876_middle_of_the_linked_list/SolutionTest.kt
index a57eae479..3208838a2 100644
--- a/src/test/kotlin/g0801_0900/s0876_middle_of_the_linked_list/SolutionTest.kt
+++ b/src/test/kotlin/g0801_0900/s0876_middle_of_the_linked_list/SolutionTest.kt
@@ -11,7 +11,7 @@ internal class SolutionTest {
         val head = createSinglyLinkedList(listOf(1, 2, 3, 4, 5))
         assertThat(
             Solution().middleNode(head).toString(),
-            equalTo(createSinglyLinkedList(listOf(3, 4, 5)).toString())
+            equalTo(createSinglyLinkedList(listOf(3, 4, 5)).toString()),
         )
     }
 
@@ -20,7 +20,7 @@ internal class SolutionTest {
         val head = createSinglyLinkedList(listOf(1, 2, 3, 4, 5, 6))
         assertThat(
             Solution().middleNode(head).toString(),
-            equalTo(createSinglyLinkedList(listOf(4, 5, 6)).toString())
+            equalTo(createSinglyLinkedList(listOf(4, 5, 6)).toString()),
         )
     }
 }
diff --git a/src/test/kotlin/g0801_0900/s0879_profitable_schemes/SolutionTest.kt b/src/test/kotlin/g0801_0900/s0879_profitable_schemes/SolutionTest.kt
index a6c2d4e76..892a38699 100644
--- a/src/test/kotlin/g0801_0900/s0879_profitable_schemes/SolutionTest.kt
+++ b/src/test/kotlin/g0801_0900/s0879_profitable_schemes/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun profitableSchemes() {
         assertThat(
             Solution().profitableSchemes(5, 3, intArrayOf(2, 2), intArrayOf(2, 3)),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun profitableSchemes2() {
         assertThat(
             Solution().profitableSchemes(10, 5, intArrayOf(2, 3, 5), intArrayOf(6, 7, 8)),
-            equalTo(7)
+            equalTo(7),
         )
     }
 }
diff --git a/src/test/kotlin/g0801_0900/s0882_reachable_nodes_in_subdivided_graph/SolutionTest.kt b/src/test/kotlin/g0801_0900/s0882_reachable_nodes_in_subdivided_graph/SolutionTest.kt
index 9941f96d1..dfe6fd830 100644
--- a/src/test/kotlin/g0801_0900/s0882_reachable_nodes_in_subdivided_graph/SolutionTest.kt
+++ b/src/test/kotlin/g0801_0900/s0882_reachable_nodes_in_subdivided_graph/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun reachableNodes() {
         assertThat(
             Solution().reachableNodes(arrayOf(intArrayOf(0, 1, 10), intArrayOf(0, 2, 1), intArrayOf(1, 2, 2)), 6, 3),
-            equalTo(13)
+            equalTo(13),
         )
     }
 
@@ -22,11 +22,12 @@ internal class SolutionTest {
                         intArrayOf(0, 1, 4),
                         intArrayOf(1, 2, 6),
                         intArrayOf(0, 2, 8),
-                        intArrayOf(1, 3, 1)
+                        intArrayOf(1, 3, 1),
                     ),
-                    10, 4
+                    10,
+                    4,
                 ),
-            equalTo(23)
+            equalTo(23),
         )
     }
 
@@ -40,12 +41,12 @@ internal class SolutionTest {
                         intArrayOf(1, 4, 5),
                         intArrayOf(1, 3, 1),
                         intArrayOf(2, 3, 4),
-                        intArrayOf(3, 4, 5)
+                        intArrayOf(3, 4, 5),
                     ),
                     17,
-                    5
+                    5,
                 ),
-            equalTo(1)
+            equalTo(1),
         )
     }
 }
diff --git a/src/test/kotlin/g0801_0900/s0884_uncommon_words_from_two_sentences/SolutionTest.kt b/src/test/kotlin/g0801_0900/s0884_uncommon_words_from_two_sentences/SolutionTest.kt
index 2492b1d81..938849875 100644
--- a/src/test/kotlin/g0801_0900/s0884_uncommon_words_from_two_sentences/SolutionTest.kt
+++ b/src/test/kotlin/g0801_0900/s0884_uncommon_words_from_two_sentences/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun uncommonFromSentences() {
         assertThat(
             Solution().uncommonFromSentences("this apple is sweet", "this apple is sour"),
-            equalTo(arrayOf("sweet", "sour"))
+            equalTo(arrayOf("sweet", "sour")),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun uncommonFromSentences2() {
         assertThat(
             Solution().uncommonFromSentences("apple apple", "banana"),
-            equalTo(arrayOf("banana"))
+            equalTo(arrayOf("banana")),
         )
     }
 }
diff --git a/src/test/kotlin/g0801_0900/s0885_spiral_matrix_iii/SolutionTest.kt b/src/test/kotlin/g0801_0900/s0885_spiral_matrix_iii/SolutionTest.kt
index 8a5f80014..10d451f9d 100644
--- a/src/test/kotlin/g0801_0900/s0885_spiral_matrix_iii/SolutionTest.kt
+++ b/src/test/kotlin/g0801_0900/s0885_spiral_matrix_iii/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun spiralMatrixIII() {
         assertThat(
             Solution().spiralMatrixIII(1, 4, 0, 0),
-            equalTo(arrayOf(intArrayOf(0, 0), intArrayOf(0, 1), intArrayOf(0, 2), intArrayOf(0, 3)))
+            equalTo(arrayOf(intArrayOf(0, 0), intArrayOf(0, 1), intArrayOf(0, 2), intArrayOf(0, 3))),
         )
     }
 
@@ -48,9 +48,9 @@ internal class SolutionTest {
                     intArrayOf(3, 0),
                     intArrayOf(2, 0),
                     intArrayOf(1, 0),
-                    intArrayOf(0, 0)
-                )
-            )
+                    intArrayOf(0, 0),
+                ),
+            ),
         )
     }
 }
diff --git a/src/test/kotlin/g0801_0900/s0886_possible_bipartition/SolutionTest.kt b/src/test/kotlin/g0801_0900/s0886_possible_bipartition/SolutionTest.kt
index c314dde78..9e6fc2723 100644
--- a/src/test/kotlin/g0801_0900/s0886_possible_bipartition/SolutionTest.kt
+++ b/src/test/kotlin/g0801_0900/s0886_possible_bipartition/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun possibleBipartition() {
         assertThat(
             Solution().possibleBipartition(4, arrayOf(intArrayOf(1, 2), intArrayOf(1, 3), intArrayOf(2, 4))),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun possibleBipartition2() {
         assertThat(
             Solution().possibleBipartition(3, arrayOf(intArrayOf(1, 2), intArrayOf(1, 3), intArrayOf(2, 3))),
-            equalTo(false)
+            equalTo(false),
         )
     }
 
@@ -26,9 +26,10 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .possibleBipartition(
-                    5, arrayOf(intArrayOf(1, 2), intArrayOf(2, 3), intArrayOf(3, 4), intArrayOf(4, 5), intArrayOf(1, 5))
+                    5,
+                    arrayOf(intArrayOf(1, 2), intArrayOf(2, 3), intArrayOf(3, 4), intArrayOf(4, 5), intArrayOf(1, 5)),
                 ),
-            equalTo(false)
+            equalTo(false),
         )
     }
 }
diff --git a/src/test/kotlin/g0801_0900/s0888_fair_candy_swap/SolutionTest.kt b/src/test/kotlin/g0801_0900/s0888_fair_candy_swap/SolutionTest.kt
index 388836974..0f670975d 100644
--- a/src/test/kotlin/g0801_0900/s0888_fair_candy_swap/SolutionTest.kt
+++ b/src/test/kotlin/g0801_0900/s0888_fair_candy_swap/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun fairCandySwap() {
         assertThat(
             Solution().fairCandySwap(intArrayOf(1, 1), intArrayOf(2, 2)),
-            equalTo(intArrayOf(1, 2))
+            equalTo(intArrayOf(1, 2)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun fairCandySwap2() {
         assertThat(
             Solution().fairCandySwap(intArrayOf(1, 2), intArrayOf(2, 3)),
-            equalTo(intArrayOf(1, 2))
+            equalTo(intArrayOf(1, 2)),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun fairCandySwap3() {
         assertThat(
             Solution().fairCandySwap(intArrayOf(2), intArrayOf(1, 3)),
-            equalTo(intArrayOf(2, 3))
+            equalTo(intArrayOf(2, 3)),
         )
     }
 }
diff --git a/src/test/kotlin/g0801_0900/s0889_construct_binary_tree_from_preorder_and_postorder_traversal/SolutionTest.kt b/src/test/kotlin/g0801_0900/s0889_construct_binary_tree_from_preorder_and_postorder_traversal/SolutionTest.kt
index 5e01bf889..a6813f76b 100644
--- a/src/test/kotlin/g0801_0900/s0889_construct_binary_tree_from_preorder_and_postorder_traversal/SolutionTest.kt
+++ b/src/test/kotlin/g0801_0900/s0889_construct_binary_tree_from_preorder_and_postorder_traversal/SolutionTest.kt
@@ -11,7 +11,7 @@ internal class SolutionTest {
             Solution()
                 .constructFromPrePost(intArrayOf(1, 2, 4, 5, 3, 6, 7), intArrayOf(4, 5, 2, 6, 7, 3, 1))
                 .toString(),
-            equalTo("1,2,4,5,3,6,7")
+            equalTo("1,2,4,5,3,6,7"),
         )
     }
 
@@ -19,7 +19,7 @@ internal class SolutionTest {
     fun constructFromPrePost2() {
         assertThat(
             Solution().constructFromPrePost(intArrayOf(1), intArrayOf(1)).toString(),
-            equalTo("1")
+            equalTo("1"),
         )
     }
 }
diff --git a/src/test/kotlin/g0801_0900/s0890_find_and_replace_pattern/SolutionTest.kt b/src/test/kotlin/g0801_0900/s0890_find_and_replace_pattern/SolutionTest.kt
index 7290ddf45..df1c374ff 100644
--- a/src/test/kotlin/g0801_0900/s0890_find_and_replace_pattern/SolutionTest.kt
+++ b/src/test/kotlin/g0801_0900/s0890_find_and_replace_pattern/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .findAndReplacePattern(arrayOf("abc", "deq", "mee", "aqq", "dkd", "ccc"), "abb"),
-            equalTo(listOf("mee", "aqq"))
+            equalTo(listOf("mee", "aqq")),
         )
     }
 
@@ -18,7 +18,7 @@ internal class SolutionTest {
     fun findAndReplacePattern2() {
         assertThat(
             Solution().findAndReplacePattern(arrayOf("a", "b", "c"), "a"),
-            equalTo(listOf("a", "b", "c"))
+            equalTo(listOf("a", "b", "c")),
         )
     }
 }
diff --git a/src/test/kotlin/g0801_0900/s0892_surface_area_of_3d_shapes/SolutionTest.kt b/src/test/kotlin/g0801_0900/s0892_surface_area_of_3d_shapes/SolutionTest.kt
index c052f6d46..a2c8dc69c 100644
--- a/src/test/kotlin/g0801_0900/s0892_surface_area_of_3d_shapes/SolutionTest.kt
+++ b/src/test/kotlin/g0801_0900/s0892_surface_area_of_3d_shapes/SolutionTest.kt
@@ -14,7 +14,7 @@ internal class SolutionTest {
     fun surfaceArea2() {
         assertThat(
             Solution().surfaceArea(arrayOf(intArrayOf(1, 1, 1), intArrayOf(1, 0, 1), intArrayOf(1, 1, 1))),
-            equalTo(32)
+            equalTo(32),
         )
     }
 
@@ -22,7 +22,7 @@ internal class SolutionTest {
     fun surfaceArea3() {
         assertThat(
             Solution().surfaceArea(arrayOf(intArrayOf(2, 2, 2), intArrayOf(2, 1, 2), intArrayOf(2, 2, 2))),
-            equalTo(46)
+            equalTo(46),
         )
     }
 }
diff --git a/src/test/kotlin/g0801_0900/s0893_groups_of_special_equivalent_strings/SolutionTest.kt b/src/test/kotlin/g0801_0900/s0893_groups_of_special_equivalent_strings/SolutionTest.kt
index fca5dc5c5..ff330fbaa 100644
--- a/src/test/kotlin/g0801_0900/s0893_groups_of_special_equivalent_strings/SolutionTest.kt
+++ b/src/test/kotlin/g0801_0900/s0893_groups_of_special_equivalent_strings/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .numSpecialEquivGroups(arrayOf("abcd", "cdab", "cbad", "xyzz", "zzxy", "zzyx")),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
@@ -19,7 +19,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .numSpecialEquivGroups(arrayOf("abc", "acb", "bac", "bca", "cab", "cba")),
-            equalTo(3)
+            equalTo(3),
         )
     }
 }
diff --git a/src/test/kotlin/g0801_0900/s0894_all_possible_full_binary_trees/SolutionTest.kt b/src/test/kotlin/g0801_0900/s0894_all_possible_full_binary_trees/SolutionTest.kt
index da6708cb9..6cba4aae8 100644
--- a/src/test/kotlin/g0801_0900/s0894_all_possible_full_binary_trees/SolutionTest.kt
+++ b/src/test/kotlin/g0801_0900/s0894_all_possible_full_binary_trees/SolutionTest.kt
@@ -10,8 +10,8 @@ internal class SolutionTest {
         assertThat(
             Solution().allPossibleFBT(7).toString(),
             equalTo(
-                "[0,0,0,0,0,0,0, 0,0,0,0,0,0,0, 0,0,0,0,0,0,0, 0,0,0,0,0,0,0, 0,0,0,0,0,0,0]"
-            )
+                "[0,0,0,0,0,0,0, 0,0,0,0,0,0,0, 0,0,0,0,0,0,0, 0,0,0,0,0,0,0, 0,0,0,0,0,0,0]",
+            ),
         )
     }
 
diff --git a/src/test/kotlin/g0801_0900/s0897_increasing_order_search_tree/SolutionTest.kt b/src/test/kotlin/g0801_0900/s0897_increasing_order_search_tree/SolutionTest.kt
index b4aa656e7..54099edfe 100644
--- a/src/test/kotlin/g0801_0900/s0897_increasing_order_search_tree/SolutionTest.kt
+++ b/src/test/kotlin/g0801_0900/s0897_increasing_order_search_tree/SolutionTest.kt
@@ -13,12 +13,12 @@ internal class SolutionTest {
                 .increasingBST(
                     TreeNode.create(
                         listOf(
-                            5, 3, 6, 2, 4, null, 8, 1, null, null, null, 7, 9
-                        )
-                    )
+                            5, 3, 6, 2, 4, null, 8, 1, null, null, null, 7, 9,
+                        ),
+                    ),
                 )
                 .toString(),
-            equalTo("1,null,2,null,3,null,4,null,5,null,6,null,7,null,8,null,9")
+            equalTo("1,null,2,null,3,null,4,null,5,null,6,null,7,null,8,null,9"),
         )
     }
 
@@ -28,7 +28,7 @@ internal class SolutionTest {
             Solution()
                 .increasingBST(TreeNode.create(listOf(5, 1, 7)))
                 .toString(),
-            equalTo("1,null,5,null,7")
+            equalTo("1,null,5,null,7"),
         )
     }
 }
diff --git a/src/test/kotlin/g0901_1000/s0902_numbers_at_most_n_given_digit_set/SolutionTest.kt b/src/test/kotlin/g0901_1000/s0902_numbers_at_most_n_given_digit_set/SolutionTest.kt
index 06c95f9a4..a763498e4 100644
--- a/src/test/kotlin/g0901_1000/s0902_numbers_at_most_n_given_digit_set/SolutionTest.kt
+++ b/src/test/kotlin/g0901_1000/s0902_numbers_at_most_n_given_digit_set/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun atMostNGivenDigitSet() {
         assertThat(
             Solution().atMostNGivenDigitSet(arrayOf("1", "3", "5", "7"), 100),
-            equalTo(20)
+            equalTo(20),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun atMostNGivenDigitSet2() {
         assertThat(
             Solution().atMostNGivenDigitSet(arrayOf("1", "4", "9"), 1000000000),
-            equalTo(29523)
+            equalTo(29523),
         )
     }
 
diff --git a/src/test/kotlin/g0901_1000/s0905_sort_array_by_parity/SolutionTest.kt b/src/test/kotlin/g0901_1000/s0905_sort_array_by_parity/SolutionTest.kt
index 04e0043cb..2c4ae124b 100644
--- a/src/test/kotlin/g0901_1000/s0905_sort_array_by_parity/SolutionTest.kt
+++ b/src/test/kotlin/g0901_1000/s0905_sort_array_by_parity/SolutionTest.kt
@@ -9,9 +9,10 @@ internal class SolutionTest {
     fun sortArrayByParity() {
         assertThat(
             compareArray(
-                Solution().sortArrayByParity(intArrayOf(3, 1, 2, 4)), intArrayOf(2, 4, 3, 1)
+                Solution().sortArrayByParity(intArrayOf(3, 1, 2, 4)),
+                intArrayOf(2, 4, 3, 1),
             ),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
diff --git a/src/test/kotlin/g0901_1000/s0909_snakes_and_ladders/SolutionTest.kt b/src/test/kotlin/g0901_1000/s0909_snakes_and_ladders/SolutionTest.kt
index fbefc6d63..d1b7103f8 100644
--- a/src/test/kotlin/g0901_1000/s0909_snakes_and_ladders/SolutionTest.kt
+++ b/src/test/kotlin/g0901_1000/s0909_snakes_and_ladders/SolutionTest.kt
@@ -16,10 +16,10 @@ internal class SolutionTest {
                         intArrayOf(-1, -1, -1, -1, -1, -1),
                         intArrayOf(-1, 35, -1, -1, 13, -1),
                         intArrayOf(-1, -1, -1, -1, -1, -1),
-                        intArrayOf(-1, 15, -1, -1, -1, -1)
-                    )
+                        intArrayOf(-1, 15, -1, -1, -1, -1),
+                    ),
                 ),
-            equalTo(4)
+            equalTo(4),
         )
     }
 
diff --git a/src/test/kotlin/g0901_1000/s0912_sort_an_array/SolutionTest.kt b/src/test/kotlin/g0901_1000/s0912_sort_an_array/SolutionTest.kt
index d6b1ee3cd..dfc7f6ba7 100644
--- a/src/test/kotlin/g0901_1000/s0912_sort_an_array/SolutionTest.kt
+++ b/src/test/kotlin/g0901_1000/s0912_sort_an_array/SolutionTest.kt
@@ -8,7 +8,8 @@ internal class SolutionTest {
     @Test
     fun sortArray() {
         assertThat(
-            Solution().sortArray(intArrayOf(5, 2, 3, 1)), equalTo(intArrayOf(1, 2, 3, 5))
+            Solution().sortArray(intArrayOf(5, 2, 3, 1)),
+            equalTo(intArrayOf(1, 2, 3, 5)),
         )
     }
 
@@ -16,7 +17,7 @@ internal class SolutionTest {
     fun sortArray2() {
         assertThat(
             Solution().sortArray(intArrayOf(5, 1, 1, 2, 0, 0)),
-            equalTo(intArrayOf(0, 0, 1, 1, 2, 5))
+            equalTo(intArrayOf(0, 0, 1, 1, 2, 5)),
         )
     }
 }
diff --git a/src/test/kotlin/g0901_1000/s0913_cat_and_mouse/SolutionTest.kt b/src/test/kotlin/g0901_1000/s0913_cat_and_mouse/SolutionTest.kt
index b45b169dd..917103b6c 100644
--- a/src/test/kotlin/g0901_1000/s0913_cat_and_mouse/SolutionTest.kt
+++ b/src/test/kotlin/g0901_1000/s0913_cat_and_mouse/SolutionTest.kt
@@ -16,10 +16,10 @@ internal class SolutionTest {
                         intArrayOf(0, 4, 5),
                         intArrayOf(1, 4, 5),
                         intArrayOf(2, 3),
-                        intArrayOf(0, 2, 3)
-                    )
+                        intArrayOf(0, 2, 3),
+                    ),
                 ),
-            equalTo(0)
+            equalTo(0),
         )
     }
 
@@ -27,7 +27,7 @@ internal class SolutionTest {
     fun catMouseGame2() {
         assertThat(
             Solution().catMouseGame(arrayOf(intArrayOf(1, 3), intArrayOf(0), intArrayOf(3), intArrayOf(0, 2))),
-            equalTo(1)
+            equalTo(1),
         )
     }
 }
diff --git a/src/test/kotlin/g0901_1000/s0914_x_of_a_kind_in_a_deck_of_cards/SolutionTest.kt b/src/test/kotlin/g0901_1000/s0914_x_of_a_kind_in_a_deck_of_cards/SolutionTest.kt
index 703500cb0..9ce28ebd9 100644
--- a/src/test/kotlin/g0901_1000/s0914_x_of_a_kind_in_a_deck_of_cards/SolutionTest.kt
+++ b/src/test/kotlin/g0901_1000/s0914_x_of_a_kind_in_a_deck_of_cards/SolutionTest.kt
@@ -8,14 +8,16 @@ internal class SolutionTest {
     @Test
     fun hasGroupsSizeX() {
         assertThat(
-            Solution().hasGroupsSizeX(intArrayOf(1, 2, 3, 4, 4, 3, 2, 1)), equalTo(true)
+            Solution().hasGroupsSizeX(intArrayOf(1, 2, 3, 4, 4, 3, 2, 1)),
+            equalTo(true),
         )
     }
 
     @Test
     fun hasGroupsSizeX2() {
         assertThat(
-            Solution().hasGroupsSizeX(intArrayOf(1, 1, 1, 2, 2, 2, 3, 3)), equalTo(false)
+            Solution().hasGroupsSizeX(intArrayOf(1, 1, 1, 2, 2, 2, 3, 3)),
+            equalTo(false),
         )
     }
 }
diff --git a/src/test/kotlin/g0901_1000/s0916_word_subsets/SolutionTest.kt b/src/test/kotlin/g0901_1000/s0916_word_subsets/SolutionTest.kt
index ccbcb5640..d94bcaa10 100644
--- a/src/test/kotlin/g0901_1000/s0916_word_subsets/SolutionTest.kt
+++ b/src/test/kotlin/g0901_1000/s0916_word_subsets/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .wordSubsets(arrayOf("amazon", "apple", "facebook", "google", "leetcode"), arrayOf("e", "o")),
-            equalTo(listOf("facebook", "google", "leetcode"))
+            equalTo(listOf("facebook", "google", "leetcode")),
         )
     }
 
@@ -19,7 +19,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .wordSubsets(arrayOf("amazon", "apple", "facebook", "google", "leetcode"), arrayOf("l", "e")),
-            equalTo(listOf("apple", "google", "leetcode"))
+            equalTo(listOf("apple", "google", "leetcode")),
         )
     }
 }
diff --git a/src/test/kotlin/g0901_1000/s0917_reverse_only_letters/SolutionTest.kt b/src/test/kotlin/g0901_1000/s0917_reverse_only_letters/SolutionTest.kt
index 778e2a0a7..cd3d20c87 100644
--- a/src/test/kotlin/g0901_1000/s0917_reverse_only_letters/SolutionTest.kt
+++ b/src/test/kotlin/g0901_1000/s0917_reverse_only_letters/SolutionTest.kt
@@ -19,7 +19,7 @@ internal class SolutionTest {
     fun reverseOnlyLetters3() {
         assertThat(
             Solution().reverseOnlyLetters("Test1ng-Leet=code-Q!"),
-            equalTo("Qedo1ct-eeLg=ntse-T!")
+            equalTo("Qedo1ct-eeLg=ntse-T!"),
         )
     }
 }
diff --git a/src/test/kotlin/g0901_1000/s0922_sort_array_by_parity_ii/SolutionTest.kt b/src/test/kotlin/g0901_1000/s0922_sort_array_by_parity_ii/SolutionTest.kt
index 2af766e67..e5995795c 100644
--- a/src/test/kotlin/g0901_1000/s0922_sort_array_by_parity_ii/SolutionTest.kt
+++ b/src/test/kotlin/g0901_1000/s0922_sort_array_by_parity_ii/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun sortArrayByParityII() {
         assertThat(
             Solution().sortArrayByParityII(intArrayOf(4, 2, 5, 7)),
-            equalTo(intArrayOf(4, 5, 2, 7))
+            equalTo(intArrayOf(4, 5, 2, 7)),
         )
     }
 
diff --git a/src/test/kotlin/g0901_1000/s0923_3sum_with_multiplicity/SolutionTest.kt b/src/test/kotlin/g0901_1000/s0923_3sum_with_multiplicity/SolutionTest.kt
index 4856ff913..f58490766 100644
--- a/src/test/kotlin/g0901_1000/s0923_3sum_with_multiplicity/SolutionTest.kt
+++ b/src/test/kotlin/g0901_1000/s0923_3sum_with_multiplicity/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun threeSumMulti() {
         assertThat(
             Solution().threeSumMulti(intArrayOf(1, 1, 2, 2, 3, 3, 4, 4, 5, 5), 8),
-            equalTo(20)
+            equalTo(20),
         )
     }
 
diff --git a/src/test/kotlin/g0901_1000/s0924_minimize_malware_spread/SolutionTest.kt b/src/test/kotlin/g0901_1000/s0924_minimize_malware_spread/SolutionTest.kt
index e7af152b8..05d464a67 100644
--- a/src/test/kotlin/g0901_1000/s0924_minimize_malware_spread/SolutionTest.kt
+++ b/src/test/kotlin/g0901_1000/s0924_minimize_malware_spread/SolutionTest.kt
@@ -11,9 +11,9 @@ internal class SolutionTest {
             Solution()
                 .minMalwareSpread(
                     arrayOf(intArrayOf(1, 1, 0), intArrayOf(1, 1, 0), intArrayOf(0, 0, 1)),
-                    intArrayOf(0, 1)
+                    intArrayOf(0, 1),
                 ),
-            equalTo(0)
+            equalTo(0),
         )
     }
 
@@ -23,9 +23,9 @@ internal class SolutionTest {
             Solution()
                 .minMalwareSpread(
                     arrayOf(intArrayOf(1, 0, 0), intArrayOf(0, 1, 0), intArrayOf(0, 0, 1)),
-                    intArrayOf(0, 2)
+                    intArrayOf(0, 2),
                 ),
-            equalTo(0)
+            equalTo(0),
         )
     }
 
@@ -35,9 +35,9 @@ internal class SolutionTest {
             Solution()
                 .minMalwareSpread(
                     arrayOf(intArrayOf(1, 1, 1), intArrayOf(1, 1, 1), intArrayOf(1, 1, 1)),
-                    intArrayOf(1, 2)
+                    intArrayOf(1, 2),
                 ),
-            equalTo(1)
+            equalTo(1),
         )
     }
 }
diff --git a/src/test/kotlin/g0901_1000/s0927_three_equal_parts/SolutionTest.kt b/src/test/kotlin/g0901_1000/s0927_three_equal_parts/SolutionTest.kt
index 61beb3ba3..6cb262954 100644
--- a/src/test/kotlin/g0901_1000/s0927_three_equal_parts/SolutionTest.kt
+++ b/src/test/kotlin/g0901_1000/s0927_three_equal_parts/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun threeEqualParts() {
         assertThat(
             Solution().threeEqualParts(intArrayOf(1, 0, 1, 0, 1)),
-            equalTo(intArrayOf(0, 3))
+            equalTo(intArrayOf(0, 3)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun threeEqualParts2() {
         assertThat(
             Solution().threeEqualParts(intArrayOf(1, 1, 0, 1, 1)),
-            equalTo(intArrayOf(-1, -1))
+            equalTo(intArrayOf(-1, -1)),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun threeEqualParts3() {
         assertThat(
             Solution().threeEqualParts(intArrayOf(1, 1, 0, 0, 1)),
-            equalTo(intArrayOf(0, 2))
+            equalTo(intArrayOf(0, 2)),
         )
     }
 }
diff --git a/src/test/kotlin/g0901_1000/s0928_minimize_malware_spread_ii/SolutionTest.kt b/src/test/kotlin/g0901_1000/s0928_minimize_malware_spread_ii/SolutionTest.kt
index f45b8d62e..4a20440a2 100644
--- a/src/test/kotlin/g0901_1000/s0928_minimize_malware_spread_ii/SolutionTest.kt
+++ b/src/test/kotlin/g0901_1000/s0928_minimize_malware_spread_ii/SolutionTest.kt
@@ -11,9 +11,9 @@ internal class SolutionTest {
             Solution()
                 .minMalwareSpread(
                     arrayOf(intArrayOf(1, 1, 0), intArrayOf(1, 1, 0), intArrayOf(0, 0, 1)),
-                    intArrayOf(0, 1)
+                    intArrayOf(0, 1),
                 ),
-            equalTo(0)
+            equalTo(0),
         )
     }
 
@@ -23,9 +23,9 @@ internal class SolutionTest {
             Solution()
                 .minMalwareSpread(
                     arrayOf(intArrayOf(1, 1, 0), intArrayOf(1, 1, 1), intArrayOf(0, 1, 1)),
-                    intArrayOf(0, 1)
+                    intArrayOf(0, 1),
                 ),
-            equalTo(1)
+            equalTo(1),
         )
     }
 
@@ -38,11 +38,11 @@ internal class SolutionTest {
                         intArrayOf(1, 1, 0, 0),
                         intArrayOf(1, 1, 1, 0),
                         intArrayOf(0, 1, 1, 1),
-                        intArrayOf(0, 0, 1, 1)
+                        intArrayOf(0, 0, 1, 1),
                     ),
-                    intArrayOf(0, 1)
+                    intArrayOf(0, 1),
                 ),
-            equalTo(1)
+            equalTo(1),
         )
     }
 }
diff --git a/src/test/kotlin/g0901_1000/s0929_unique_email_addresses/SolutionTest.kt b/src/test/kotlin/g0901_1000/s0929_unique_email_addresses/SolutionTest.kt
index 6ed3869d0..eb1376908 100644
--- a/src/test/kotlin/g0901_1000/s0929_unique_email_addresses/SolutionTest.kt
+++ b/src/test/kotlin/g0901_1000/s0929_unique_email_addresses/SolutionTest.kt
@@ -13,10 +13,10 @@ internal class SolutionTest {
                     arrayOf(
                         "test.email+alex@leetcode.com",
                         "test.e.mail+bob.cathy@leetcode.com",
-                        "testemail+david@lee.tcode.com"
-                    )
+                        "testemail+david@lee.tcode.com",
+                    ),
                 ),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -26,10 +26,12 @@ internal class SolutionTest {
             Solution()
                 .numUniqueEmails(
                     arrayOf(
-                        "a@leetcode.com", "b@leetcode.com", "c@leetcode.com"
-                    )
+                        "a@leetcode.com",
+                        "b@leetcode.com",
+                        "c@leetcode.com",
+                    ),
                 ),
-            equalTo(3)
+            equalTo(3),
         )
     }
 }
diff --git a/src/test/kotlin/g0901_1000/s0931_minimum_falling_path_sum/SolutionTest.kt b/src/test/kotlin/g0901_1000/s0931_minimum_falling_path_sum/SolutionTest.kt
index fb5f9f44b..f86820fba 100644
--- a/src/test/kotlin/g0901_1000/s0931_minimum_falling_path_sum/SolutionTest.kt
+++ b/src/test/kotlin/g0901_1000/s0931_minimum_falling_path_sum/SolutionTest.kt
@@ -9,14 +9,15 @@ internal class SolutionTest {
     fun minFallingPathSum() {
         assertThat(
             Solution().minFallingPathSum(arrayOf(intArrayOf(2, 1, 3), intArrayOf(6, 5, 4), intArrayOf(7, 8, 9))),
-            equalTo(13)
+            equalTo(13),
         )
     }
 
     @Test
     fun minFallingPathSum2() {
         assertThat(
-            Solution().minFallingPathSum(arrayOf(intArrayOf(-19, 57), intArrayOf(-40, -5))), equalTo(-59)
+            Solution().minFallingPathSum(arrayOf(intArrayOf(-19, 57), intArrayOf(-40, -5))),
+            equalTo(-59),
         )
     }
 }
diff --git a/src/test/kotlin/g0901_1000/s0934_shortest_bridge/SolutionTest.kt b/src/test/kotlin/g0901_1000/s0934_shortest_bridge/SolutionTest.kt
index 3a4f179bf..bb633feec 100644
--- a/src/test/kotlin/g0901_1000/s0934_shortest_bridge/SolutionTest.kt
+++ b/src/test/kotlin/g0901_1000/s0934_shortest_bridge/SolutionTest.kt
@@ -14,7 +14,7 @@ internal class SolutionTest {
     fun shortestBridge2() {
         assertThat(
             Solution().shortestBridge(arrayOf(intArrayOf(0, 1, 0), intArrayOf(0, 0, 0), intArrayOf(0, 0, 1))),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -28,10 +28,10 @@ internal class SolutionTest {
                         intArrayOf(1, 0, 0, 0, 1),
                         intArrayOf(1, 0, 1, 0, 1),
                         intArrayOf(1, 0, 0, 0, 1),
-                        intArrayOf(1, 1, 1, 1, 1)
-                    )
+                        intArrayOf(1, 1, 1, 1, 1),
+                    ),
                 ),
-            equalTo(1)
+            equalTo(1),
         )
     }
 }
diff --git a/src/test/kotlin/g0901_1000/s0936_stamping_the_sequence/SolutionTest.kt b/src/test/kotlin/g0901_1000/s0936_stamping_the_sequence/SolutionTest.kt
index 020c1301f..52b5e4000 100644
--- a/src/test/kotlin/g0901_1000/s0936_stamping_the_sequence/SolutionTest.kt
+++ b/src/test/kotlin/g0901_1000/s0936_stamping_the_sequence/SolutionTest.kt
@@ -10,9 +10,10 @@ internal class SolutionTest {
     fun movesToStamp() {
         assertThat(
             CommonUtils.compareArray(
-                Solution().movesToStamp("abc", "ababc"), intArrayOf(0, 2)
+                Solution().movesToStamp("abc", "ababc"),
+                intArrayOf(0, 2),
             ),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
@@ -20,9 +21,10 @@ internal class SolutionTest {
     fun movesToStamp2() {
         assertThat(
             CommonUtils.compareArray(
-                Solution().movesToStamp("abca", "aabcaca"), intArrayOf(3, 0, 1)
+                Solution().movesToStamp("abca", "aabcaca"),
+                intArrayOf(3, 0, 1),
             ),
-            equalTo(true)
+            equalTo(true),
         )
     }
 }
diff --git a/src/test/kotlin/g0901_1000/s0937_reorder_data_in_log_files/SolutionTest.kt b/src/test/kotlin/g0901_1000/s0937_reorder_data_in_log_files/SolutionTest.kt
index 955d5feb7..125931b2c 100644
--- a/src/test/kotlin/g0901_1000/s0937_reorder_data_in_log_files/SolutionTest.kt
+++ b/src/test/kotlin/g0901_1000/s0937_reorder_data_in_log_files/SolutionTest.kt
@@ -15,8 +15,8 @@ internal class SolutionTest {
                         "let1 art can",
                         "dig2 3 6",
                         "let2 own kit dig",
-                        "let3 art zero"
-                    )
+                        "let3 art zero",
+                    ),
                 ),
             equalTo(
                 arrayOf(
@@ -24,9 +24,9 @@ internal class SolutionTest {
                     "let3 art zero",
                     "let2 own kit dig",
                     "dig1 8 1 5 1",
-                    "dig2 3 6"
-                )
-            )
+                    "dig2 3 6",
+                ),
+            ),
         )
     }
 
@@ -40,14 +40,18 @@ internal class SolutionTest {
                         "g1 act car",
                         "zo4 4 7",
                         "ab1 off key dog",
-                        "a8 act zoo"
-                    )
+                        "a8 act zoo",
+                    ),
                 ),
             equalTo(
                 arrayOf(
-                    "g1 act car", "a8 act zoo", "ab1 off key dog", "a1 9 2 3 1", "zo4 4 7"
-                )
-            )
+                    "g1 act car",
+                    "a8 act zoo",
+                    "ab1 off key dog",
+                    "a1 9 2 3 1",
+                    "zo4 4 7",
+                ),
+            ),
         )
     }
 
@@ -57,14 +61,24 @@ internal class SolutionTest {
             Solution()
                 .reorderLogFiles(
                     arrayOf(
-                        "a1 9 2 3 1", "g1 act car", "zo4 4 7", "ab1 off key dog", "a8 act zoo", "a2 act car"
-                    )
+                        "a1 9 2 3 1",
+                        "g1 act car",
+                        "zo4 4 7",
+                        "ab1 off key dog",
+                        "a8 act zoo",
+                        "a2 act car",
+                    ),
                 ),
             equalTo(
                 arrayOf(
-                    "a2 act car", "g1 act car", "a8 act zoo", "ab1 off key dog", "a1 9 2 3 1", "zo4 4 7"
-                )
-            )
+                    "a2 act car",
+                    "g1 act car",
+                    "a8 act zoo",
+                    "ab1 off key dog",
+                    "a1 9 2 3 1",
+                    "zo4 4 7",
+                ),
+            ),
         )
     }
 }
diff --git a/src/test/kotlin/g0901_1000/s0939_minimum_area_rectangle/SolutionTest.kt b/src/test/kotlin/g0901_1000/s0939_minimum_area_rectangle/SolutionTest.kt
index 9d5ef0722..826668b12 100644
--- a/src/test/kotlin/g0901_1000/s0939_minimum_area_rectangle/SolutionTest.kt
+++ b/src/test/kotlin/g0901_1000/s0939_minimum_area_rectangle/SolutionTest.kt
@@ -14,10 +14,10 @@ internal class SolutionTest {
                     intArrayOf(1, 3),
                     intArrayOf(3, 1),
                     intArrayOf(3, 3),
-                    intArrayOf(2, 2)
-                )
+                    intArrayOf(2, 2),
+                ),
             ),
-            equalTo(4)
+            equalTo(4),
         )
     }
 
@@ -32,10 +32,10 @@ internal class SolutionTest {
                         intArrayOf(3, 1),
                         intArrayOf(3, 3),
                         intArrayOf(4, 1),
-                        intArrayOf(4, 3)
-                    )
+                        intArrayOf(4, 3),
+                    ),
                 ),
-            equalTo(2)
+            equalTo(2),
         )
     }
 }
diff --git a/src/test/kotlin/g0901_1000/s0942_di_string_match/SolutionTest.kt b/src/test/kotlin/g0901_1000/s0942_di_string_match/SolutionTest.kt
index 882534045..233a26963 100644
--- a/src/test/kotlin/g0901_1000/s0942_di_string_match/SolutionTest.kt
+++ b/src/test/kotlin/g0901_1000/s0942_di_string_match/SolutionTest.kt
@@ -10,9 +10,10 @@ internal class SolutionTest {
     fun diStringMatch() {
         assertThat(
             CommonUtils.compareArray(
-                Solution().diStringMatch("IDID"), intArrayOf(0, 4, 1, 3, 2)
+                Solution().diStringMatch("IDID"),
+                intArrayOf(0, 4, 1, 3, 2),
             ),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
diff --git a/src/test/kotlin/g0901_1000/s0943_find_the_shortest_superstring/SolutionTest.kt b/src/test/kotlin/g0901_1000/s0943_find_the_shortest_superstring/SolutionTest.kt
index 9a1dcee13..c7318ada1 100644
--- a/src/test/kotlin/g0901_1000/s0943_find_the_shortest_superstring/SolutionTest.kt
+++ b/src/test/kotlin/g0901_1000/s0943_find_the_shortest_superstring/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun shortestSuperstring() {
         assertThat(
             Solution().shortestSuperstring(arrayOf("alex", "loves", "leetcode")),
-            equalTo("alexlovesleetcode")
+            equalTo("alexlovesleetcode"),
         )
     }
 
@@ -18,7 +18,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .shortestSuperstring(arrayOf("catg", "ctaagt", "gcta", "ttca", "atgcatc")),
-            equalTo("gctaagttcatgcatc")
+            equalTo("gctaagttcatgcatc"),
         )
     }
 }
diff --git a/src/test/kotlin/g0901_1000/s0946_validate_stack_sequences/SolutionTest.kt b/src/test/kotlin/g0901_1000/s0946_validate_stack_sequences/SolutionTest.kt
index 027ec6509..ccbc428d5 100644
--- a/src/test/kotlin/g0901_1000/s0946_validate_stack_sequences/SolutionTest.kt
+++ b/src/test/kotlin/g0901_1000/s0946_validate_stack_sequences/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .validateStackSequences(intArrayOf(1, 2, 3, 4, 5), intArrayOf(4, 5, 3, 2, 1)),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
@@ -19,7 +19,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .validateStackSequences(intArrayOf(1, 2, 3, 4, 5), intArrayOf(4, 3, 5, 1, 2)),
-            equalTo(false)
+            equalTo(false),
         )
     }
 }
diff --git a/src/test/kotlin/g0901_1000/s0947_most_stones_removed_with_same_row_or_column/SolutionTest.kt b/src/test/kotlin/g0901_1000/s0947_most_stones_removed_with_same_row_or_column/SolutionTest.kt
index 86389ce35..c811e0b0e 100644
--- a/src/test/kotlin/g0901_1000/s0947_most_stones_removed_with_same_row_or_column/SolutionTest.kt
+++ b/src/test/kotlin/g0901_1000/s0947_most_stones_removed_with_same_row_or_column/SolutionTest.kt
@@ -16,10 +16,10 @@ internal class SolutionTest {
                         intArrayOf(1, 0),
                         intArrayOf(1, 2),
                         intArrayOf(2, 1),
-                        intArrayOf(2, 2)
-                    )
+                        intArrayOf(2, 2),
+                    ),
                 ),
-            equalTo(5)
+            equalTo(5),
         )
     }
 
@@ -32,10 +32,10 @@ internal class SolutionTest {
                     intArrayOf(0, 2),
                     intArrayOf(1, 1),
                     intArrayOf(2, 0),
-                    intArrayOf(2, 2)
-                )
+                    intArrayOf(2, 2),
+                ),
             ),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
diff --git a/src/test/kotlin/g0901_1000/s0948_bag_of_tokens/SolutionTest.kt b/src/test/kotlin/g0901_1000/s0948_bag_of_tokens/SolutionTest.kt
index 3914dbf47..014011dec 100644
--- a/src/test/kotlin/g0901_1000/s0948_bag_of_tokens/SolutionTest.kt
+++ b/src/test/kotlin/g0901_1000/s0948_bag_of_tokens/SolutionTest.kt
@@ -13,7 +13,8 @@ internal class SolutionTest {
     @Test
     fun bagOfTokensScore2() {
         assertThat(
-            Solution().bagOfTokensScore(intArrayOf(100, 200, 300, 400), 200), equalTo(2)
+            Solution().bagOfTokensScore(intArrayOf(100, 200, 300, 400), 200),
+            equalTo(2),
         )
     }
 }
diff --git a/src/test/kotlin/g0901_1000/s0950_reveal_cards_in_increasing_order/SolutionTest.kt b/src/test/kotlin/g0901_1000/s0950_reveal_cards_in_increasing_order/SolutionTest.kt
index 99d160b19..7bb497d76 100644
--- a/src/test/kotlin/g0901_1000/s0950_reveal_cards_in_increasing_order/SolutionTest.kt
+++ b/src/test/kotlin/g0901_1000/s0950_reveal_cards_in_increasing_order/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun deckRevealedIncreasing() {
         assertThat(
             Solution().deckRevealedIncreasing(intArrayOf(17, 13, 11, 2, 3, 5, 7)),
-            equalTo(intArrayOf(2, 13, 3, 11, 5, 17, 7))
+            equalTo(intArrayOf(2, 13, 3, 11, 5, 17, 7)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun deckRevealedIncreasing2() {
         assertThat(
             Solution().deckRevealedIncreasing(intArrayOf(1, 1000)),
-            equalTo(intArrayOf(1, 1000))
+            equalTo(intArrayOf(1, 1000)),
         )
     }
 }
diff --git a/src/test/kotlin/g0901_1000/s0951_flip_equivalent_binary_trees/SolutionTest.kt b/src/test/kotlin/g0901_1000/s0951_flip_equivalent_binary_trees/SolutionTest.kt
index 3d078f817..dd47f06fc 100644
--- a/src/test/kotlin/g0901_1000/s0951_flip_equivalent_binary_trees/SolutionTest.kt
+++ b/src/test/kotlin/g0901_1000/s0951_flip_equivalent_binary_trees/SolutionTest.kt
@@ -9,10 +9,10 @@ internal class SolutionTest {
     @Test
     fun flipEquiv() {
         val root1: TreeNode? = TreeNode.create(
-            listOf(1, 2, 3, 4, 5, 6, null, null, null, 7, 8)
+            listOf(1, 2, 3, 4, 5, 6, null, null, null, 7, 8),
         )
         val root2: TreeNode? = TreeNode.create(
-            listOf(1, 3, 2, null, 6, 4, 5, null, null, null, null, 8, 7)
+            listOf(1, 3, 2, null, 6, 4, 5, null, null, null, null, 8, 7),
         )
         assertThat(Solution().flipEquiv(root1, root2), equalTo(true))
     }
diff --git a/src/test/kotlin/g0901_1000/s0952_largest_component_size_by_common_factor/SolutionTest.kt b/src/test/kotlin/g0901_1000/s0952_largest_component_size_by_common_factor/SolutionTest.kt
index 554fd9d72..cb0155676 100644
--- a/src/test/kotlin/g0901_1000/s0952_largest_component_size_by_common_factor/SolutionTest.kt
+++ b/src/test/kotlin/g0901_1000/s0952_largest_component_size_by_common_factor/SolutionTest.kt
@@ -19,7 +19,7 @@ internal class SolutionTest {
     fun largestComponentSize3() {
         assertThat(
             Solution().largestComponentSize(intArrayOf(2, 3, 6, 7, 4, 12, 21, 39)),
-            equalTo(8)
+            equalTo(8),
         )
     }
 }
diff --git a/src/test/kotlin/g0901_1000/s0953_verifying_an_alien_dictionary/SolutionTest.kt b/src/test/kotlin/g0901_1000/s0953_verifying_an_alien_dictionary/SolutionTest.kt
index f3b9756e2..f9b5ce577 100644
--- a/src/test/kotlin/g0901_1000/s0953_verifying_an_alien_dictionary/SolutionTest.kt
+++ b/src/test/kotlin/g0901_1000/s0953_verifying_an_alien_dictionary/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .isAlienSorted(arrayOf("hello", "leetcode"), "hlabcdefgijkmnopqrstuvwxyz"),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
@@ -20,9 +20,9 @@ internal class SolutionTest {
             Solution()
                 .isAlienSorted(
                     arrayOf("word", "world", "row"),
-                    "worldabcefghijkmnpqstuvxyz"
+                    "worldabcefghijkmnpqstuvxyz",
                 ),
-            equalTo(false)
+            equalTo(false),
         )
     }
 
@@ -31,7 +31,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .isAlienSorted(arrayOf("apple", "app"), "abcdefghijklmnopqrstuvwxyz"),
-            equalTo(false)
+            equalTo(false),
         )
     }
 }
diff --git a/src/test/kotlin/g0901_1000/s0957_prison_cells_after_n_days/SolutionTest.kt b/src/test/kotlin/g0901_1000/s0957_prison_cells_after_n_days/SolutionTest.kt
index 2ef83bdd7..096256952 100644
--- a/src/test/kotlin/g0901_1000/s0957_prison_cells_after_n_days/SolutionTest.kt
+++ b/src/test/kotlin/g0901_1000/s0957_prison_cells_after_n_days/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun prisonAfterNDays() {
         assertThat(
             Solution().prisonAfterNDays(intArrayOf(0, 1, 0, 1, 1, 0, 0, 1), 7),
-            equalTo(intArrayOf(0, 0, 1, 1, 0, 0, 0, 0))
+            equalTo(intArrayOf(0, 0, 1, 1, 0, 0, 0, 0)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun prisonAfterNDays2() {
         assertThat(
             Solution().prisonAfterNDays(intArrayOf(1, 0, 0, 1, 0, 0, 1, 0), 1000000000),
-            equalTo(intArrayOf(0, 0, 1, 1, 1, 1, 1, 0))
+            equalTo(intArrayOf(0, 0, 1, 1, 1, 1, 1, 0)),
         )
     }
 }
diff --git a/src/test/kotlin/g0901_1000/s0958_check_completeness_of_a_binary_tree/SolutionTest.kt b/src/test/kotlin/g0901_1000/s0958_check_completeness_of_a_binary_tree/SolutionTest.kt
index 375d40252..6bcb8d9fa 100644
--- a/src/test/kotlin/g0901_1000/s0958_check_completeness_of_a_binary_tree/SolutionTest.kt
+++ b/src/test/kotlin/g0901_1000/s0958_check_completeness_of_a_binary_tree/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
     fun isCompleteTree() {
         assertThat(
             Solution().isCompleteTree(TreeNode.create(listOf(1, 2, 3, 4, 5, 6))),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
@@ -19,7 +19,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .isCompleteTree(TreeNode.create(listOf(1, 2, 3, 4, 5, null, 7))),
-            equalTo(false)
+            equalTo(false),
         )
     }
 }
diff --git a/src/test/kotlin/g0901_1000/s0962_maximum_width_ramp/SolutionTest.kt b/src/test/kotlin/g0901_1000/s0962_maximum_width_ramp/SolutionTest.kt
index a38833a9b..1d97589ae 100644
--- a/src/test/kotlin/g0901_1000/s0962_maximum_width_ramp/SolutionTest.kt
+++ b/src/test/kotlin/g0901_1000/s0962_maximum_width_ramp/SolutionTest.kt
@@ -13,7 +13,8 @@ internal class SolutionTest {
     @Test
     fun maxWidthRamp2() {
         assertThat(
-            Solution().maxWidthRamp(intArrayOf(9, 8, 1, 0, 1, 9, 4, 0, 4, 1)), equalTo(7)
+            Solution().maxWidthRamp(intArrayOf(9, 8, 1, 0, 1, 9, 4, 0, 4, 1)),
+            equalTo(7),
         )
     }
 }
diff --git a/src/test/kotlin/g0901_1000/s0963_minimum_area_rectangle_ii/SolutionTest.kt b/src/test/kotlin/g0901_1000/s0963_minimum_area_rectangle_ii/SolutionTest.kt
index 7b02a3f04..4795ca292 100644
--- a/src/test/kotlin/g0901_1000/s0963_minimum_area_rectangle_ii/SolutionTest.kt
+++ b/src/test/kotlin/g0901_1000/s0963_minimum_area_rectangle_ii/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun minAreaFreeRect() {
         assertThat(
             Solution().minAreaFreeRect(arrayOf(intArrayOf(1, 2), intArrayOf(2, 1), intArrayOf(1, 0), intArrayOf(0, 1))),
-            equalTo(2.0)
+            equalTo(2.0),
         )
     }
 
@@ -23,10 +23,10 @@ internal class SolutionTest {
                         intArrayOf(2, 1),
                         intArrayOf(1, 1),
                         intArrayOf(1, 0),
-                        intArrayOf(2, 0)
-                    )
+                        intArrayOf(2, 0),
+                    ),
                 ),
-            equalTo(1.0)
+            equalTo(1.0),
         )
     }
 
@@ -40,10 +40,10 @@ internal class SolutionTest {
                         intArrayOf(1, 2),
                         intArrayOf(3, 1),
                         intArrayOf(1, 3),
-                        intArrayOf(2, 1)
-                    )
+                        intArrayOf(2, 1),
+                    ),
                 ),
-            equalTo(0.0)
+            equalTo(0.0),
         )
     }
 }
diff --git a/src/test/kotlin/g0901_1000/s0965_univalued_binary_tree/SolutionTest.kt b/src/test/kotlin/g0901_1000/s0965_univalued_binary_tree/SolutionTest.kt
index 45cdcecea..c2e454715 100644
--- a/src/test/kotlin/g0901_1000/s0965_univalued_binary_tree/SolutionTest.kt
+++ b/src/test/kotlin/g0901_1000/s0965_univalued_binary_tree/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
     fun isUnivalTree() {
         assertThat(
             Solution().isUnivalTree(TreeNode.create(listOf(1, 1, 1, 1, 1, null, 1))),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
@@ -18,7 +18,7 @@ internal class SolutionTest {
     fun isUnivalTree2() {
         assertThat(
             Solution().isUnivalTree(TreeNode.create(listOf(2, 2, 2, 5, 2))),
-            equalTo(false)
+            equalTo(false),
         )
     }
 }
diff --git a/src/test/kotlin/g0901_1000/s0966_vowel_spellchecker/SolutionTest.kt b/src/test/kotlin/g0901_1000/s0966_vowel_spellchecker/SolutionTest.kt
index 8ddbcec80..52b7e5da3 100644
--- a/src/test/kotlin/g0901_1000/s0966_vowel_spellchecker/SolutionTest.kt
+++ b/src/test/kotlin/g0901_1000/s0966_vowel_spellchecker/SolutionTest.kt
@@ -13,14 +13,14 @@ internal class SolutionTest {
                     arrayOf("KiTe", "kite", "hare", "Hare"),
                     arrayOf(
                         "kite", "Kite", "KiTe", "Hare", "HARE", "Hear", "hear", "keti",
-                        "keet", "keto"
-                    )
+                        "keet", "keto",
+                    ),
                 ),
             equalTo(
                 arrayOf(
-                    "kite", "KiTe", "KiTe", "Hare", "hare", "", "", "KiTe", "", "KiTe"
-                )
-            )
+                    "kite", "KiTe", "KiTe", "Hare", "hare", "", "", "KiTe", "", "KiTe",
+                ),
+            ),
         )
     }
 
@@ -28,7 +28,7 @@ internal class SolutionTest {
     fun spellchecker2() {
         assertThat(
             Solution().spellchecker(arrayOf("yellow"), arrayOf("YellOw")),
-            equalTo(arrayOf("yellow"))
+            equalTo(arrayOf("yellow")),
         )
     }
 }
diff --git a/src/test/kotlin/g0901_1000/s0967_numbers_with_same_consecutive_differences/SolutionTest.kt b/src/test/kotlin/g0901_1000/s0967_numbers_with_same_consecutive_differences/SolutionTest.kt
index 62a5c0df5..e299a0a4a 100644
--- a/src/test/kotlin/g0901_1000/s0967_numbers_with_same_consecutive_differences/SolutionTest.kt
+++ b/src/test/kotlin/g0901_1000/s0967_numbers_with_same_consecutive_differences/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun numsSameConsecDiff() {
         assertThat(
             Solution().numsSameConsecDiff(3, 7),
-            equalTo(intArrayOf(181, 292, 707, 818, 929))
+            equalTo(intArrayOf(181, 292, 707, 818, 929)),
         )
     }
 
@@ -19,9 +19,9 @@ internal class SolutionTest {
             Solution().numsSameConsecDiff(2, 1),
             equalTo(
                 intArrayOf(
-                    10, 12, 21, 23, 32, 34, 43, 45, 54, 56, 65, 67, 76, 78, 87, 89, 98
-                )
-            )
+                    10, 12, 21, 23, 32, 34, 43, 45, 54, 56, 65, 67, 76, 78, 87, 89, 98,
+                ),
+            ),
         )
     }
 }
diff --git a/src/test/kotlin/g0901_1000/s0968_binary_tree_cameras/SolutionTest.kt b/src/test/kotlin/g0901_1000/s0968_binary_tree_cameras/SolutionTest.kt
index 4825d2764..da5b723d9 100644
--- a/src/test/kotlin/g0901_1000/s0968_binary_tree_cameras/SolutionTest.kt
+++ b/src/test/kotlin/g0901_1000/s0968_binary_tree_cameras/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
     fun minCameraCover() {
         assertThat(
             Solution().minCameraCover(TreeNode.create(listOf(0, 0, null, 0, 0))),
-            equalTo(1)
+            equalTo(1),
         )
     }
 
@@ -20,10 +20,10 @@ internal class SolutionTest {
             Solution()
                 .minCameraCover(
                     TreeNode.create(
-                        listOf(0, 0, null, 0, null, 0, null, null, 0)
-                    )
+                        listOf(0, 0, null, 0, null, 0, null, null, 0),
+                    ),
                 ),
-            equalTo(2)
+            equalTo(2),
         )
     }
 }
diff --git a/src/test/kotlin/g0901_1000/s0969_pancake_sorting/SolutionTest.kt b/src/test/kotlin/g0901_1000/s0969_pancake_sorting/SolutionTest.kt
index 95e0050bf..88767d8a8 100644
--- a/src/test/kotlin/g0901_1000/s0969_pancake_sorting/SolutionTest.kt
+++ b/src/test/kotlin/g0901_1000/s0969_pancake_sorting/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun pancakeSort() {
         assertThat(
             Solution().pancakeSort(intArrayOf(3, 2, 4, 1)),
-            equalTo(listOf(3, 4, 2, 3, 1, 2, 1, 1))
+            equalTo(listOf(3, 4, 2, 3, 1, 2, 1, 1)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun pancakeSort2() {
         assertThat(
             Solution().pancakeSort(intArrayOf(1, 2, 3)),
-            equalTo(listOf(3, 3, 2, 2, 1, 1))
+            equalTo(listOf(3, 3, 2, 2, 1, 1)),
         )
     }
 }
diff --git a/src/test/kotlin/g0901_1000/s0970_powerful_integers/SolutionTest.kt b/src/test/kotlin/g0901_1000/s0970_powerful_integers/SolutionTest.kt
index 5596bf4c9..4a83f5e9e 100644
--- a/src/test/kotlin/g0901_1000/s0970_powerful_integers/SolutionTest.kt
+++ b/src/test/kotlin/g0901_1000/s0970_powerful_integers/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun powerfulIntegers() {
         assertThat(
             Solution().powerfulIntegers(2, 3, 10),
-            equalTo(listOf(2, 3, 4, 5, 7, 9, 10))
+            equalTo(listOf(2, 3, 4, 5, 7, 9, 10)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun powerfulIntegers2() {
         assertThat(
             Solution().powerfulIntegers(3, 5, 15),
-            equalTo(listOf(2, 4, 6, 8, 10, 14))
+            equalTo(listOf(2, 4, 6, 8, 10, 14)),
         )
     }
 }
diff --git a/src/test/kotlin/g0901_1000/s0971_flip_binary_tree_to_match_preorder_traversal/SolutionTest.kt b/src/test/kotlin/g0901_1000/s0971_flip_binary_tree_to_match_preorder_traversal/SolutionTest.kt
index 2c724664c..1808f1a4f 100644
--- a/src/test/kotlin/g0901_1000/s0971_flip_binary_tree_to_match_preorder_traversal/SolutionTest.kt
+++ b/src/test/kotlin/g0901_1000/s0971_flip_binary_tree_to_match_preorder_traversal/SolutionTest.kt
@@ -11,7 +11,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .flipMatchVoyage(TreeNode.create(listOf(1, 2)), intArrayOf(2, 1)),
-            equalTo(listOf(-1))
+            equalTo(listOf(-1)),
         )
     }
 
@@ -20,9 +20,10 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .flipMatchVoyage(
-                    TreeNode.create(listOf(1, 2, 3)), intArrayOf(1, 3, 2)
+                    TreeNode.create(listOf(1, 2, 3)),
+                    intArrayOf(1, 3, 2),
                 ),
-            equalTo(listOf(1))
+            equalTo(listOf(1)),
         )
     }
 
@@ -31,9 +32,10 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .flipMatchVoyage(
-                    TreeNode.create(listOf(1, 2, 3)), intArrayOf(1, 2, 3)
+                    TreeNode.create(listOf(1, 2, 3)),
+                    intArrayOf(1, 2, 3),
                 ),
-            equalTo(emptyList())
+            equalTo(emptyList()),
         )
     }
 }
diff --git a/src/test/kotlin/g0901_1000/s0973_k_closest_points_to_origin/SolutionTest.kt b/src/test/kotlin/g0901_1000/s0973_k_closest_points_to_origin/SolutionTest.kt
index 62deaefdf..dd234453d 100644
--- a/src/test/kotlin/g0901_1000/s0973_k_closest_points_to_origin/SolutionTest.kt
+++ b/src/test/kotlin/g0901_1000/s0973_k_closest_points_to_origin/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun kClosest() {
         assertThat(
             Solution().kClosest(arrayOf(intArrayOf(1, 3), intArrayOf(-2, 2)), 1),
-            equalTo(arrayOf(intArrayOf(-2, 2)))
+            equalTo(arrayOf(intArrayOf(-2, 2))),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun kClosest2() {
         assertThat(
             Solution().kClosest(arrayOf(intArrayOf(3, 3), intArrayOf(5, -1), intArrayOf(-2, 4)), 2),
-            equalTo(arrayOf(intArrayOf(3, 3), intArrayOf(-2, 4)))
+            equalTo(arrayOf(intArrayOf(3, 3), intArrayOf(-2, 4))),
         )
     }
 }
diff --git a/src/test/kotlin/g0901_1000/s0977_squares_of_a_sorted_array/SolutionTest.kt b/src/test/kotlin/g0901_1000/s0977_squares_of_a_sorted_array/SolutionTest.kt
index 25d5b4604..de3ceb67c 100644
--- a/src/test/kotlin/g0901_1000/s0977_squares_of_a_sorted_array/SolutionTest.kt
+++ b/src/test/kotlin/g0901_1000/s0977_squares_of_a_sorted_array/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun sortedSquares() {
         assertThat(
             Solution().sortedSquares(intArrayOf(-4, -1, 0, 3, 10)),
-            equalTo(intArrayOf(0, 1, 9, 16, 100))
+            equalTo(intArrayOf(0, 1, 9, 16, 100)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun sortedSquares2() {
         assertThat(
             Solution().sortedSquares(intArrayOf(-7, -3, 2, 3, 11)),
-            equalTo(intArrayOf(4, 9, 9, 49, 121))
+            equalTo(intArrayOf(4, 9, 9, 49, 121)),
         )
     }
 }
diff --git a/src/test/kotlin/g0901_1000/s0978_longest_turbulent_subarray/SolutionTest.kt b/src/test/kotlin/g0901_1000/s0978_longest_turbulent_subarray/SolutionTest.kt
index 7b3478f29..9815dee99 100644
--- a/src/test/kotlin/g0901_1000/s0978_longest_turbulent_subarray/SolutionTest.kt
+++ b/src/test/kotlin/g0901_1000/s0978_longest_turbulent_subarray/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun maxTurbulenceSize() {
         assertThat(
             Solution().maxTurbulenceSize(intArrayOf(9, 4, 2, 10, 7, 8, 8, 1, 9)),
-            equalTo(5)
+            equalTo(5),
         )
     }
 
diff --git a/src/test/kotlin/g0901_1000/s0979_distribute_coins_in_binary_tree/SolutionTest.kt b/src/test/kotlin/g0901_1000/s0979_distribute_coins_in_binary_tree/SolutionTest.kt
index 3dda5e0fb..1677307cd 100644
--- a/src/test/kotlin/g0901_1000/s0979_distribute_coins_in_binary_tree/SolutionTest.kt
+++ b/src/test/kotlin/g0901_1000/s0979_distribute_coins_in_binary_tree/SolutionTest.kt
@@ -11,7 +11,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .distributeCoins(TreeNode.create(listOf(3, 0, 0))),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -20,7 +20,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .distributeCoins(TreeNode.create(listOf(0, 3, 0))),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
@@ -29,9 +29,9 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .distributeCoins(
-                    TreeNode.create(listOf(1, 0, 0, null, 3))
+                    TreeNode.create(listOf(1, 0, 0, null, 3)),
                 ),
-            equalTo(4)
+            equalTo(4),
         )
     }
 }
diff --git a/src/test/kotlin/g0901_1000/s0980_unique_paths_iii/SolutionTest.kt b/src/test/kotlin/g0901_1000/s0980_unique_paths_iii/SolutionTest.kt
index 7f32f4c43..6626d7a20 100644
--- a/src/test/kotlin/g0901_1000/s0980_unique_paths_iii/SolutionTest.kt
+++ b/src/test/kotlin/g0901_1000/s0980_unique_paths_iii/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .uniquePathsIII(arrayOf(intArrayOf(1, 0, 0, 0), intArrayOf(0, 0, 0, 0), intArrayOf(0, 0, 2, -1))),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -19,7 +19,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .uniquePathsIII(arrayOf(intArrayOf(1, 0, 0, 0), intArrayOf(0, 0, 0, 0), intArrayOf(0, 0, 0, 2))),
-            equalTo(4)
+            equalTo(4),
         )
     }
 
diff --git a/src/test/kotlin/g0901_1000/s0983_minimum_cost_for_tickets/SolutionTest.kt b/src/test/kotlin/g0901_1000/s0983_minimum_cost_for_tickets/SolutionTest.kt
index 586e7db0b..be3653ad5 100644
--- a/src/test/kotlin/g0901_1000/s0983_minimum_cost_for_tickets/SolutionTest.kt
+++ b/src/test/kotlin/g0901_1000/s0983_minimum_cost_for_tickets/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun mincostTickets() {
         assertThat(
             Solution().mincostTickets(intArrayOf(1, 4, 6, 7, 8, 20), intArrayOf(2, 7, 15)),
-            equalTo(11)
+            equalTo(11),
         )
     }
 
@@ -18,7 +18,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .mincostTickets(intArrayOf(1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 30, 31), intArrayOf(2, 7, 15)),
-            equalTo(17)
+            equalTo(17),
         )
     }
 }
diff --git a/src/test/kotlin/g0901_1000/s0985_sum_of_even_numbers_after_queries/SolutionTest.kt b/src/test/kotlin/g0901_1000/s0985_sum_of_even_numbers_after_queries/SolutionTest.kt
index 963c7153e..7a240aeef 100644
--- a/src/test/kotlin/g0901_1000/s0985_sum_of_even_numbers_after_queries/SolutionTest.kt
+++ b/src/test/kotlin/g0901_1000/s0985_sum_of_even_numbers_after_queries/SolutionTest.kt
@@ -11,9 +11,9 @@ internal class SolutionTest {
             Solution()
                 .sumEvenAfterQueries(
                     intArrayOf(1, 2, 3, 4),
-                    arrayOf(intArrayOf(1, 0), intArrayOf(-3, 1), intArrayOf(-4, 0), intArrayOf(2, 3))
+                    arrayOf(intArrayOf(1, 0), intArrayOf(-3, 1), intArrayOf(-4, 0), intArrayOf(2, 3)),
                 ),
-            equalTo(intArrayOf(8, 6, 2, 4))
+            equalTo(intArrayOf(8, 6, 2, 4)),
         )
     }
 
@@ -21,7 +21,7 @@ internal class SolutionTest {
     fun sumEvenAfterQueries2() {
         assertThat(
             Solution().sumEvenAfterQueries(intArrayOf(1), arrayOf(intArrayOf(4, 0))),
-            equalTo(intArrayOf(0))
+            equalTo(intArrayOf(0)),
         )
     }
 }
diff --git a/src/test/kotlin/g0901_1000/s0986_interval_list_intersections/SolutionTest.kt b/src/test/kotlin/g0901_1000/s0986_interval_list_intersections/SolutionTest.kt
index 9332e604b..803db5bd9 100644
--- a/src/test/kotlin/g0901_1000/s0986_interval_list_intersections/SolutionTest.kt
+++ b/src/test/kotlin/g0901_1000/s0986_interval_list_intersections/SolutionTest.kt
@@ -14,9 +14,9 @@ internal class SolutionTest {
                         intArrayOf(0, 2),
                         intArrayOf(5, 10),
                         intArrayOf(13, 23),
-                        intArrayOf(24, 25)
+                        intArrayOf(24, 25),
                     ),
-                    arrayOf(intArrayOf(1, 5), intArrayOf(8, 12), intArrayOf(15, 24), intArrayOf(25, 26))
+                    arrayOf(intArrayOf(1, 5), intArrayOf(8, 12), intArrayOf(15, 24), intArrayOf(25, 26)),
                 ),
             equalTo(
                 arrayOf(
@@ -25,9 +25,9 @@ internal class SolutionTest {
                     intArrayOf(8, 10),
                     intArrayOf(15, 23),
                     intArrayOf(24, 24),
-                    intArrayOf(25, 25)
-                )
-            )
+                    intArrayOf(25, 25),
+                ),
+            ),
         )
     }
 
@@ -35,7 +35,7 @@ internal class SolutionTest {
     fun intervalIntersection2() {
         assertThat(
             Solution().intervalIntersection(arrayOf(intArrayOf(1, 3), intArrayOf(5, 9)), arrayOf()),
-            equalTo(arrayOf())
+            equalTo(arrayOf()),
         )
     }
 }
diff --git a/src/test/kotlin/g0901_1000/s0987_vertical_order_traversal_of_a_binary_tree/SolutionTest.kt b/src/test/kotlin/g0901_1000/s0987_vertical_order_traversal_of_a_binary_tree/SolutionTest.kt
index 4a02c5360..7ae891a2c 100644
--- a/src/test/kotlin/g0901_1000/s0987_vertical_order_traversal_of_a_binary_tree/SolutionTest.kt
+++ b/src/test/kotlin/g0901_1000/s0987_vertical_order_traversal_of_a_binary_tree/SolutionTest.kt
@@ -13,10 +13,10 @@ internal class SolutionTest {
             Solution()
                 .verticalTraversal(
                     TreeNode.create(
-                        listOf(3, 9, 20, null, null, 15, 7)
-                    )
+                        listOf(3, 9, 20, null, null, 15, 7),
+                    ),
                 ),
-            equalTo(ArrayUtils.getLists(arrayOf(intArrayOf(9), intArrayOf(3, 15), intArrayOf(20), intArrayOf(7))))
+            equalTo(ArrayUtils.getLists(arrayOf(intArrayOf(9), intArrayOf(3, 15), intArrayOf(20), intArrayOf(7)))),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .verticalTraversal(
-                    TreeNode.create(listOf(1, 2, 3, 4, 5, 6, 7))
+                    TreeNode.create(listOf(1, 2, 3, 4, 5, 6, 7)),
                 ),
             equalTo(
                 ArrayUtils.getLists(
@@ -34,10 +34,10 @@ internal class SolutionTest {
                         intArrayOf(2),
                         intArrayOf(1, 5, 6),
                         intArrayOf(3),
-                        intArrayOf(7)
-                    )
-                )
-            )
+                        intArrayOf(7),
+                    ),
+                ),
+            ),
         )
     }
 }
diff --git a/src/test/kotlin/g0901_1000/s0988_smallest_string_starting_from_leaf/SolutionTest.kt b/src/test/kotlin/g0901_1000/s0988_smallest_string_starting_from_leaf/SolutionTest.kt
index c6812f9b0..7ed710c05 100644
--- a/src/test/kotlin/g0901_1000/s0988_smallest_string_starting_from_leaf/SolutionTest.kt
+++ b/src/test/kotlin/g0901_1000/s0988_smallest_string_starting_from_leaf/SolutionTest.kt
@@ -11,9 +11,9 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .smallestFromLeaf(
-                    TreeNode.create(listOf(0, 1, 2, 3, 4, 3, 4))
+                    TreeNode.create(listOf(0, 1, 2, 3, 4, 3, 4)),
                 ),
-            equalTo("dba")
+            equalTo("dba"),
         )
     }
 
@@ -22,9 +22,9 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .smallestFromLeaf(
-                    TreeNode.create(listOf(25, 1, 3, 1, 3, 0, 2))
+                    TreeNode.create(listOf(25, 1, 3, 1, 3, 0, 2)),
                 ),
-            equalTo("adz")
+            equalTo("adz"),
         )
     }
 
@@ -34,10 +34,10 @@ internal class SolutionTest {
             Solution()
                 .smallestFromLeaf(
                     TreeNode.create(
-                        listOf(2, 2, 1, null, 1, 0, null, 0)
-                    )
+                        listOf(2, 2, 1, null, 1, 0, null, 0),
+                    ),
                 ),
-            equalTo("abc")
+            equalTo("abc"),
         )
     }
 }
diff --git a/src/test/kotlin/g0901_1000/s0989_add_to_array_form_of_integer/SolutionTest.kt b/src/test/kotlin/g0901_1000/s0989_add_to_array_form_of_integer/SolutionTest.kt
index baaf5800a..764d51c6e 100644
--- a/src/test/kotlin/g0901_1000/s0989_add_to_array_form_of_integer/SolutionTest.kt
+++ b/src/test/kotlin/g0901_1000/s0989_add_to_array_form_of_integer/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun addToArrayForm() {
         assertThat(
             Solution().addToArrayForm(intArrayOf(1, 2, 0, 0), 34),
-            equalTo(listOf(1, 2, 3, 4))
+            equalTo(listOf(1, 2, 3, 4)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun addToArrayForm2() {
         assertThat(
             Solution().addToArrayForm(intArrayOf(2, 7, 4), 181),
-            equalTo(listOf(4, 5, 5))
+            equalTo(listOf(4, 5, 5)),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun addToArrayForm3() {
         assertThat(
             Solution().addToArrayForm(intArrayOf(2, 1, 5), 806),
-            equalTo(listOf(1, 0, 2, 1))
+            equalTo(listOf(1, 0, 2, 1)),
         )
     }
 }
diff --git a/src/test/kotlin/g0901_1000/s0993_cousins_in_binary_tree/SolutionTest.kt b/src/test/kotlin/g0901_1000/s0993_cousins_in_binary_tree/SolutionTest.kt
index 4c85508be..093a82ae4 100644
--- a/src/test/kotlin/g0901_1000/s0993_cousins_in_binary_tree/SolutionTest.kt
+++ b/src/test/kotlin/g0901_1000/s0993_cousins_in_binary_tree/SolutionTest.kt
@@ -11,7 +11,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .isCousins(TreeNode.create(listOf(1, 2, 3, 4)), 4, 3),
-            equalTo(false)
+            equalTo(false),
         )
     }
 
@@ -21,12 +21,12 @@ internal class SolutionTest {
             Solution()
                 .isCousins(
                     TreeNode.create(
-                        listOf(1, 2, 3, null, 4, null, 5)
+                        listOf(1, 2, 3, null, 4, null, 5),
                     ),
                     5,
-                    4
+                    4,
                 ),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
@@ -37,9 +37,9 @@ internal class SolutionTest {
                 .isCousins(
                     TreeNode.create(listOf(1, 2, 3, null, 4)),
                     2,
-                    3
+                    3,
                 ),
-            equalTo(false)
+            equalTo(false),
         )
     }
 }
diff --git a/src/test/kotlin/g0901_1000/s0994_rotting_oranges/SolutionTest.kt b/src/test/kotlin/g0901_1000/s0994_rotting_oranges/SolutionTest.kt
index 96a619e97..9b6cf78a1 100644
--- a/src/test/kotlin/g0901_1000/s0994_rotting_oranges/SolutionTest.kt
+++ b/src/test/kotlin/g0901_1000/s0994_rotting_oranges/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun orangesRotting() {
         assertThat(
             Solution().orangesRotting(arrayOf(intArrayOf(2, 1, 1), intArrayOf(1, 1, 0), intArrayOf(0, 1, 1))),
-            equalTo(4)
+            equalTo(4),
         )
     }
 
diff --git a/src/test/kotlin/g0901_1000/s0998_maximum_binary_tree_ii/SolutionTest.kt b/src/test/kotlin/g0901_1000/s0998_maximum_binary_tree_ii/SolutionTest.kt
index 682328bac..b23bfb311 100644
--- a/src/test/kotlin/g0901_1000/s0998_maximum_binary_tree_ii/SolutionTest.kt
+++ b/src/test/kotlin/g0901_1000/s0998_maximum_binary_tree_ii/SolutionTest.kt
@@ -12,12 +12,12 @@ internal class SolutionTest {
             Solution()
                 .insertIntoMaxTree(
                     TreeNode.create(
-                        listOf(4, 1, 3, null, null, 2)
+                        listOf(4, 1, 3, null, null, 2),
                     ),
-                    5
+                    5,
                 )
                 .toString(),
-            equalTo("5,4,1,3,2,null,null")
+            equalTo("5,4,1,3,2,null,null"),
         )
     }
 
@@ -26,10 +26,11 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .insertIntoMaxTree(
-                    TreeNode.create(listOf(5, 2, 4, null, 1)), 3
+                    TreeNode.create(listOf(5, 2, 4, null, 1)),
+                    3,
                 )
                 .toString(),
-            equalTo("5,2,null,1,4,null,3")
+            equalTo("5,2,null,1,4,null,3"),
         )
     }
 
@@ -38,10 +39,11 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .insertIntoMaxTree(
-                    TreeNode.create(listOf(5, 2, 3, null, 1)), 4
+                    TreeNode.create(listOf(5, 2, 3, null, 1)),
+                    4,
                 )
                 .toString(),
-            equalTo("5,2,null,1,4,3,null")
+            equalTo("5,2,null,1,4,3,null"),
         )
     }
 }
diff --git a/src/test/kotlin/g0901_1000/s0999_available_captures_for_rook/SolutionTest.kt b/src/test/kotlin/g0901_1000/s0999_available_captures_for_rook/SolutionTest.kt
index 39589db3b..11b8a256a 100644
--- a/src/test/kotlin/g0901_1000/s0999_available_captures_for_rook/SolutionTest.kt
+++ b/src/test/kotlin/g0901_1000/s0999_available_captures_for_rook/SolutionTest.kt
@@ -18,10 +18,10 @@ internal class SolutionTest {
                         charArrayOf('.', '.', '.', '.', '.', '.', '.', '.'),
                         charArrayOf('.', '.', '.', 'p', '.', '.', '.', '.'),
                         charArrayOf('.', '.', '.', '.', '.', '.', '.', '.'),
-                        charArrayOf('.', '.', '.', '.', '.', '.', '.', '.')
-                    )
+                        charArrayOf('.', '.', '.', '.', '.', '.', '.', '.'),
+                    ),
                 ),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
@@ -38,10 +38,10 @@ internal class SolutionTest {
                         charArrayOf('.', 'p', 'p', 'B', 'p', 'p', '.', '.'),
                         charArrayOf('.', 'p', 'p', 'p', 'p', 'p', '.', '.'),
                         charArrayOf('.', '.', '.', '.', '.', '.', '.', '.'),
-                        charArrayOf('.', '.', '.', '.', '.', '.', '.', '.')
-                    )
+                        charArrayOf('.', '.', '.', '.', '.', '.', '.', '.'),
+                    ),
                 ),
-            equalTo(0)
+            equalTo(0),
         )
     }
 
@@ -58,10 +58,10 @@ internal class SolutionTest {
                         charArrayOf('.', '.', '.', '.', '.', '.', '.', '.'),
                         charArrayOf('.', '.', '.', 'B', '.', '.', '.', '.'),
                         charArrayOf('.', '.', '.', 'p', '.', '.', '.', '.'),
-                        charArrayOf('.', '.', '.', '.', '.', '.', '.', '.')
-                    )
+                        charArrayOf('.', '.', '.', '.', '.', '.', '.', '.'),
+                    ),
                 ),
-            equalTo(3)
+            equalTo(3),
         )
     }
 }
diff --git a/src/test/kotlin/g1001_1100/s1001_grid_illumination/SolutionTest.kt b/src/test/kotlin/g1001_1100/s1001_grid_illumination/SolutionTest.kt
index 330266de1..4053932bb 100644
--- a/src/test/kotlin/g1001_1100/s1001_grid_illumination/SolutionTest.kt
+++ b/src/test/kotlin/g1001_1100/s1001_grid_illumination/SolutionTest.kt
@@ -10,9 +10,11 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .gridIllumination(
-                    5, arrayOf(intArrayOf(0, 0), intArrayOf(4, 4)), arrayOf(intArrayOf(1, 1), intArrayOf(1, 0))
+                    5,
+                    arrayOf(intArrayOf(0, 0), intArrayOf(4, 4)),
+                    arrayOf(intArrayOf(1, 1), intArrayOf(1, 0)),
                 ),
-            equalTo(intArrayOf(1, 0))
+            equalTo(intArrayOf(1, 0)),
         )
     }
 
@@ -21,9 +23,11 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .gridIllumination(
-                    5, arrayOf(intArrayOf(0, 0), intArrayOf(4, 4)), arrayOf(intArrayOf(1, 1), intArrayOf(1, 1))
+                    5,
+                    arrayOf(intArrayOf(0, 0), intArrayOf(4, 4)),
+                    arrayOf(intArrayOf(1, 1), intArrayOf(1, 1)),
                 ),
-            equalTo(intArrayOf(1, 1))
+            equalTo(intArrayOf(1, 1)),
         )
     }
 
@@ -34,9 +38,9 @@ internal class SolutionTest {
                 .gridIllumination(
                     5,
                     arrayOf(intArrayOf(0, 0), intArrayOf(0, 4)),
-                    arrayOf(intArrayOf(0, 4), intArrayOf(0, 1), intArrayOf(1, 4))
+                    arrayOf(intArrayOf(0, 4), intArrayOf(0, 1), intArrayOf(1, 4)),
                 ),
-            equalTo(intArrayOf(1, 1, 0))
+            equalTo(intArrayOf(1, 1, 0)),
         )
     }
 }
diff --git a/src/test/kotlin/g1001_1100/s1002_find_common_characters/SolutionTest.kt b/src/test/kotlin/g1001_1100/s1002_find_common_characters/SolutionTest.kt
index e828356b5..a7f9547af 100644
--- a/src/test/kotlin/g1001_1100/s1002_find_common_characters/SolutionTest.kt
+++ b/src/test/kotlin/g1001_1100/s1002_find_common_characters/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun commonChars() {
         assertThat(
             Solution().commonChars(arrayOf("bella", "label", "roller")),
-            equalTo(listOf("e", "l", "l"))
+            equalTo(listOf("e", "l", "l")),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun commonChars2() {
         assertThat(
             Solution().commonChars(arrayOf("cool", "lock", "cook")),
-            equalTo(listOf("c", "o"))
+            equalTo(listOf("c", "o")),
         )
     }
 }
diff --git a/src/test/kotlin/g1001_1100/s1004_max_consecutive_ones_iii/SolutionTest.kt b/src/test/kotlin/g1001_1100/s1004_max_consecutive_ones_iii/SolutionTest.kt
index 69598ebdd..2c1ea221e 100644
--- a/src/test/kotlin/g1001_1100/s1004_max_consecutive_ones_iii/SolutionTest.kt
+++ b/src/test/kotlin/g1001_1100/s1004_max_consecutive_ones_iii/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun longestOnes() {
         assertThat(
             Solution().longestOnes(intArrayOf(1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0), 2),
-            equalTo(6)
+            equalTo(6),
         )
     }
 
@@ -19,9 +19,9 @@ internal class SolutionTest {
             Solution()
                 .longestOnes(
                     intArrayOf(0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1),
-                    3
+                    3,
                 ),
-            equalTo(10)
+            equalTo(10),
         )
     }
 }
diff --git a/src/test/kotlin/g1001_1100/s1005_maximize_sum_of_array_after_k_negations/SolutionTest.kt b/src/test/kotlin/g1001_1100/s1005_maximize_sum_of_array_after_k_negations/SolutionTest.kt
index c04a4b121..ed96086f7 100644
--- a/src/test/kotlin/g1001_1100/s1005_maximize_sum_of_array_after_k_negations/SolutionTest.kt
+++ b/src/test/kotlin/g1001_1100/s1005_maximize_sum_of_array_after_k_negations/SolutionTest.kt
@@ -13,7 +13,8 @@ internal class SolutionTest {
     @Test
     fun largestSumAfterKNegations2() {
         assertThat(
-            Solution().largestSumAfterKNegations(intArrayOf(3, -1, 0, 2), 3), equalTo(6)
+            Solution().largestSumAfterKNegations(intArrayOf(3, -1, 0, 2), 3),
+            equalTo(6),
         )
     }
 
@@ -21,7 +22,7 @@ internal class SolutionTest {
     fun largestSumAfterKNegations3() {
         assertThat(
             Solution().largestSumAfterKNegations(intArrayOf(2, -3, -1, 5, -4), 2),
-            equalTo(13)
+            equalTo(13),
         )
     }
 }
diff --git a/src/test/kotlin/g1001_1100/s1007_minimum_domino_rotations_for_equal_row/SolutionTest.kt b/src/test/kotlin/g1001_1100/s1007_minimum_domino_rotations_for_equal_row/SolutionTest.kt
index 8e686cfe2..cb7481c43 100644
--- a/src/test/kotlin/g1001_1100/s1007_minimum_domino_rotations_for_equal_row/SolutionTest.kt
+++ b/src/test/kotlin/g1001_1100/s1007_minimum_domino_rotations_for_equal_row/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .minDominoRotations(intArrayOf(2, 1, 2, 4, 2, 2), intArrayOf(5, 2, 6, 2, 3, 2)),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -19,7 +19,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .minDominoRotations(intArrayOf(3, 5, 1, 2, 3), intArrayOf(3, 6, 3, 3, 4)),
-            equalTo(-1)
+            equalTo(-1),
         )
     }
 }
diff --git a/src/test/kotlin/g1001_1100/s1008_construct_binary_search_tree_from_preorder_traversal/SolutionTest.kt b/src/test/kotlin/g1001_1100/s1008_construct_binary_search_tree_from_preorder_traversal/SolutionTest.kt
index 1c052225f..f3f202994 100644
--- a/src/test/kotlin/g1001_1100/s1008_construct_binary_search_tree_from_preorder_traversal/SolutionTest.kt
+++ b/src/test/kotlin/g1001_1100/s1008_construct_binary_search_tree_from_preorder_traversal/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
     fun bstFromPreorder() {
         assertThat(
             Solution().bstFromPreorder(intArrayOf(8, 5, 1, 7, 10, 12)).toString(),
-            equalTo(TreeNode.create(listOf(8, 5, 10, 1, 7, null, 12)).toString())
+            equalTo(TreeNode.create(listOf(8, 5, 10, 1, 7, null, 12)).toString()),
         )
     }
 
@@ -18,7 +18,7 @@ internal class SolutionTest {
     fun bstFromPreorder2() {
         assertThat(
             Solution().bstFromPreorder(intArrayOf(1, 3)).toString(),
-            equalTo(TreeNode.create(listOf(1, null, 3)).toString())
+            equalTo(TreeNode.create(listOf(1, null, 3)).toString()),
         )
     }
 }
diff --git a/src/test/kotlin/g1001_1100/s1010_pairs_of_songs_with_total_durations_divisible_by_60/SolutionTest.kt b/src/test/kotlin/g1001_1100/s1010_pairs_of_songs_with_total_durations_divisible_by_60/SolutionTest.kt
index 4cfef5fc5..94a6953a4 100644
--- a/src/test/kotlin/g1001_1100/s1010_pairs_of_songs_with_total_durations_divisible_by_60/SolutionTest.kt
+++ b/src/test/kotlin/g1001_1100/s1010_pairs_of_songs_with_total_durations_divisible_by_60/SolutionTest.kt
@@ -8,7 +8,8 @@ internal class SolutionTest {
     @Test
     fun numPairsDivisibleBy60() {
         assertThat(
-            Solution().numPairsDivisibleBy60(intArrayOf(30, 20, 150, 100, 40)), equalTo(3)
+            Solution().numPairsDivisibleBy60(intArrayOf(30, 20, 150, 100, 40)),
+            equalTo(3),
         )
     }
 
diff --git a/src/test/kotlin/g1001_1100/s1011_capacity_to_ship_packages_within_d_days/SolutionTest.kt b/src/test/kotlin/g1001_1100/s1011_capacity_to_ship_packages_within_d_days/SolutionTest.kt
index 8914ff6b7..fe020b595 100644
--- a/src/test/kotlin/g1001_1100/s1011_capacity_to_ship_packages_within_d_days/SolutionTest.kt
+++ b/src/test/kotlin/g1001_1100/s1011_capacity_to_ship_packages_within_d_days/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun shipWithinDays() {
         assertThat(
             Solution().shipWithinDays(intArrayOf(1, 2, 3, 4, 5, 6, 7, 8, 9, 10), 5),
-            equalTo(15)
+            equalTo(15),
         )
     }
 
diff --git a/src/test/kotlin/g1001_1100/s1013_partition_array_into_three_parts_with_equal_sum/SolutionTest.kt b/src/test/kotlin/g1001_1100/s1013_partition_array_into_three_parts_with_equal_sum/SolutionTest.kt
index f1fb91cf9..41ce3d73b 100644
--- a/src/test/kotlin/g1001_1100/s1013_partition_array_into_three_parts_with_equal_sum/SolutionTest.kt
+++ b/src/test/kotlin/g1001_1100/s1013_partition_array_into_three_parts_with_equal_sum/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun canThreePartsEqualSum() {
         assertThat(
             Solution().canThreePartsEqualSum(intArrayOf(0, 2, 1, -6, 6, -7, 9, 1, 2, 0, 1)),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun canThreePartsEqualSum2() {
         assertThat(
             Solution().canThreePartsEqualSum(intArrayOf(0, 2, 1, -6, 6, 7, 9, -1, 2, 0, 1)),
-            equalTo(false)
+            equalTo(false),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun canThreePartsEqualSum3() {
         assertThat(
             Solution().canThreePartsEqualSum(intArrayOf(3, 3, 6, 5, -2, 2, 5, 1, -9, 4)),
-            equalTo(true)
+            equalTo(true),
         )
     }
 }
diff --git a/src/test/kotlin/g1001_1100/s1018_binary_prefix_divisible_by_5/SolutionTest.kt b/src/test/kotlin/g1001_1100/s1018_binary_prefix_divisible_by_5/SolutionTest.kt
index 7cbe5639c..cc6327c2a 100644
--- a/src/test/kotlin/g1001_1100/s1018_binary_prefix_divisible_by_5/SolutionTest.kt
+++ b/src/test/kotlin/g1001_1100/s1018_binary_prefix_divisible_by_5/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun prefixesDivBy5() {
         assertThat(
             Solution().prefixesDivBy5(intArrayOf(0, 1, 1)),
-            equalTo(listOf(true, false, false))
+            equalTo(listOf(true, false, false)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun prefixesDivBy52() {
         assertThat(
             Solution().prefixesDivBy5(intArrayOf(1, 1, 1)),
-            equalTo(listOf(false, false, false))
+            equalTo(listOf(false, false, false)),
         )
     }
 }
diff --git a/src/test/kotlin/g1001_1100/s1020_number_of_enclaves/SolutionTest.kt b/src/test/kotlin/g1001_1100/s1020_number_of_enclaves/SolutionTest.kt
index e7c8ab29a..4dc271c5c 100644
--- a/src/test/kotlin/g1001_1100/s1020_number_of_enclaves/SolutionTest.kt
+++ b/src/test/kotlin/g1001_1100/s1020_number_of_enclaves/SolutionTest.kt
@@ -14,10 +14,10 @@ internal class SolutionTest {
                         intArrayOf(0, 0, 0, 0),
                         intArrayOf(1, 0, 1, 0),
                         intArrayOf(0, 1, 1, 0),
-                        intArrayOf(0, 0, 0, 0)
-                    )
+                        intArrayOf(0, 0, 0, 0),
+                    ),
                 ),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
@@ -30,10 +30,10 @@ internal class SolutionTest {
                         intArrayOf(0, 1, 1, 0),
                         intArrayOf(1, 0, 1, 0),
                         intArrayOf(0, 1, 1, 0),
-                        intArrayOf(0, 0, 0, 0)
-                    )
+                        intArrayOf(0, 0, 0, 0),
+                    ),
                 ),
-            equalTo(0)
+            equalTo(0),
         )
     }
 }
diff --git a/src/test/kotlin/g1001_1100/s1021_remove_outermost_parentheses/SolutionTest.kt b/src/test/kotlin/g1001_1100/s1021_remove_outermost_parentheses/SolutionTest.kt
index 7643c601a..61918e732 100644
--- a/src/test/kotlin/g1001_1100/s1021_remove_outermost_parentheses/SolutionTest.kt
+++ b/src/test/kotlin/g1001_1100/s1021_remove_outermost_parentheses/SolutionTest.kt
@@ -14,7 +14,7 @@ internal class SolutionTest {
     fun removeOuterParentheses2() {
         assertThat(
             Solution().removeOuterParentheses("(()())(())(()(()))"),
-            equalTo("()()()()(())")
+            equalTo("()()()()(())"),
         )
     }
 
diff --git a/src/test/kotlin/g1001_1100/s1023_camelcase_matching/SolutionTest.kt b/src/test/kotlin/g1001_1100/s1023_camelcase_matching/SolutionTest.kt
index 9867c8af6..6d8cd00a8 100644
--- a/src/test/kotlin/g1001_1100/s1023_camelcase_matching/SolutionTest.kt
+++ b/src/test/kotlin/g1001_1100/s1023_camelcase_matching/SolutionTest.kt
@@ -15,11 +15,11 @@ internal class SolutionTest {
                         "FooBarTest",
                         "FootBall",
                         "FrameBuffer",
-                        "ForceFeedBack"
+                        "ForceFeedBack",
                     ),
-                    "FB"
+                    "FB",
                 ),
-            equalTo(listOf(true, false, true, true, false))
+            equalTo(listOf(true, false, true, true, false)),
         )
     }
 
@@ -33,11 +33,11 @@ internal class SolutionTest {
                         "FooBarTest",
                         "FootBall",
                         "FrameBuffer",
-                        "ForceFeedBack"
+                        "ForceFeedBack",
                     ),
-                    "FoBa"
+                    "FoBa",
                 ),
-            equalTo(listOf(true, false, true, false, false))
+            equalTo(listOf(true, false, true, false, false)),
         )
     }
 
@@ -51,11 +51,11 @@ internal class SolutionTest {
                         "FooBarTest",
                         "FootBall",
                         "FrameBuffer",
-                        "ForceFeedBack"
+                        "ForceFeedBack",
                     ),
-                    "FoBaT"
+                    "FoBaT",
                 ),
-            equalTo(listOf(false, true, false, false, false))
+            equalTo(listOf(false, true, false, false, false)),
         )
     }
 }
diff --git a/src/test/kotlin/g1001_1100/s1024_video_stitching/SolutionTest.kt b/src/test/kotlin/g1001_1100/s1024_video_stitching/SolutionTest.kt
index 2f4448b93..192a03919 100644
--- a/src/test/kotlin/g1001_1100/s1024_video_stitching/SolutionTest.kt
+++ b/src/test/kotlin/g1001_1100/s1024_video_stitching/SolutionTest.kt
@@ -16,11 +16,11 @@ internal class SolutionTest {
                         intArrayOf(8, 10),
                         intArrayOf(1, 9),
                         intArrayOf(1, 5),
-                        intArrayOf(5, 9)
+                        intArrayOf(5, 9),
                     ),
-                    10
+                    10,
                 ),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
@@ -45,11 +45,11 @@ internal class SolutionTest {
                         intArrayOf(3, 4),
                         intArrayOf(4, 5),
                         intArrayOf(5, 7),
-                        intArrayOf(6, 9)
+                        intArrayOf(6, 9),
                     ),
-                    9
+                    9,
                 ),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
diff --git a/src/test/kotlin/g1001_1100/s1027_longest_arithmetic_subsequence/SolutionTest.kt b/src/test/kotlin/g1001_1100/s1027_longest_arithmetic_subsequence/SolutionTest.kt
index bbf0f99ee..e64e2334f 100644
--- a/src/test/kotlin/g1001_1100/s1027_longest_arithmetic_subsequence/SolutionTest.kt
+++ b/src/test/kotlin/g1001_1100/s1027_longest_arithmetic_subsequence/SolutionTest.kt
@@ -19,7 +19,7 @@ internal class SolutionTest {
     fun longestArithSeqLength3() {
         assertThat(
             Solution().longestArithSeqLength(intArrayOf(20, 1, 15, 3, 10, 5, 8)),
-            equalTo(4)
+            equalTo(4),
         )
     }
 }
diff --git a/src/test/kotlin/g1001_1100/s1028_recover_a_tree_from_preorder_traversal/SolutionTest.kt b/src/test/kotlin/g1001_1100/s1028_recover_a_tree_from_preorder_traversal/SolutionTest.kt
index 43f9613d3..326db3176 100644
--- a/src/test/kotlin/g1001_1100/s1028_recover_a_tree_from_preorder_traversal/SolutionTest.kt
+++ b/src/test/kotlin/g1001_1100/s1028_recover_a_tree_from_preorder_traversal/SolutionTest.kt
@@ -11,7 +11,7 @@ internal class SolutionTest {
         val expected: TreeNode? = TreeNode.create(listOf(1, 2, 5, 3, 4, 6, 7))
         assertThat(
             Solution().recoverFromPreorder("1-2--3--4-5--6--7").toString(),
-            equalTo(expected.toString())
+            equalTo(expected.toString()),
         )
     }
 
@@ -20,7 +20,7 @@ internal class SolutionTest {
         val expected: TreeNode? = TreeNode.create(listOf(1, 2, 5, 3, null, 6, null, 4, null, 7))
         assertThat(
             Solution().recoverFromPreorder("1-2--3---4-5--6---7").toString(),
-            equalTo(expected.toString())
+            equalTo(expected.toString()),
         )
     }
 
@@ -29,7 +29,7 @@ internal class SolutionTest {
         val expected: TreeNode? = TreeNode.create(listOf(1, 401, null, 349, 88, 90))
         assertThat(
             Solution().recoverFromPreorder("1-401--349---90--88").toString(),
-            equalTo(expected.toString())
+            equalTo(expected.toString()),
         )
     }
 }
diff --git a/src/test/kotlin/g1001_1100/s1029_two_city_scheduling/SolutionTest.kt b/src/test/kotlin/g1001_1100/s1029_two_city_scheduling/SolutionTest.kt
index 064c61843..ae4701183 100644
--- a/src/test/kotlin/g1001_1100/s1029_two_city_scheduling/SolutionTest.kt
+++ b/src/test/kotlin/g1001_1100/s1029_two_city_scheduling/SolutionTest.kt
@@ -14,10 +14,10 @@ internal class SolutionTest {
                         intArrayOf(10, 20),
                         intArrayOf(30, 200),
                         intArrayOf(400, 50),
-                        intArrayOf(30, 20)
-                    )
+                        intArrayOf(30, 20),
+                    ),
                 ),
-            equalTo(110)
+            equalTo(110),
         )
     }
 
@@ -32,10 +32,10 @@ internal class SolutionTest {
                         intArrayOf(926, 667),
                         intArrayOf(184, 139),
                         intArrayOf(840, 118),
-                        intArrayOf(577, 469)
-                    )
+                        intArrayOf(577, 469),
+                    ),
                 ),
-            equalTo(1859)
+            equalTo(1859),
         )
     }
 
@@ -52,10 +52,10 @@ internal class SolutionTest {
                         intArrayOf(855, 779),
                         intArrayOf(457, 60),
                         intArrayOf(650, 359),
-                        intArrayOf(631, 42)
-                    )
+                        intArrayOf(631, 42),
+                    ),
                 ),
-            equalTo(3086)
+            equalTo(3086),
         )
     }
 }
diff --git a/src/test/kotlin/g1001_1100/s1030_matrix_cells_in_distance_order/SolutionTest.kt b/src/test/kotlin/g1001_1100/s1030_matrix_cells_in_distance_order/SolutionTest.kt
index cbe339ec8..711d832f9 100644
--- a/src/test/kotlin/g1001_1100/s1030_matrix_cells_in_distance_order/SolutionTest.kt
+++ b/src/test/kotlin/g1001_1100/s1030_matrix_cells_in_distance_order/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun allCellsDistOrder() {
         assertThat(
             Solution().allCellsDistOrder(1, 2, 0, 0),
-            equalTo(arrayOf(intArrayOf(0, 0), intArrayOf(0, 1)))
+            equalTo(arrayOf(intArrayOf(0, 0), intArrayOf(0, 1))),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun allCellsDistOrder2() {
         assertThat(
             Solution().allCellsDistOrder(2, 2, 0, 1),
-            equalTo(arrayOf(intArrayOf(0, 1), intArrayOf(0, 0), intArrayOf(1, 1), intArrayOf(1, 0)))
+            equalTo(arrayOf(intArrayOf(0, 1), intArrayOf(0, 0), intArrayOf(1, 1), intArrayOf(1, 0))),
         )
     }
 
@@ -32,9 +32,9 @@ internal class SolutionTest {
                     intArrayOf(1, 1),
                     intArrayOf(0, 1),
                     intArrayOf(1, 0),
-                    intArrayOf(0, 0)
-                )
-            )
+                    intArrayOf(0, 0),
+                ),
+            ),
         )
     }
 }
diff --git a/src/test/kotlin/g1001_1100/s1031_maximum_sum_of_two_non_overlapping_subarrays/SolutionTest.kt b/src/test/kotlin/g1001_1100/s1031_maximum_sum_of_two_non_overlapping_subarrays/SolutionTest.kt
index 5e2437d52..1348bc720 100644
--- a/src/test/kotlin/g1001_1100/s1031_maximum_sum_of_two_non_overlapping_subarrays/SolutionTest.kt
+++ b/src/test/kotlin/g1001_1100/s1031_maximum_sum_of_two_non_overlapping_subarrays/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun maxSumTwoNoOverlap() {
         assertThat(
             Solution().maxSumTwoNoOverlap(intArrayOf(0, 6, 5, 2, 2, 5, 1, 9, 4), 1, 2),
-            equalTo(20)
+            equalTo(20),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun maxSumTwoNoOverlap2() {
         assertThat(
             Solution().maxSumTwoNoOverlap(intArrayOf(3, 8, 1, 3, 2, 1, 8, 9, 0), 3, 2),
-            equalTo(29)
+            equalTo(29),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun maxSumTwoNoOverlap3() {
         assertThat(
             Solution().maxSumTwoNoOverlap(intArrayOf(2, 1, 5, 6, 0, 9, 5, 0, 3, 8), 4, 3),
-            equalTo(31)
+            equalTo(31),
         )
     }
 }
diff --git a/src/test/kotlin/g1001_1100/s1034_coloring_a_border/SolutionTest.kt b/src/test/kotlin/g1001_1100/s1034_coloring_a_border/SolutionTest.kt
index f2c336f4a..d0bda8162 100644
--- a/src/test/kotlin/g1001_1100/s1034_coloring_a_border/SolutionTest.kt
+++ b/src/test/kotlin/g1001_1100/s1034_coloring_a_border/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun colorBorder() {
         assertThat(
             Solution().colorBorder(arrayOf(intArrayOf(1, 1), intArrayOf(1, 2)), 0, 0, 3),
-            equalTo(arrayOf(intArrayOf(3, 3), intArrayOf(3, 2)))
+            equalTo(arrayOf(intArrayOf(3, 3), intArrayOf(3, 2))),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun colorBorder2() {
         assertThat(
             Solution().colorBorder(arrayOf(intArrayOf(1, 2, 2), intArrayOf(2, 3, 2)), 0, 1, 3),
-            equalTo(arrayOf(intArrayOf(1, 3, 3), intArrayOf(2, 3, 3)))
+            equalTo(arrayOf(intArrayOf(1, 3, 3), intArrayOf(2, 3, 3))),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun colorBorder3() {
         assertThat(
             Solution().colorBorder(arrayOf(intArrayOf(1, 1, 1), intArrayOf(1, 1, 1), intArrayOf(1, 1, 1)), 1, 1, 2),
-            equalTo(arrayOf(intArrayOf(2, 2, 2), intArrayOf(2, 1, 2), intArrayOf(2, 2, 2)))
+            equalTo(arrayOf(intArrayOf(2, 2, 2), intArrayOf(2, 1, 2), intArrayOf(2, 2, 2))),
         )
     }
 }
diff --git a/src/test/kotlin/g1001_1100/s1035_uncrossed_lines/SolutionTest.kt b/src/test/kotlin/g1001_1100/s1035_uncrossed_lines/SolutionTest.kt
index 84e8482e9..d559a6c31 100644
--- a/src/test/kotlin/g1001_1100/s1035_uncrossed_lines/SolutionTest.kt
+++ b/src/test/kotlin/g1001_1100/s1035_uncrossed_lines/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun maxUncrossedLines() {
         assertThat(
             Solution().maxUncrossedLines(intArrayOf(1, 4, 2), intArrayOf(1, 2, 4)),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -18,7 +18,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .maxUncrossedLines(intArrayOf(2, 5, 1, 2, 5), intArrayOf(10, 5, 2, 1, 5, 2)),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
@@ -27,7 +27,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .maxUncrossedLines(intArrayOf(1, 3, 7, 1, 7, 5), intArrayOf(1, 9, 2, 5, 1)),
-            equalTo(2)
+            equalTo(2),
         )
     }
 }
diff --git a/src/test/kotlin/g1001_1100/s1036_escape_a_large_maze/SolutionTest.kt b/src/test/kotlin/g1001_1100/s1036_escape_a_large_maze/SolutionTest.kt
index ffc889dca..036a3e01a 100644
--- a/src/test/kotlin/g1001_1100/s1036_escape_a_large_maze/SolutionTest.kt
+++ b/src/test/kotlin/g1001_1100/s1036_escape_a_large_maze/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .isEscapePossible(arrayOf(intArrayOf(0, 1), intArrayOf(1, 0)), intArrayOf(0, 0), intArrayOf(0, 2)),
-            equalTo(false)
+            equalTo(false),
         )
     }
 
@@ -19,7 +19,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .isEscapePossible(arrayOf(), intArrayOf(0, 0), intArrayOf(999999, 999999)),
-            equalTo(true)
+            equalTo(true),
         )
     }
 }
diff --git a/src/test/kotlin/g1001_1100/s1037_valid_boomerang/SolutionTest.kt b/src/test/kotlin/g1001_1100/s1037_valid_boomerang/SolutionTest.kt
index cb2471aba..82d8a9e34 100644
--- a/src/test/kotlin/g1001_1100/s1037_valid_boomerang/SolutionTest.kt
+++ b/src/test/kotlin/g1001_1100/s1037_valid_boomerang/SolutionTest.kt
@@ -13,7 +13,8 @@ internal class SolutionTest {
     @Test
     fun isBoomerang2() {
         assertThat(
-            Solution().isBoomerang(arrayOf(intArrayOf(1, 1), intArrayOf(2, 2), intArrayOf(3, 3))), equalTo(false)
+            Solution().isBoomerang(arrayOf(intArrayOf(1, 1), intArrayOf(2, 2), intArrayOf(3, 3))),
+            equalTo(false),
         )
     }
 }
diff --git a/src/test/kotlin/g1001_1100/s1038_binary_search_tree_to_greater_sum_tree/SolutionTest.kt b/src/test/kotlin/g1001_1100/s1038_binary_search_tree_to_greater_sum_tree/SolutionTest.kt
index 2e11f5943..21b9b818a 100644
--- a/src/test/kotlin/g1001_1100/s1038_binary_search_tree_to_greater_sum_tree/SolutionTest.kt
+++ b/src/test/kotlin/g1001_1100/s1038_binary_search_tree_to_greater_sum_tree/SolutionTest.kt
@@ -10,14 +10,14 @@ internal class SolutionTest {
     fun bstToGst() {
         val root: TreeNode? = TreeNode.create(
             listOf(
-                4, 1, 6, 0, 2, 5, 7, null, null, null, 3, null, null, null, 8
-            )
+                4, 1, 6, 0, 2, 5, 7, null, null, null, 3, null, null, null, 8,
+            ),
         )
         val expected: TreeNode? = TreeNode.create(
             listOf(
                 30, 36, 21, 36, 35, 26, 15, null, null, null, 33, null, null, null,
-                8
-            )
+                8,
+            ),
         )
         assertThat(Solution().bstToGst(root).toString(), equalTo(expected.toString()))
     }
diff --git a/src/test/kotlin/g1001_1100/s1040_moving_stones_until_consecutive_ii/SolutionTest.kt b/src/test/kotlin/g1001_1100/s1040_moving_stones_until_consecutive_ii/SolutionTest.kt
index cb91d2831..118590710 100644
--- a/src/test/kotlin/g1001_1100/s1040_moving_stones_until_consecutive_ii/SolutionTest.kt
+++ b/src/test/kotlin/g1001_1100/s1040_moving_stones_until_consecutive_ii/SolutionTest.kt
@@ -14,7 +14,7 @@ internal class SolutionTest {
     fun numMovesStonesII2() {
         assertThat(
             Solution().numMovesStonesII(intArrayOf(6, 5, 4, 3, 10)),
-            equalTo(intArrayOf(2, 3))
+            equalTo(intArrayOf(2, 3)),
         )
     }
 }
diff --git a/src/test/kotlin/g1001_1100/s1042_flower_planting_with_no_adjacent/SolutionTest.kt b/src/test/kotlin/g1001_1100/s1042_flower_planting_with_no_adjacent/SolutionTest.kt
index 0878c6e80..4e9ffa437 100644
--- a/src/test/kotlin/g1001_1100/s1042_flower_planting_with_no_adjacent/SolutionTest.kt
+++ b/src/test/kotlin/g1001_1100/s1042_flower_planting_with_no_adjacent/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun gardenNoAdj() {
         assertThat(
             Solution().gardenNoAdj(3, arrayOf(intArrayOf(1, 2), intArrayOf(2, 3), intArrayOf(3, 1))),
-            equalTo(intArrayOf(1, 2, 3))
+            equalTo(intArrayOf(1, 2, 3)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun gardenNoAdj2() {
         assertThat(
             Solution().gardenNoAdj(4, arrayOf(intArrayOf(1, 2), intArrayOf(3, 4))),
-            equalTo(intArrayOf(1, 2, 1, 2))
+            equalTo(intArrayOf(1, 2, 1, 2)),
         )
     }
 
@@ -33,10 +33,10 @@ internal class SolutionTest {
                         intArrayOf(3, 4),
                         intArrayOf(4, 1),
                         intArrayOf(1, 3),
-                        intArrayOf(2, 4)
-                    )
+                        intArrayOf(2, 4),
+                    ),
                 ),
-            equalTo(intArrayOf(1, 2, 3, 4))
+            equalTo(intArrayOf(1, 2, 3, 4)),
         )
     }
 }
diff --git a/src/test/kotlin/g1001_1100/s1043_partition_array_for_maximum_sum/SolutionTest.kt b/src/test/kotlin/g1001_1100/s1043_partition_array_for_maximum_sum/SolutionTest.kt
index b73d0bb84..c09636716 100644
--- a/src/test/kotlin/g1001_1100/s1043_partition_array_for_maximum_sum/SolutionTest.kt
+++ b/src/test/kotlin/g1001_1100/s1043_partition_array_for_maximum_sum/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun maxSumAfterPartitioning() {
         assertThat(
             Solution().maxSumAfterPartitioning(intArrayOf(1, 15, 7, 9, 2, 5, 10), 3),
-            equalTo(84)
+            equalTo(84),
         )
     }
 
@@ -18,7 +18,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .maxSumAfterPartitioning(intArrayOf(1, 4, 1, 5, 7, 3, 6, 1, 9, 9, 3), 4),
-            equalTo(83)
+            equalTo(83),
         )
     }
 
diff --git a/src/test/kotlin/g1001_1100/s1045_customers_who_bought_all_products/MysqlTest.kt b/src/test/kotlin/g1001_1100/s1045_customers_who_bought_all_products/MysqlTest.kt
index 1d1ff0101..c89d0aed0 100644
--- a/src/test/kotlin/g1001_1100/s1045_customers_who_bought_all_products/MysqlTest.kt
+++ b/src/test/kotlin/g1001_1100/s1045_customers_who_bought_all_products/MysqlTest.kt
@@ -24,8 +24,8 @@ import javax.sql.DataSource
             " INSERT INTO Customer(customer_id, product_key) VALUES (1, 6); " +
             "CREATE TABLE Product(product_key INTEGER); " +
             " INSERT INTO Product(product_key) VALUES (5); " +
-            " INSERT INTO Product(product_key) VALUES (6); "
-    ]
+            " INSERT INTO Product(product_key) VALUES (6); ",
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -38,12 +38,12 @@ internal class MysqlTest {
                         FileReader(
                             "src/main/kotlin/g1001_1100/" +
                                 "s1045_customers_who_bought_all_products" +
-                                "/script.sql"
-                        )
+                                "/script.sql",
+                        ),
                     )
                         .lines()
                         .collect(Collectors.joining("\n"))
-                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace("#.*?\\r?\\n".toRegex(), ""),
                 ).use { resultSet ->
                     assertThat(resultSet.next(), equalTo(true))
                     assertThat(resultSet.getInt(1), equalTo(1))
diff --git a/src/test/kotlin/g1001_1100/s1048_longest_string_chain/SolutionTest.kt b/src/test/kotlin/g1001_1100/s1048_longest_string_chain/SolutionTest.kt
index 2fdb84451..b940518d3 100644
--- a/src/test/kotlin/g1001_1100/s1048_longest_string_chain/SolutionTest.kt
+++ b/src/test/kotlin/g1001_1100/s1048_longest_string_chain/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun longestStrChain() {
         assertThat(
             Solution().longestStrChain(arrayOf("a", "b", "ba", "bca", "bda", "bdca")),
-            equalTo(4)
+            equalTo(4),
         )
     }
 
@@ -18,7 +18,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .longestStrChain(arrayOf("xbc", "pcxbcf", "xb", "cxbc", "pcxbc")),
-            equalTo(5)
+            equalTo(5),
         )
     }
 
diff --git a/src/test/kotlin/g1001_1100/s1050_actors_and_directors_who_cooperated_at_least_three_times/MysqlTest.kt b/src/test/kotlin/g1001_1100/s1050_actors_and_directors_who_cooperated_at_least_three_times/MysqlTest.kt
index fd9456d85..301b7da5e 100644
--- a/src/test/kotlin/g1001_1100/s1050_actors_and_directors_who_cooperated_at_least_three_times/MysqlTest.kt
+++ b/src/test/kotlin/g1001_1100/s1050_actors_and_directors_who_cooperated_at_least_three_times/MysqlTest.kt
@@ -31,8 +31,8 @@ import javax.sql.DataSource
             "INSERT INTO ACTORDIRECTOR(actor_id, director_id, timestamp)" +
             " VALUES (1, 1, 5); " +
             "INSERT INTO ACTORDIRECTOR(actor_id, director_id, timestamp)" +
-            " VALUES (2, 1, 6); "
-    ]
+            " VALUES (2, 1, 6); ",
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -45,12 +45,12 @@ internal class MysqlTest {
                         FileReader(
                             "src/main/kotlin/g1001_1100/s1050_actors" +
                                 "_and_directors_who_cooperated_at_least" +
-                                "_three_times/script.sql"
-                        )
+                                "_three_times/script.sql",
+                        ),
                     )
                         .lines()
                         .collect(Collectors.joining("\n"))
-                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace("#.*?\\r?\\n".toRegex(), ""),
                 ).use { resultSet ->
                     assertThat(resultSet.next(), equalTo(true))
                     assertThat(resultSet.getNString(1), equalTo("1"))
diff --git a/src/test/kotlin/g1001_1100/s1052_grumpy_bookstore_owner/SolutionTest.kt b/src/test/kotlin/g1001_1100/s1052_grumpy_bookstore_owner/SolutionTest.kt
index b4739c98c..02704fac7 100644
--- a/src/test/kotlin/g1001_1100/s1052_grumpy_bookstore_owner/SolutionTest.kt
+++ b/src/test/kotlin/g1001_1100/s1052_grumpy_bookstore_owner/SolutionTest.kt
@@ -10,10 +10,11 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .maxSatisfied(
-                    intArrayOf(1, 0, 1, 2, 1, 1, 7, 5), intArrayOf(0, 1, 0, 1, 0, 1, 0, 1),
-                    3
+                    intArrayOf(1, 0, 1, 2, 1, 1, 7, 5),
+                    intArrayOf(0, 1, 0, 1, 0, 1, 0, 1),
+                    3,
                 ),
-            equalTo(16)
+            equalTo(16),
         )
     }
 
diff --git a/src/test/kotlin/g1001_1100/s1053_previous_permutation_with_one_swap/SolutionTest.kt b/src/test/kotlin/g1001_1100/s1053_previous_permutation_with_one_swap/SolutionTest.kt
index 848297f21..09caeb421 100644
--- a/src/test/kotlin/g1001_1100/s1053_previous_permutation_with_one_swap/SolutionTest.kt
+++ b/src/test/kotlin/g1001_1100/s1053_previous_permutation_with_one_swap/SolutionTest.kt
@@ -19,7 +19,7 @@ internal class SolutionTest {
     fun prevPermOpt3() {
         assertThat(
             Solution().prevPermOpt1(intArrayOf(1, 9, 4, 6, 7)),
-            equalTo(intArrayOf(1, 7, 4, 6, 9))
+            equalTo(intArrayOf(1, 7, 4, 6, 9)),
         )
     }
 }
diff --git a/src/test/kotlin/g1001_1100/s1054_distant_barcodes/SolutionTest.kt b/src/test/kotlin/g1001_1100/s1054_distant_barcodes/SolutionTest.kt
index f54f6a192..b64e577e1 100644
--- a/src/test/kotlin/g1001_1100/s1054_distant_barcodes/SolutionTest.kt
+++ b/src/test/kotlin/g1001_1100/s1054_distant_barcodes/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun rearrangeBarcodes() {
         assertThat(
             Solution().rearrangeBarcodes(intArrayOf(1, 1, 1, 2, 2, 2)),
-            equalTo(intArrayOf(1, 2, 1, 2, 1, 2))
+            equalTo(intArrayOf(1, 2, 1, 2, 1, 2)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun rearrangeBarcodes2() {
         assertThat(
             Solution().rearrangeBarcodes(intArrayOf(1, 1, 1, 1, 2, 2, 3, 3)),
-            equalTo(intArrayOf(1, 3, 1, 2, 1, 2, 3, 1))
+            equalTo(intArrayOf(1, 3, 1, 2, 1, 2, 3, 1)),
         )
     }
 }
diff --git a/src/test/kotlin/g1001_1100/s1061_lexicographically_smallest_equivalent_string/SolutionTest.kt b/src/test/kotlin/g1001_1100/s1061_lexicographically_smallest_equivalent_string/SolutionTest.kt
index 2fc80abeb..5f4fa4a44 100644
--- a/src/test/kotlin/g1001_1100/s1061_lexicographically_smallest_equivalent_string/SolutionTest.kt
+++ b/src/test/kotlin/g1001_1100/s1061_lexicographically_smallest_equivalent_string/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun smallestEquivalentString() {
         assertThat(
             Solution().smallestEquivalentString("hello", "world", "hold"),
-            equalTo("hdld")
+            equalTo("hdld"),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun smallestEquivalentString2() {
         assertThat(
             Solution().smallestEquivalentString("parker", "morris", "parser"),
-            equalTo("makkek")
+            equalTo("makkek"),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun smallestEquivalentString3() {
         assertThat(
             Solution().smallestEquivalentString("leetcode", "programs", "sourcecode"),
-            equalTo("aauaaaaada")
+            equalTo("aauaaaaada"),
         )
     }
 }
diff --git a/src/test/kotlin/g1001_1100/s1068_product_sales_analysis_i/MysqlTest.kt b/src/test/kotlin/g1001_1100/s1068_product_sales_analysis_i/MysqlTest.kt
index a9c6c92d9..90222a226 100644
--- a/src/test/kotlin/g1001_1100/s1068_product_sales_analysis_i/MysqlTest.kt
+++ b/src/test/kotlin/g1001_1100/s1068_product_sales_analysis_i/MysqlTest.kt
@@ -30,8 +30,8 @@ import javax.sql.DataSource
             "INSERT INTO Product(product_id, product_name)" +
             " VALUES (200, 'Apple'); " +
             "INSERT INTO Product(product_id, product_name)" +
-            " VALUES (300, 'Samsung'); "
-    ]
+            " VALUES (300, 'Samsung'); ",
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -43,12 +43,12 @@ internal class MysqlTest {
                     BufferedReader(
                         FileReader(
                             "src/main/kotlin/g1001_1100/s1068_product_sales_analysis_i" +
-                                "/script.sql"
-                        )
+                                "/script.sql",
+                        ),
                     )
                         .lines()
                         .collect(Collectors.joining("\n"))
-                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace("#.*?\\r?\\n".toRegex(), ""),
                 ).use { resultSet ->
                     assertThat(resultSet.next(), equalTo(true))
                     assertThat(resultSet.getNString(1), equalTo("Nokia"))
diff --git a/src/test/kotlin/g1001_1100/s1070_product_sales_analysis_iii/MysqlTest.kt b/src/test/kotlin/g1001_1100/s1070_product_sales_analysis_iii/MysqlTest.kt
index 62b3cea50..a1b132a22 100644
--- a/src/test/kotlin/g1001_1100/s1070_product_sales_analysis_iii/MysqlTest.kt
+++ b/src/test/kotlin/g1001_1100/s1070_product_sales_analysis_iii/MysqlTest.kt
@@ -30,8 +30,8 @@ import javax.sql.DataSource
             "INSERT INTO Product(product_id, product_name)" +
             " VALUES (200, 'Apple'); " +
             "INSERT INTO Product(product_id, product_name)" +
-            " VALUES (300, 'Samsung'); "
-    ]
+            " VALUES (300, 'Samsung'); ",
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -43,12 +43,12 @@ internal class MysqlTest {
                     BufferedReader(
                         FileReader(
                             "src/main/kotlin/g1001_1100/s1070_product_sales_analysis_iii" +
-                                "/script.sql"
-                        )
+                                "/script.sql",
+                        ),
                     )
                         .lines()
                         .collect(Collectors.joining("\n"))
-                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace("#.*?\\r?\\n".toRegex(), ""),
                 ).use { resultSet ->
                     assertThat(resultSet.next(), equalTo(true))
                     assertThat(resultSet.getInt(1), equalTo(100))
diff --git a/src/test/kotlin/g1001_1100/s1072_flip_columns_for_maximum_number_of_equal_rows/SolutionTest.kt b/src/test/kotlin/g1001_1100/s1072_flip_columns_for_maximum_number_of_equal_rows/SolutionTest.kt
index 5580f8391..c321d3a23 100644
--- a/src/test/kotlin/g1001_1100/s1072_flip_columns_for_maximum_number_of_equal_rows/SolutionTest.kt
+++ b/src/test/kotlin/g1001_1100/s1072_flip_columns_for_maximum_number_of_equal_rows/SolutionTest.kt
@@ -20,7 +20,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .maxEqualRowsAfterFlips(arrayOf(intArrayOf(0, 0, 0), intArrayOf(0, 0, 1), intArrayOf(1, 1, 0))),
-            equalTo(2)
+            equalTo(2),
         )
     }
 }
diff --git a/src/test/kotlin/g1001_1100/s1073_adding_two_negabinary_numbers/SolutionTest.kt b/src/test/kotlin/g1001_1100/s1073_adding_two_negabinary_numbers/SolutionTest.kt
index a5fd55c87..873f02778 100644
--- a/src/test/kotlin/g1001_1100/s1073_adding_two_negabinary_numbers/SolutionTest.kt
+++ b/src/test/kotlin/g1001_1100/s1073_adding_two_negabinary_numbers/SolutionTest.kt
@@ -9,21 +9,23 @@ internal class SolutionTest {
     fun addNegabinary() {
         assertThat(
             Solution().addNegabinary(intArrayOf(1, 1, 1, 1, 1), intArrayOf(1, 0, 1)),
-            equalTo(intArrayOf(1, 0, 0, 0, 0))
+            equalTo(intArrayOf(1, 0, 0, 0, 0)),
         )
     }
 
     @Test
     fun addNegabinary2() {
         assertThat(
-            Solution().addNegabinary(intArrayOf(0), intArrayOf(0)), equalTo(intArrayOf(0))
+            Solution().addNegabinary(intArrayOf(0), intArrayOf(0)),
+            equalTo(intArrayOf(0)),
         )
     }
 
     @Test
     fun addNegabinary3() {
         assertThat(
-            Solution().addNegabinary(intArrayOf(0), intArrayOf(1)), equalTo(intArrayOf(1))
+            Solution().addNegabinary(intArrayOf(0), intArrayOf(1)),
+            equalTo(intArrayOf(1)),
         )
     }
 }
diff --git a/src/test/kotlin/g1001_1100/s1074_number_of_submatrices_that_sum_to_target/SolutionTest.kt b/src/test/kotlin/g1001_1100/s1074_number_of_submatrices_that_sum_to_target/SolutionTest.kt
index e15a5bd3d..fbc4cb7f7 100644
--- a/src/test/kotlin/g1001_1100/s1074_number_of_submatrices_that_sum_to_target/SolutionTest.kt
+++ b/src/test/kotlin/g1001_1100/s1074_number_of_submatrices_that_sum_to_target/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .numSubmatrixSumTarget(arrayOf(intArrayOf(0, 1, 0), intArrayOf(1, 1, 1), intArrayOf(0, 1, 0)), 0),
-            equalTo(4)
+            equalTo(4),
         )
     }
 
@@ -18,7 +18,7 @@ internal class SolutionTest {
     fun numSubmatrixSumTarget2() {
         assertThat(
             Solution().numSubmatrixSumTarget(arrayOf(intArrayOf(1, -1), intArrayOf(-1, 1)), 0),
-            equalTo(5)
+            equalTo(5),
         )
     }
 }
diff --git a/src/test/kotlin/g1001_1100/s1075_project_employees_i/MysqlTest.kt b/src/test/kotlin/g1001_1100/s1075_project_employees_i/MysqlTest.kt
index b34a02094..80cba013e 100644
--- a/src/test/kotlin/g1001_1100/s1075_project_employees_i/MysqlTest.kt
+++ b/src/test/kotlin/g1001_1100/s1075_project_employees_i/MysqlTest.kt
@@ -35,8 +35,8 @@ import javax.sql.DataSource
             "INSERT INTO Employee(employee_id, name, experience_years)" +
             " VALUES (3, 'John', 1); " +
             "INSERT INTO Employee(employee_id, name, experience_years)" +
-            " VALUES (4, 'Doe', 2); "
-    ]
+            " VALUES (4, 'Doe', 2); ",
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -48,12 +48,12 @@ internal class MysqlTest {
                     BufferedReader(
                         FileReader(
                             "src/main/kotlin/g1001_1100/s1075_project_employees_i" +
-                                "/script.sql"
-                        )
+                                "/script.sql",
+                        ),
                     )
                         .lines()
                         .collect(Collectors.joining("\n"))
-                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace("#.*?\\r?\\n".toRegex(), ""),
                 ).use { resultSet ->
                     assertThat(resultSet.next(), equalTo(true))
                     assertThat(resultSet.getInt(1), equalTo(1))
diff --git a/src/test/kotlin/g1001_1100/s1078_occurrences_after_bigram/SolutionTest.kt b/src/test/kotlin/g1001_1100/s1078_occurrences_after_bigram/SolutionTest.kt
index 06472be8b..68419a96e 100644
--- a/src/test/kotlin/g1001_1100/s1078_occurrences_after_bigram/SolutionTest.kt
+++ b/src/test/kotlin/g1001_1100/s1078_occurrences_after_bigram/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .findOcurrences("alice is a good girl she is a good student", "a", "good"),
-            equalTo(arrayOf("girl", "student"))
+            equalTo(arrayOf("girl", "student")),
         )
     }
 
@@ -18,7 +18,7 @@ internal class SolutionTest {
     fun findOcurrences2() {
         assertThat(
             Solution().findOcurrences("we will we will rock you", "we", "will"),
-            equalTo(arrayOf("we", "rock"))
+            equalTo(arrayOf("we", "rock")),
         )
     }
 }
diff --git a/src/test/kotlin/g1001_1100/s1080_insufficient_nodes_in_root_to_leaf_paths/SolutionTest.kt b/src/test/kotlin/g1001_1100/s1080_insufficient_nodes_in_root_to_leaf_paths/SolutionTest.kt
index a79df6635..052ae0043 100644
--- a/src/test/kotlin/g1001_1100/s1080_insufficient_nodes_in_root_to_leaf_paths/SolutionTest.kt
+++ b/src/test/kotlin/g1001_1100/s1080_insufficient_nodes_in_root_to_leaf_paths/SolutionTest.kt
@@ -14,13 +14,13 @@ internal class SolutionTest {
                     TreeNode.create(
                         listOf(
                             1, 2, 3, 4, -99, -99, 7, 8, 9, -99, -99, 12, 13,
-                            -99, 14
-                        )
+                            -99, 14,
+                        ),
                     ),
-                    1
+                    1,
                 )
                 .toString(),
-            equalTo("1,2,4,8,9,null,3,null,7,null,14")
+            equalTo("1,2,4,8,9,null,3,null,7,null,14"),
         )
     }
 
@@ -31,13 +31,13 @@ internal class SolutionTest {
                 .sufficientSubset(
                     TreeNode.create(
                         listOf(
-                            5, 4, 8, 11, null, 17, 4, 7, 1, null, null, 5, 3
-                        )
+                            5, 4, 8, 11, null, 17, 4, 7, 1, null, null, 5, 3,
+                        ),
                     ),
-                    22
+                    22,
                 )
                 .toString(),
-            equalTo("5,4,11,7,null,null,8,17,4,5,null")
+            equalTo("5,4,11,7,null,null,8,17,4,5,null"),
         )
     }
 
@@ -46,10 +46,11 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .sufficientSubset(
-                    TreeNode.create(listOf(1, 2, -3, -5, null, 4, null)), -1
+                    TreeNode.create(listOf(1, 2, -3, -5, null, 4, null)),
+                    -1,
                 )
                 .toString(),
-            equalTo("1,null,-3,4,null")
+            equalTo("1,null,-3,4,null"),
         )
     }
 }
diff --git a/src/test/kotlin/g1001_1100/s1084_sales_analysis_iii/MysqlTest.kt b/src/test/kotlin/g1001_1100/s1084_sales_analysis_iii/MysqlTest.kt
index 3273b3c7b..d7a045fbc 100644
--- a/src/test/kotlin/g1001_1100/s1084_sales_analysis_iii/MysqlTest.kt
+++ b/src/test/kotlin/g1001_1100/s1084_sales_analysis_iii/MysqlTest.kt
@@ -33,8 +33,8 @@ import javax.sql.DataSource
             "INSERT INTO sales(seller_id, product_id, buyer_id, sale_date, quantity, price)" +
             " VALUES (2, 2, 3, '2019-06-021', 1, 800); " +
             "INSERT INTO sales(seller_id, product_id, buyer_id, sale_date, quantity, price)" +
-            " VALUES (3, 3, 4, '2019-05-13', 2, 2800); "
-    ]
+            " VALUES (3, 3, 4, '2019-05-13', 2, 2800); ",
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -46,12 +46,12 @@ internal class MysqlTest {
                     BufferedReader(
                         FileReader(
                             "src/main/kotlin/g1001_1100/" +
-                                "s1084_sales_analysis_iii/script.sql"
-                        )
+                                "s1084_sales_analysis_iii/script.sql",
+                        ),
                     )
                         .lines()
                         .collect(Collectors.joining("\n"))
-                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace("#.*?\\r?\\n".toRegex(), ""),
                 ).use { resultSet ->
                     assertThat(resultSet.next(), equalTo(true))
                     assertThat(resultSet.getInt(1), equalTo(1))
diff --git a/src/test/kotlin/g1001_1100/s1090_largest_values_from_labels/SolutionTest.kt b/src/test/kotlin/g1001_1100/s1090_largest_values_from_labels/SolutionTest.kt
index 5943585b0..92a247da9 100644
--- a/src/test/kotlin/g1001_1100/s1090_largest_values_from_labels/SolutionTest.kt
+++ b/src/test/kotlin/g1001_1100/s1090_largest_values_from_labels/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .largestValsFromLabels(intArrayOf(5, 4, 3, 2, 1), intArrayOf(1, 1, 2, 2, 3), 3, 1),
-            equalTo(9)
+            equalTo(9),
         )
     }
 
@@ -19,7 +19,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .largestValsFromLabels(intArrayOf(5, 4, 3, 2, 1), intArrayOf(1, 3, 3, 3, 2), 3, 2),
-            equalTo(12)
+            equalTo(12),
         )
     }
 }
diff --git a/src/test/kotlin/g1001_1100/s1091_shortest_path_in_binary_matrix/SolutionTest.kt b/src/test/kotlin/g1001_1100/s1091_shortest_path_in_binary_matrix/SolutionTest.kt
index 611fa90e8..d05a2b109 100644
--- a/src/test/kotlin/g1001_1100/s1091_shortest_path_in_binary_matrix/SolutionTest.kt
+++ b/src/test/kotlin/g1001_1100/s1091_shortest_path_in_binary_matrix/SolutionTest.kt
@@ -8,7 +8,8 @@ internal class SolutionTest {
     @Test
     fun shortestPathBinaryMatrix() {
         assertThat(
-            Solution().shortestPathBinaryMatrix(arrayOf(intArrayOf(0, 1), intArrayOf(1, 0))), equalTo(2)
+            Solution().shortestPathBinaryMatrix(arrayOf(intArrayOf(0, 1), intArrayOf(1, 0))),
+            equalTo(2),
         )
     }
 
@@ -17,7 +18,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .shortestPathBinaryMatrix(arrayOf(intArrayOf(0, 0, 0), intArrayOf(1, 1, 0), intArrayOf(1, 1, 0))),
-            equalTo(4)
+            equalTo(4),
         )
     }
 
@@ -26,7 +27,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .shortestPathBinaryMatrix(arrayOf(intArrayOf(1, 0, 0), intArrayOf(1, 1, 0), intArrayOf(1, 1, 0))),
-            equalTo(-1)
+            equalTo(-1),
         )
     }
 }
diff --git a/src/test/kotlin/g1001_1100/s1092_shortest_common_supersequence/SolutionTest.kt b/src/test/kotlin/g1001_1100/s1092_shortest_common_supersequence/SolutionTest.kt
index 13808a15d..0dfa18359 100644
--- a/src/test/kotlin/g1001_1100/s1092_shortest_common_supersequence/SolutionTest.kt
+++ b/src/test/kotlin/g1001_1100/s1092_shortest_common_supersequence/SolutionTest.kt
@@ -14,7 +14,7 @@ internal class SolutionTest {
     fun shortestCommonSupersequence2() {
         assertThat(
             Solution().shortestCommonSupersequence("aaaaaaaa", "aaaaaaaa"),
-            equalTo("aaaaaaaa")
+            equalTo("aaaaaaaa"),
         )
     }
 }
diff --git a/src/test/kotlin/g1001_1100/s1093_statistics_from_a_large_sample/SolutionTest.kt b/src/test/kotlin/g1001_1100/s1093_statistics_from_a_large_sample/SolutionTest.kt
index 952b05c39..73cf63f3d 100644
--- a/src/test/kotlin/g1001_1100/s1093_statistics_from_a_large_sample/SolutionTest.kt
+++ b/src/test/kotlin/g1001_1100/s1093_statistics_from_a_large_sample/SolutionTest.kt
@@ -23,10 +23,10 @@ internal class SolutionTest {
                         0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
                         0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
                         0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-                        0, 0, 0, 0
-                    )
+                        0, 0, 0, 0,
+                    ),
                 ),
-            equalTo(doubleArrayOf(1.00000, 3.00000, 2.37500, 2.50000, 3.00000))
+            equalTo(doubleArrayOf(1.00000, 3.00000, 2.37500, 2.50000, 3.00000)),
         )
     }
 
@@ -48,10 +48,10 @@ internal class SolutionTest {
                         0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
                         0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
                         0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-                        0, 0, 0, 0
-                    )
+                        0, 0, 0, 0,
+                    ),
                 ),
-            equalTo(doubleArrayOf(1.00000, 4.00000, 2.1818181818181817, 2.00000, 1.00000))
+            equalTo(doubleArrayOf(1.00000, 4.00000, 2.1818181818181817, 2.00000, 1.00000)),
         )
     }
 }
diff --git a/src/test/kotlin/g1001_1100/s1094_car_pooling/SolutionTest.kt b/src/test/kotlin/g1001_1100/s1094_car_pooling/SolutionTest.kt
index ecaf5ac7d..142ac05d9 100644
--- a/src/test/kotlin/g1001_1100/s1094_car_pooling/SolutionTest.kt
+++ b/src/test/kotlin/g1001_1100/s1094_car_pooling/SolutionTest.kt
@@ -8,7 +8,8 @@ internal class SolutionTest {
     @Test
     fun carPooling() {
         assertThat(
-            Solution().carPooling(arrayOf(intArrayOf(2, 1, 5), intArrayOf(3, 3, 7)), 4), equalTo(false)
+            Solution().carPooling(arrayOf(intArrayOf(2, 1, 5), intArrayOf(3, 3, 7)), 4),
+            equalTo(false),
         )
     }
 
diff --git a/src/test/kotlin/g1001_1100/s1095_find_in_mountain_array/SolutionTest.kt b/src/test/kotlin/g1001_1100/s1095_find_in_mountain_array/SolutionTest.kt
index 24364a0ee..b2cf8a4d9 100644
--- a/src/test/kotlin/g1001_1100/s1095_find_in_mountain_array/SolutionTest.kt
+++ b/src/test/kotlin/g1001_1100/s1095_find_in_mountain_array/SolutionTest.kt
@@ -10,9 +10,10 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .findInMountainArray(
-                    3, MountainArrayImpl(intArrayOf(1, 2, 3, 4, 5, 3, 1))
+                    3,
+                    MountainArrayImpl(intArrayOf(1, 2, 3, 4, 5, 3, 1)),
                 ),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -21,9 +22,10 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .findInMountainArray(
-                    3, MountainArrayImpl(intArrayOf(0, 1, 2, 4, 2, 1))
+                    3,
+                    MountainArrayImpl(intArrayOf(0, 1, 2, 4, 2, 1)),
                 ),
-            equalTo(-1)
+            equalTo(-1),
         )
     }
 
diff --git a/src/test/kotlin/g1001_1100/s1096_brace_expansion_ii/SolutionTest.kt b/src/test/kotlin/g1001_1100/s1096_brace_expansion_ii/SolutionTest.kt
index b376dfecd..c1f74f0be 100644
--- a/src/test/kotlin/g1001_1100/s1096_brace_expansion_ii/SolutionTest.kt
+++ b/src/test/kotlin/g1001_1100/s1096_brace_expansion_ii/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun braceExpansionII() {
         assertThat(
             Solution().braceExpansionII("{a,b}{c,{d,e}}"),
-            equalTo(listOf("ac", "ad", "ae", "bc", "bd", "be"))
+            equalTo(listOf("ac", "ad", "ae", "bc", "bd", "be")),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun braceExpansionII2() {
         assertThat(
             Solution().braceExpansionII("{{a,z},a{b,c},{ab,z}}"),
-            equalTo(listOf("a", "ab", "ac", "z"))
+            equalTo(listOf("a", "ab", "ac", "z")),
         )
     }
 }
diff --git a/src/test/kotlin/g1101_1200/s1105_filling_bookcase_shelves/SolutionTest.kt b/src/test/kotlin/g1101_1200/s1105_filling_bookcase_shelves/SolutionTest.kt
index ab4f2199f..72627c0de 100644
--- a/src/test/kotlin/g1101_1200/s1105_filling_bookcase_shelves/SolutionTest.kt
+++ b/src/test/kotlin/g1101_1200/s1105_filling_bookcase_shelves/SolutionTest.kt
@@ -17,11 +17,11 @@ internal class SolutionTest {
                         intArrayOf(1, 1),
                         intArrayOf(1, 1),
                         intArrayOf(1, 1),
-                        intArrayOf(1, 2)
+                        intArrayOf(1, 2),
                     ),
-                    4
+                    4,
                 ),
-            equalTo(6)
+            equalTo(6),
         )
     }
 
@@ -29,7 +29,7 @@ internal class SolutionTest {
     fun minHeightShelves2() {
         assertThat(
             Solution().minHeightShelves(arrayOf(intArrayOf(1, 3), intArrayOf(2, 4), intArrayOf(3, 2)), 66),
-            equalTo(4)
+            equalTo(4),
         )
     }
 }
diff --git a/src/test/kotlin/g1101_1200/s1109_corporate_flight_bookings/SolutionTest.kt b/src/test/kotlin/g1101_1200/s1109_corporate_flight_bookings/SolutionTest.kt
index aa252b1cc..9af140bd4 100644
--- a/src/test/kotlin/g1101_1200/s1109_corporate_flight_bookings/SolutionTest.kt
+++ b/src/test/kotlin/g1101_1200/s1109_corporate_flight_bookings/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .corpFlightBookings(arrayOf(intArrayOf(1, 2, 10), intArrayOf(2, 3, 20), intArrayOf(2, 5, 25)), 5),
-            equalTo(intArrayOf(10, 55, 45, 25, 25))
+            equalTo(intArrayOf(10, 55, 45, 25, 25)),
         )
     }
 
@@ -18,7 +18,7 @@ internal class SolutionTest {
     fun corpFlightBookings2() {
         assertThat(
             Solution().corpFlightBookings(arrayOf(intArrayOf(1, 2, 10), intArrayOf(2, 2, 15)), 2),
-            equalTo(intArrayOf(10, 25))
+            equalTo(intArrayOf(10, 25)),
         )
     }
 }
diff --git a/src/test/kotlin/g1101_1200/s1110_delete_nodes_and_return_forest/SolutionTest.kt b/src/test/kotlin/g1101_1200/s1110_delete_nodes_and_return_forest/SolutionTest.kt
index 7d4a12673..6104062c8 100644
--- a/src/test/kotlin/g1101_1200/s1110_delete_nodes_and_return_forest/SolutionTest.kt
+++ b/src/test/kotlin/g1101_1200/s1110_delete_nodes_and_return_forest/SolutionTest.kt
@@ -16,10 +16,10 @@ internal class SolutionTest {
                 Arrays.asList<Any?>(
                     TreeNode.create(mutableListOf(1, 2, null, 4)),
                     TreeNode.create(listOf(6)),
-                    TreeNode.create(listOf(7))
+                    TreeNode.create(listOf(7)),
                 )
-                    .toString()
-            )
+                    .toString(),
+            ),
         )
     }
 
@@ -29,8 +29,8 @@ internal class SolutionTest {
         assertThat(
             Solution().delNodes(root, intArrayOf(3)).toString(),
             equalTo(
-                listOf<Any?>(TreeNode.create(mutableListOf<Int?>(1, 2, 4))).toString()
-            )
+                listOf<Any?>(TreeNode.create(mutableListOf<Int?>(1, 2, 4))).toString(),
+            ),
         )
     }
 }
diff --git a/src/test/kotlin/g1101_1200/s1111_maximum_nesting_depth_of_two_valid_parentheses_strings/SolutionTest.kt b/src/test/kotlin/g1101_1200/s1111_maximum_nesting_depth_of_two_valid_parentheses_strings/SolutionTest.kt
index 1200a5317..86df812b6 100644
--- a/src/test/kotlin/g1101_1200/s1111_maximum_nesting_depth_of_two_valid_parentheses_strings/SolutionTest.kt
+++ b/src/test/kotlin/g1101_1200/s1111_maximum_nesting_depth_of_two_valid_parentheses_strings/SolutionTest.kt
@@ -8,7 +8,8 @@ internal class SolutionTest {
     @Test
     fun maxDepthAfterSplit() {
         assertThat(
-            Solution().maxDepthAfterSplit("(()())"), equalTo(intArrayOf(1, 0, 0, 0, 0, 1))
+            Solution().maxDepthAfterSplit("(()())"),
+            equalTo(intArrayOf(1, 0, 0, 0, 0, 1)),
         )
     }
 
@@ -16,7 +17,7 @@ internal class SolutionTest {
     fun maxDepthAfterSplit2() {
         assertThat(
             Solution().maxDepthAfterSplit("()(())()"),
-            equalTo(intArrayOf(1, 1, 1, 0, 0, 1, 1, 1))
+            equalTo(intArrayOf(1, 1, 1, 0, 0, 1, 1, 1)),
         )
     }
 }
diff --git a/src/test/kotlin/g1101_1200/s1122_relative_sort_array/SolutionTest.kt b/src/test/kotlin/g1101_1200/s1122_relative_sort_array/SolutionTest.kt
index 33e79a6a3..ad58bea04 100644
--- a/src/test/kotlin/g1101_1200/s1122_relative_sort_array/SolutionTest.kt
+++ b/src/test/kotlin/g1101_1200/s1122_relative_sort_array/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .relativeSortArray(intArrayOf(2, 3, 1, 3, 2, 4, 6, 7, 9, 2, 19), intArrayOf(2, 1, 4, 3, 9, 6)),
-            equalTo(intArrayOf(2, 2, 2, 1, 4, 3, 3, 9, 6, 7, 19))
+            equalTo(intArrayOf(2, 2, 2, 1, 4, 3, 3, 9, 6, 7, 19)),
         )
     }
 
@@ -19,7 +19,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .relativeSortArray(intArrayOf(28, 6, 22, 8, 44, 17), intArrayOf(22, 28, 8, 6)),
-            equalTo(intArrayOf(22, 28, 8, 6, 17, 44))
+            equalTo(intArrayOf(22, 28, 8, 6, 17, 44)),
         )
     }
 }
diff --git a/src/test/kotlin/g1101_1200/s1123_lowest_common_ancestor_of_deepest_leaves/SolutionTest.kt b/src/test/kotlin/g1101_1200/s1123_lowest_common_ancestor_of_deepest_leaves/SolutionTest.kt
index fac0c5662..c60a49331 100644
--- a/src/test/kotlin/g1101_1200/s1123_lowest_common_ancestor_of_deepest_leaves/SolutionTest.kt
+++ b/src/test/kotlin/g1101_1200/s1123_lowest_common_ancestor_of_deepest_leaves/SolutionTest.kt
@@ -11,10 +11,10 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .lcaDeepestLeaves(
-                    TreeNode.create(mutableListOf(3, 5, 1, 6, 2, 0, 8, null, null, 7, 4))
+                    TreeNode.create(mutableListOf(3, 5, 1, 6, 2, 0, 8, null, null, 7, 4)),
                 )
                 .toString(),
-            equalTo("2,7,4")
+            equalTo("2,7,4"),
         )
     }
 
@@ -22,7 +22,7 @@ internal class SolutionTest {
     fun lcaDeepestLeaves2() {
         assertThat(
             Solution().lcaDeepestLeaves(TreeNode.create(mutableListOf<Int?>(1))).toString(),
-            equalTo("1")
+            equalTo("1"),
         )
     }
 
@@ -32,7 +32,7 @@ internal class SolutionTest {
             Solution()
                 .lcaDeepestLeaves(TreeNode.create(mutableListOf(0, 1, 3, null, 2)))
                 .toString(),
-            equalTo("2")
+            equalTo("2"),
         )
     }
 }
diff --git a/src/test/kotlin/g1101_1200/s1125_smallest_sufficient_team/SolutionTest.kt b/src/test/kotlin/g1101_1200/s1125_smallest_sufficient_team/SolutionTest.kt
index 14af06ee9..398ba90d8 100644
--- a/src/test/kotlin/g1101_1200/s1125_smallest_sufficient_team/SolutionTest.kt
+++ b/src/test/kotlin/g1101_1200/s1125_smallest_sufficient_team/SolutionTest.kt
@@ -12,9 +12,9 @@ internal class SolutionTest {
             Solution()
                 .smallestSufficientTeam(
                     arrayOf("java", "nodejs", "reactjs"),
-                    getLists(arrayOf(arrayOf("java"), arrayOf("nodejs"), arrayOf("nodejs", "reactjs")))
+                    getLists(arrayOf(arrayOf("java"), arrayOf("nodejs"), arrayOf("nodejs", "reactjs"))),
                 ),
-            equalTo(intArrayOf(0, 2))
+            equalTo(intArrayOf(0, 2)),
         )
     }
 
@@ -24,7 +24,12 @@ internal class SolutionTest {
             Solution()
                 .smallestSufficientTeam(
                     arrayOf(
-                        "algorithms", "math", "java", "reactjs", "csharp", "aws"
+                        "algorithms",
+                        "math",
+                        "java",
+                        "reactjs",
+                        "csharp",
+                        "aws",
                     ),
                     getLists(
                         arrayOf(
@@ -33,11 +38,11 @@ internal class SolutionTest {
                             arrayOf("java", "csharp", "aws"),
                             arrayOf("reactjs", "csharp"),
                             arrayOf("csharp", "math"),
-                            arrayOf("aws", "java")
-                        )
-                    )
+                            arrayOf("aws", "java"),
+                        ),
+                    ),
                 ),
-            equalTo(intArrayOf(1, 2))
+            equalTo(intArrayOf(1, 2)),
         )
     }
 }
diff --git a/src/test/kotlin/g1101_1200/s1128_number_of_equivalent_domino_pairs/SolutionTest.kt b/src/test/kotlin/g1101_1200/s1128_number_of_equivalent_domino_pairs/SolutionTest.kt
index 33db541f8..bf25bdb9d 100644
--- a/src/test/kotlin/g1101_1200/s1128_number_of_equivalent_domino_pairs/SolutionTest.kt
+++ b/src/test/kotlin/g1101_1200/s1128_number_of_equivalent_domino_pairs/SolutionTest.kt
@@ -13,10 +13,10 @@ internal class SolutionTest {
                     intArrayOf(1, 2),
                     intArrayOf(2, 1),
                     intArrayOf(3, 4),
-                    intArrayOf(5, 6)
-                )
+                    intArrayOf(5, 6),
+                ),
             ),
-            equalTo(1)
+            equalTo(1),
         )
     }
 
@@ -30,10 +30,10 @@ internal class SolutionTest {
                         intArrayOf(1, 2),
                         intArrayOf(1, 1),
                         intArrayOf(1, 2),
-                        intArrayOf(2, 2)
-                    )
+                        intArrayOf(2, 2),
+                    ),
                 ),
-            equalTo(3)
+            equalTo(3),
         )
     }
 }
diff --git a/src/test/kotlin/g1101_1200/s1129_shortest_path_with_alternating_colors/SolutionTest.kt b/src/test/kotlin/g1101_1200/s1129_shortest_path_with_alternating_colors/SolutionTest.kt
index dd5d6729b..ab1c78f23 100644
--- a/src/test/kotlin/g1101_1200/s1129_shortest_path_with_alternating_colors/SolutionTest.kt
+++ b/src/test/kotlin/g1101_1200/s1129_shortest_path_with_alternating_colors/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .shortestAlternatingPaths(3, arrayOf(intArrayOf(0, 1), intArrayOf(1, 2)), arrayOf()),
-            equalTo(intArrayOf(0, 1, -1))
+            equalTo(intArrayOf(0, 1, -1)),
         )
     }
 
@@ -19,7 +19,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .shortestAlternatingPaths(3, arrayOf(intArrayOf(0, 1)), arrayOf(intArrayOf(2, 1))),
-            equalTo(intArrayOf(0, 1, -1))
+            equalTo(intArrayOf(0, 1, -1)),
         )
     }
 }
diff --git a/src/test/kotlin/g1101_1200/s1131_maximum_of_absolute_value_expression/SolutionTest.kt b/src/test/kotlin/g1101_1200/s1131_maximum_of_absolute_value_expression/SolutionTest.kt
index 9c6fd74dc..17eb030c2 100644
--- a/src/test/kotlin/g1101_1200/s1131_maximum_of_absolute_value_expression/SolutionTest.kt
+++ b/src/test/kotlin/g1101_1200/s1131_maximum_of_absolute_value_expression/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun maxAbsValExpr() {
         assertThat(
             Solution().maxAbsValExpr(intArrayOf(1, 2, 3, 4), intArrayOf(-1, 4, 5, 6)),
-            equalTo(13)
+            equalTo(13),
         )
     }
 
@@ -18,7 +18,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .maxAbsValExpr(intArrayOf(1, -2, -5, 0, 10), intArrayOf(0, -2, -1, -7, -4)),
-            equalTo(20)
+            equalTo(20),
         )
     }
 }
diff --git a/src/test/kotlin/g1101_1200/s1139_largest_1_bordered_square/SolutionTest.kt b/src/test/kotlin/g1101_1200/s1139_largest_1_bordered_square/SolutionTest.kt
index d96ae417e..6c958a6ea 100644
--- a/src/test/kotlin/g1101_1200/s1139_largest_1_bordered_square/SolutionTest.kt
+++ b/src/test/kotlin/g1101_1200/s1139_largest_1_bordered_square/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .largest1BorderedSquare(arrayOf(intArrayOf(1, 1, 1), intArrayOf(1, 0, 1), intArrayOf(1, 1, 1))),
-            equalTo(9)
+            equalTo(9),
         )
     }
 
@@ -18,7 +18,7 @@ internal class SolutionTest {
     fun largest1BorderedSquare2() {
         assertThat(
             Solution().largest1BorderedSquare(arrayOf(intArrayOf(1, 1, 0, 0))),
-            equalTo(1)
+            equalTo(1),
         )
     }
 }
diff --git a/src/test/kotlin/g1101_1200/s1141_user_activity_for_the_past_30_days_i/MysqlTest.kt b/src/test/kotlin/g1101_1200/s1141_user_activity_for_the_past_30_days_i/MysqlTest.kt
index 0db8a0bd8..364b746b3 100644
--- a/src/test/kotlin/g1101_1200/s1141_user_activity_for_the_past_30_days_i/MysqlTest.kt
+++ b/src/test/kotlin/g1101_1200/s1141_user_activity_for_the_past_30_days_i/MysqlTest.kt
@@ -39,8 +39,8 @@ import javax.sql.DataSource
             "INSERT INTO activity(user_id, session_id, activity_date, activity_type)" +
             " VALUES (4, 3, ' 2019-06-25', 'open_session'); " +
             "INSERT INTO activity(user_id, session_id, activity_date, activity_type)" +
-            " VALUES (4, 3, ' 2019-06-25', 'end_session'); "
-    ]
+            " VALUES (4, 3, ' 2019-06-25', 'end_session'); ",
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -52,12 +52,12 @@ internal class MysqlTest {
                     BufferedReader(
                         FileReader(
                             "src/main/kotlin/g1101_1200/s1141_user_activity_" +
-                                "for_the_past_30_days_i/script.sql"
-                        )
+                                "for_the_past_30_days_i/script.sql",
+                        ),
                     )
                         .lines()
                         .collect(Collectors.joining("\n"))
-                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace("#.*?\\r?\\n".toRegex(), ""),
                 ).use { resultSet ->
                     assertThat(resultSet.next(), equalTo(true))
                     assertThat(resultSet.getNString(1), equalTo("2019-07-20"))
diff --git a/src/test/kotlin/g1101_1200/s1147_longest_chunked_palindrome_decomposition/SolutionTest.kt b/src/test/kotlin/g1101_1200/s1147_longest_chunked_palindrome_decomposition/SolutionTest.kt
index e05ad56b9..416e858dc 100644
--- a/src/test/kotlin/g1101_1200/s1147_longest_chunked_palindrome_decomposition/SolutionTest.kt
+++ b/src/test/kotlin/g1101_1200/s1147_longest_chunked_palindrome_decomposition/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun longestDecomposition() {
         assertThat(
             Solution().longestDecomposition("ghiabcdefhelloadamhelloabcdefghi"),
-            equalTo(7)
+            equalTo(7),
         )
     }
 
diff --git a/src/test/kotlin/g1101_1200/s1148_article_views_i/MysqlTest.kt b/src/test/kotlin/g1101_1200/s1148_article_views_i/MysqlTest.kt
index b0c9b8a21..d86904481 100644
--- a/src/test/kotlin/g1101_1200/s1148_article_views_i/MysqlTest.kt
+++ b/src/test/kotlin/g1101_1200/s1148_article_views_i/MysqlTest.kt
@@ -31,8 +31,8 @@ import javax.sql.DataSource
             "INSERT INTO views(article_id, author_id, viewer_id, view_date)" +
             " VALUES (3, 4, 4, '2019-07-21'); " +
             "INSERT INTO views(article_id, author_id, viewer_id, view_date)" +
-            " VALUES (3, 4, 4, '2019-07-21'); "
-    ]
+            " VALUES (3, 4, 4, '2019-07-21'); ",
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -44,12 +44,12 @@ internal class MysqlTest {
                     BufferedReader(
                         FileReader(
                             "src/main/kotlin/g1101_1200/s1148" +
-                                "_article_views_i/script.sql"
-                        )
+                                "_article_views_i/script.sql",
+                        ),
                     )
                         .lines()
                         .collect(Collectors.joining("\n"))
-                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace("#.*?\\r?\\n".toRegex(), ""),
                 ).use { resultSet ->
                     assertThat(resultSet.next(), equalTo(true))
                     assertThat(resultSet.getInt(1), equalTo(4))
diff --git a/src/test/kotlin/g1101_1200/s1158_market_analysis_i/MysqlTest.kt b/src/test/kotlin/g1101_1200/s1158_market_analysis_i/MysqlTest.kt
index 35c79bb42..abd503a51 100644
--- a/src/test/kotlin/g1101_1200/s1158_market_analysis_i/MysqlTest.kt
+++ b/src/test/kotlin/g1101_1200/s1158_market_analysis_i/MysqlTest.kt
@@ -43,8 +43,8 @@ import javax.sql.DataSource
             "INSERT INTO items(item_id, item_brand) VALUES (1, 'Samsung'); " +
             "INSERT INTO items(item_id, item_brand) VALUES (2, 'Lenovo'); " +
             "INSERT INTO items(item_id, item_brand) VALUES (3, 'LG'); " +
-            "INSERT INTO items(item_id, item_brand) VALUES (4, 'HP'); "
-    ]
+            "INSERT INTO items(item_id, item_brand) VALUES (4, 'HP'); ",
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -56,12 +56,12 @@ internal class MysqlTest {
                     BufferedReader(
                         FileReader(
                             "src/main/kotlin/g1101_1200/s1158_" +
-                                "market_analysis_i/script.sql"
-                        )
+                                "market_analysis_i/script.sql",
+                        ),
                     )
                         .lines()
                         .collect(Collectors.joining("\n"))
-                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace("#.*?\\r?\\n".toRegex(), ""),
                 ).use { resultSet ->
                     assertThat(resultSet.next(), equalTo(true))
                     assertThat(resultSet.getInt(1), equalTo(1))
diff --git a/src/test/kotlin/g1101_1200/s1160_find_words_that_can_be_formed_by_characters/SolutionTest.kt b/src/test/kotlin/g1101_1200/s1160_find_words_that_can_be_formed_by_characters/SolutionTest.kt
index 216782979..0bd4e1626 100644
--- a/src/test/kotlin/g1101_1200/s1160_find_words_that_can_be_formed_by_characters/SolutionTest.kt
+++ b/src/test/kotlin/g1101_1200/s1160_find_words_that_can_be_formed_by_characters/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun countCharacters() {
         assertThat(
             Solution().countCharacters(arrayOf("cat", "bt", "hat", "tree"), "atach"),
-            equalTo(6)
+            equalTo(6),
         )
     }
 
@@ -18,7 +18,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .countCharacters(arrayOf("hello", "world", "leetcode"), "welldonehoneyr"),
-            equalTo(10)
+            equalTo(10),
         )
     }
 }
diff --git a/src/test/kotlin/g1101_1200/s1161_maximum_level_sum_of_a_binary_tree/SolutionTest.kt b/src/test/kotlin/g1101_1200/s1161_maximum_level_sum_of_a_binary_tree/SolutionTest.kt
index ab1d1b568..07c9ddc8a 100644
--- a/src/test/kotlin/g1101_1200/s1161_maximum_level_sum_of_a_binary_tree/SolutionTest.kt
+++ b/src/test/kotlin/g1101_1200/s1161_maximum_level_sum_of_a_binary_tree/SolutionTest.kt
@@ -15,7 +15,7 @@ internal class SolutionTest {
     @Test
     fun maxLevelSum2() {
         val root = TreeNode.create(
-            listOf(989, null, 10250, 98693, -89388, null, null, null, -32127)
+            listOf(989, null, 10250, 98693, -89388, null, null, null, -32127),
         )
         assertThat(Solution().maxLevelSum(root), equalTo(2))
     }
diff --git a/src/test/kotlin/g1101_1200/s1162_as_far_from_land_as_possible/SolutionTest.kt b/src/test/kotlin/g1101_1200/s1162_as_far_from_land_as_possible/SolutionTest.kt
index f665a4e5f..4eaa43d05 100644
--- a/src/test/kotlin/g1101_1200/s1162_as_far_from_land_as_possible/SolutionTest.kt
+++ b/src/test/kotlin/g1101_1200/s1162_as_far_from_land_as_possible/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun maxDistance() {
         assertThat(
             Solution().maxDistance(arrayOf(intArrayOf(1, 0, 1), intArrayOf(0, 0, 0), intArrayOf(1, 0, 1))),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun maxDistance2() {
         assertThat(
             Solution().maxDistance(arrayOf(intArrayOf(1, 0, 0), intArrayOf(0, 0, 0), intArrayOf(0, 0, 0))),
-            equalTo(4)
+            equalTo(4),
         )
     }
 }
diff --git a/src/test/kotlin/g1101_1200/s1164_product_price_at_a_given_date/MysqlTest.kt b/src/test/kotlin/g1101_1200/s1164_product_price_at_a_given_date/MysqlTest.kt
index e9bb94d87..fe3e031ff 100644
--- a/src/test/kotlin/g1101_1200/s1164_product_price_at_a_given_date/MysqlTest.kt
+++ b/src/test/kotlin/g1101_1200/s1164_product_price_at_a_given_date/MysqlTest.kt
@@ -28,8 +28,8 @@ import javax.sql.DataSource
             "INSERT INTO Products(product_id, new_price, change_date)" +
             " VALUES (2, 65, '2019-08-17'); " +
             "INSERT INTO Products(product_id, new_price, change_date)" +
-            " VALUES (3, 20, '2019-08-18'); "
-    ]
+            " VALUES (3, 20, '2019-08-18'); ",
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -41,12 +41,12 @@ internal class MysqlTest {
                     BufferedReader(
                         FileReader(
                             "src/main/kotlin/g1101_1200/s1164_product_price_at_a_given_date" +
-                                "/script.sql"
-                        )
+                                "/script.sql",
+                        ),
                     )
                         .lines()
                         .collect(Collectors.joining("\n"))
-                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace("#.*?\\r?\\n".toRegex(), ""),
                 ).use { resultSet ->
                     assertThat(resultSet.next(), equalTo(true))
                     assertThat(resultSet.getInt(1), equalTo(1))
diff --git a/src/test/kotlin/g1101_1200/s1169_invalid_transactions/SolutionTest.kt b/src/test/kotlin/g1101_1200/s1169_invalid_transactions/SolutionTest.kt
index 6f65dc7d7..93bda875c 100644
--- a/src/test/kotlin/g1101_1200/s1169_invalid_transactions/SolutionTest.kt
+++ b/src/test/kotlin/g1101_1200/s1169_invalid_transactions/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .invalidTransactions(arrayOf("alice,20,800,mtv", "alice,50,100,beijing")),
-            equalTo(mutableListOf("alice,20,800,mtv", "alice,50,100,beijing"))
+            equalTo(mutableListOf("alice,20,800,mtv", "alice,50,100,beijing")),
         )
     }
 
@@ -19,7 +19,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .invalidTransactions(arrayOf("alice,20,800,mtv", "alice,50,1200,mtv")),
-            equalTo(listOf("alice,50,1200,mtv"))
+            equalTo(listOf("alice,50,1200,mtv")),
         )
     }
 
@@ -28,7 +28,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .invalidTransactions(arrayOf("alice,20,800,mtv", "bob,50,1200,mtv")),
-            equalTo(listOf("bob,50,1200,mtv"))
+            equalTo(listOf("bob,50,1200,mtv")),
         )
     }
 }
diff --git a/src/test/kotlin/g1101_1200/s1170_compare_strings_by_frequency_of_the_smallest_character/SolutionTest.kt b/src/test/kotlin/g1101_1200/s1170_compare_strings_by_frequency_of_the_smallest_character/SolutionTest.kt
index f382f2483..9a64640b8 100644
--- a/src/test/kotlin/g1101_1200/s1170_compare_strings_by_frequency_of_the_smallest_character/SolutionTest.kt
+++ b/src/test/kotlin/g1101_1200/s1170_compare_strings_by_frequency_of_the_smallest_character/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun numSmallerByFrequency() {
         assertThat(
             Solution().numSmallerByFrequency(arrayOf("cbd"), arrayOf("zaaaz")),
-            equalTo(intArrayOf(1))
+            equalTo(intArrayOf(1)),
         )
     }
 
@@ -18,7 +18,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .numSmallerByFrequency(arrayOf("bbb", "cc"), arrayOf("a", "aa", "aaa", "aaaa")),
-            equalTo(intArrayOf(1, 2))
+            equalTo(intArrayOf(1, 2)),
         )
     }
 }
diff --git a/src/test/kotlin/g1101_1200/s1171_remove_zero_sum_consecutive_nodes_from_linked_list/SolutionTest.kt b/src/test/kotlin/g1101_1200/s1171_remove_zero_sum_consecutive_nodes_from_linked_list/SolutionTest.kt
index 591599bef..005bbb8e9 100644
--- a/src/test/kotlin/g1101_1200/s1171_remove_zero_sum_consecutive_nodes_from_linked_list/SolutionTest.kt
+++ b/src/test/kotlin/g1101_1200/s1171_remove_zero_sum_consecutive_nodes_from_linked_list/SolutionTest.kt
@@ -12,7 +12,7 @@ internal class SolutionTest {
         val expected = contructLinkedList(intArrayOf(3, 1))
         assertThat(
             Solution().removeZeroSumSublists(head).toString(),
-            equalTo(expected.toString())
+            equalTo(expected.toString()),
         )
     }
 
@@ -22,7 +22,7 @@ internal class SolutionTest {
         val expected = contructLinkedList(intArrayOf(1, 2, 4))
         assertThat(
             Solution().removeZeroSumSublists(head).toString(),
-            equalTo(expected.toString())
+            equalTo(expected.toString()),
         )
     }
 
@@ -32,7 +32,7 @@ internal class SolutionTest {
         val expected = contructLinkedList(intArrayOf(1))
         assertThat(
             Solution().removeZeroSumSublists(head).toString(),
-            equalTo(expected.toString())
+            equalTo(expected.toString()),
         )
     }
 }
diff --git a/src/test/kotlin/g1101_1200/s1174_immediate_food_delivery_ii/MysqlTest.kt b/src/test/kotlin/g1101_1200/s1174_immediate_food_delivery_ii/MysqlTest.kt
index 6390a263d..7857b12a8 100644
--- a/src/test/kotlin/g1101_1200/s1174_immediate_food_delivery_ii/MysqlTest.kt
+++ b/src/test/kotlin/g1101_1200/s1174_immediate_food_delivery_ii/MysqlTest.kt
@@ -31,8 +31,8 @@ import javax.sql.DataSource
             "INSERT INTO Delivery(delivery_id, customer_id, order_date, customer_pref_delivery_date)" +
             " VALUES (6, 2, '2019-08-11', '2019-08-13'); " +
             "INSERT INTO Delivery(delivery_id, customer_id, order_date, customer_pref_delivery_date)" +
-            " VALUES (7, 4, '2019-08-09', '2019-08-09'); "
-    ]
+            " VALUES (7, 4, '2019-08-09', '2019-08-09'); ",
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -44,12 +44,12 @@ internal class MysqlTest {
                     BufferedReader(
                         FileReader(
                             "src/main/kotlin/g1101_1200/s1174_immediate_food_delivery_ii" +
-                                "/script.sql"
-                        )
+                                "/script.sql",
+                        ),
                     )
                         .lines()
                         .collect(Collectors.joining("\n"))
-                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace("#.*?\\r?\\n".toRegex(), ""),
                 ).use { resultSet ->
                     assertThat(resultSet.next(), equalTo(true))
                     assertThat(resultSet.getDouble(1), equalTo(50.00))
diff --git a/src/test/kotlin/g1101_1200/s1177_can_make_palindrome_from_substring/SolutionTest.kt b/src/test/kotlin/g1101_1200/s1177_can_make_palindrome_from_substring/SolutionTest.kt
index 5002d13b6..88f93a98a 100644
--- a/src/test/kotlin/g1101_1200/s1177_can_make_palindrome_from_substring/SolutionTest.kt
+++ b/src/test/kotlin/g1101_1200/s1177_can_make_palindrome_from_substring/SolutionTest.kt
@@ -16,10 +16,10 @@ internal class SolutionTest {
                         intArrayOf(1, 2, 0),
                         intArrayOf(0, 3, 1),
                         intArrayOf(0, 3, 2),
-                        intArrayOf(0, 4, 1)
-                    )
+                        intArrayOf(0, 4, 1),
+                    ),
                 ),
-            equalTo(mutableListOf(true, false, false, true, true))
+            equalTo(mutableListOf(true, false, false, true, true)),
         )
     }
 
@@ -27,7 +27,7 @@ internal class SolutionTest {
     fun canMakePaliQueries2() {
         assertThat(
             Solution().canMakePaliQueries("lyb  ", arrayOf(intArrayOf(0, 1, 0), intArrayOf(2, 2, 1))),
-            equalTo(mutableListOf(false, true))
+            equalTo(mutableListOf(false, true)),
         )
     }
 }
diff --git a/src/test/kotlin/g1101_1200/s1178_number_of_valid_words_for_each_puzzle/SolutionTest.kt b/src/test/kotlin/g1101_1200/s1178_number_of_valid_words_for_each_puzzle/SolutionTest.kt
index 8b0175147..0e66a4352 100644
--- a/src/test/kotlin/g1101_1200/s1178_number_of_valid_words_for_each_puzzle/SolutionTest.kt
+++ b/src/test/kotlin/g1101_1200/s1178_number_of_valid_words_for_each_puzzle/SolutionTest.kt
@@ -11,13 +11,24 @@ internal class SolutionTest {
             Solution()
                 .findNumOfValidWords(
                     arrayOf(
-                        "aaaa", "asas", "able", "ability", "actt", "actor", "access"
+                        "aaaa",
+                        "asas",
+                        "able",
+                        "ability",
+                        "actt",
+                        "actor",
+                        "access",
                     ),
                     arrayOf(
-                        "aboveyz", "abrodyz", "abslute", "absoryz", "actresz", "gaswxyz"
-                    )
+                        "aboveyz",
+                        "abrodyz",
+                        "abslute",
+                        "absoryz",
+                        "actresz",
+                        "gaswxyz",
+                    ),
                 ),
-            equalTo(mutableListOf(1, 1, 3, 2, 4, 0))
+            equalTo(mutableListOf(1, 1, 3, 2, 4, 0)),
         )
     }
 
@@ -28,10 +39,14 @@ internal class SolutionTest {
                 .findNumOfValidWords(
                     arrayOf("apple", "pleas", "please"),
                     arrayOf(
-                        "aelwxyz", "aelpxyz", "aelpsxy", "saelpxy", "xaelpsy"
-                    )
+                        "aelwxyz",
+                        "aelpxyz",
+                        "aelpsxy",
+                        "saelpxy",
+                        "xaelpsy",
+                    ),
                 ),
-            equalTo(mutableListOf(0, 1, 3, 2, 0))
+            equalTo(mutableListOf(0, 1, 3, 2, 0)),
         )
     }
 }
diff --git a/src/test/kotlin/g1101_1200/s1179_reformat_department_table/MysqlTest.kt b/src/test/kotlin/g1101_1200/s1179_reformat_department_table/MysqlTest.kt
index d6256772a..ed7d68932 100644
--- a/src/test/kotlin/g1101_1200/s1179_reformat_department_table/MysqlTest.kt
+++ b/src/test/kotlin/g1101_1200/s1179_reformat_department_table/MysqlTest.kt
@@ -26,8 +26,8 @@ import javax.sql.DataSource
             "INSERT INTO department(id, revenue, \"month\")" +
             " VALUES (1, 7000, 'Feb'); " +
             "INSERT INTO department(id, revenue, \"month\")" +
-            " VALUES (1, 6000, 'Mar'); "
-    ]
+            " VALUES (1, 6000, 'Mar'); ",
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -39,12 +39,12 @@ internal class MysqlTest {
                     BufferedReader(
                         FileReader(
                             "src/main/kotlin/g1101_1200/s1179_reformat_" +
-                                "department_table/script.sql"
-                        )
+                                "department_table/script.sql",
+                        ),
                     )
                         .lines()
                         .collect(Collectors.joining("\n"))
-                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace("#.*?\\r?\\n".toRegex(), ""),
                 ).use { resultSet ->
                     assertThat(resultSet.next(), equalTo(true))
                     assertThat(resultSet.getInt(1), equalTo(1))
diff --git a/src/test/kotlin/g1101_1200/s1184_distance_between_bus_stops/SolutionTest.kt b/src/test/kotlin/g1101_1200/s1184_distance_between_bus_stops/SolutionTest.kt
index a706963c5..7ba7b071d 100644
--- a/src/test/kotlin/g1101_1200/s1184_distance_between_bus_stops/SolutionTest.kt
+++ b/src/test/kotlin/g1101_1200/s1184_distance_between_bus_stops/SolutionTest.kt
@@ -8,21 +8,24 @@ internal class SolutionTest {
     @Test
     fun distanceBetweenBusStops() {
         assertThat(
-            Solution().distanceBetweenBusStops(intArrayOf(1, 2, 3, 4), 0, 1), equalTo(1)
+            Solution().distanceBetweenBusStops(intArrayOf(1, 2, 3, 4), 0, 1),
+            equalTo(1),
         )
     }
 
     @Test
     fun distanceBetweenBusStops2() {
         assertThat(
-            Solution().distanceBetweenBusStops(intArrayOf(1, 2, 3, 4), 0, 2), equalTo(3)
+            Solution().distanceBetweenBusStops(intArrayOf(1, 2, 3, 4), 0, 2),
+            equalTo(3),
         )
     }
 
     @Test
     fun distanceBetweenBusStops3() {
         assertThat(
-            Solution().distanceBetweenBusStops(intArrayOf(1, 2, 3, 4), 0, 3), equalTo(4)
+            Solution().distanceBetweenBusStops(intArrayOf(1, 2, 3, 4), 0, 3),
+            equalTo(4),
         )
     }
 }
diff --git a/src/test/kotlin/g1101_1200/s1187_make_array_strictly_increasing/SolutionTest.kt b/src/test/kotlin/g1101_1200/s1187_make_array_strictly_increasing/SolutionTest.kt
index 41d14a49a..d25c52a49 100644
--- a/src/test/kotlin/g1101_1200/s1187_make_array_strictly_increasing/SolutionTest.kt
+++ b/src/test/kotlin/g1101_1200/s1187_make_array_strictly_increasing/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .makeArrayIncreasing(intArrayOf(1, 5, 3, 6, 7), intArrayOf(1, 3, 2, 4)),
-            equalTo(1)
+            equalTo(1),
         )
     }
 
@@ -18,7 +18,7 @@ internal class SolutionTest {
     fun makeArrayIncreasing2() {
         assertThat(
             Solution().makeArrayIncreasing(intArrayOf(1, 5, 3, 6, 7), intArrayOf(4, 3, 1)),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -27,7 +27,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .makeArrayIncreasing(intArrayOf(1, 5, 3, 6, 7), intArrayOf(1, 6, 3, 3)),
-            equalTo(-1)
+            equalTo(-1),
         )
     }
 }
diff --git a/src/test/kotlin/g1101_1200/s1192_critical_connections_in_a_network/SolutionTest.kt b/src/test/kotlin/g1101_1200/s1192_critical_connections_in_a_network/SolutionTest.kt
index 588520b65..5ea8e7772 100644
--- a/src/test/kotlin/g1101_1200/s1192_critical_connections_in_a_network/SolutionTest.kt
+++ b/src/test/kotlin/g1101_1200/s1192_critical_connections_in_a_network/SolutionTest.kt
@@ -12,9 +12,9 @@ internal class SolutionTest {
             Solution()
                 .criticalConnections(
                     4,
-                    getLists(arrayOf(intArrayOf(0, 1), intArrayOf(1, 2), intArrayOf(2, 0), intArrayOf(1, 3)))
+                    getLists(arrayOf(intArrayOf(0, 1), intArrayOf(1, 2), intArrayOf(2, 0), intArrayOf(1, 3))),
                 ),
-            equalTo(getLists(arrayOf(intArrayOf(3, 1))))
+            equalTo(getLists(arrayOf(intArrayOf(3, 1)))),
         )
     }
 
@@ -22,7 +22,7 @@ internal class SolutionTest {
     fun criticalConnections2() {
         assertThat(
             Solution().criticalConnections(2, getLists(arrayOf(intArrayOf(0, 1)))),
-            equalTo(getLists(arrayOf(intArrayOf(1, 0))))
+            equalTo(getLists(arrayOf(intArrayOf(1, 0)))),
         )
     }
 }
diff --git a/src/test/kotlin/g1101_1200/s1193_monthly_transactions_i/MysqlTest.kt b/src/test/kotlin/g1101_1200/s1193_monthly_transactions_i/MysqlTest.kt
index d343ffdf6..aae3b3a81 100644
--- a/src/test/kotlin/g1101_1200/s1193_monthly_transactions_i/MysqlTest.kt
+++ b/src/test/kotlin/g1101_1200/s1193_monthly_transactions_i/MysqlTest.kt
@@ -24,8 +24,8 @@ import javax.sql.DataSource
             "INSERT INTO Transactions(id, country, state, amount, trans_date)" +
             " VALUES (123, 'US', 'approved', 2000, '2019-01-01'); " +
             "INSERT INTO Transactions(id, country, state, amount, trans_date)" +
-            " VALUES (124, 'DE', 'approved', 2000, '2019-01-07'); "
-    ]
+            " VALUES (124, 'DE', 'approved', 2000, '2019-01-07'); ",
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -37,12 +37,12 @@ internal class MysqlTest {
                     BufferedReader(
                         FileReader(
                             "src/main/kotlin/g1101_1200/s1193_monthly_transactions_i" +
-                                "/script.sql"
-                        )
+                                "/script.sql",
+                        ),
                     )
                         .lines()
                         .collect(Collectors.joining("\n"))
-                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace("#.*?\\r?\\n".toRegex(), ""),
                 ).use { resultSet ->
                     assertThat(resultSet.next(), equalTo(true))
                     assertThat(resultSet.getNString(1), equalTo("2018-12"))
diff --git a/src/test/kotlin/g1101_1200/s1200_minimum_absolute_difference/SolutionTest.kt b/src/test/kotlin/g1101_1200/s1200_minimum_absolute_difference/SolutionTest.kt
index 5bcce0670..17c19931c 100644
--- a/src/test/kotlin/g1101_1200/s1200_minimum_absolute_difference/SolutionTest.kt
+++ b/src/test/kotlin/g1101_1200/s1200_minimum_absolute_difference/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
     fun minimumAbsDifference() {
         assertThat(
             Solution().minimumAbsDifference(intArrayOf(4, 2, 1, 3)),
-            equalTo(getLists(arrayOf(intArrayOf(1, 2), intArrayOf(2, 3), intArrayOf(3, 4))))
+            equalTo(getLists(arrayOf(intArrayOf(1, 2), intArrayOf(2, 3), intArrayOf(3, 4)))),
         )
     }
 
@@ -18,7 +18,7 @@ internal class SolutionTest {
     fun minimumAbsDifference2() {
         assertThat(
             Solution().minimumAbsDifference(intArrayOf(1, 3, 6, 10, 15)),
-            equalTo(getLists(arrayOf(intArrayOf(1, 3))))
+            equalTo(getLists(arrayOf(intArrayOf(1, 3)))),
         )
     }
 
@@ -26,7 +26,7 @@ internal class SolutionTest {
     fun minimumAbsDifference3() {
         assertThat(
             Solution().minimumAbsDifference(intArrayOf(3, 8, -10, 23, 19, -4, -14, 27)),
-            equalTo(getLists(arrayOf(intArrayOf(-14, -10), intArrayOf(19, 23), intArrayOf(23, 27))))
+            equalTo(getLists(arrayOf(intArrayOf(-14, -10), intArrayOf(19, 23), intArrayOf(23, 27)))),
         )
     }
 }
diff --git a/src/test/kotlin/g1201_1300/s1202_smallest_string_with_swaps/SolutionTest.kt b/src/test/kotlin/g1201_1300/s1202_smallest_string_with_swaps/SolutionTest.kt
index 2cd6029d6..1783152cd 100644
--- a/src/test/kotlin/g1201_1300/s1202_smallest_string_with_swaps/SolutionTest.kt
+++ b/src/test/kotlin/g1201_1300/s1202_smallest_string_with_swaps/SolutionTest.kt
@@ -10,9 +10,10 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .smallestStringWithSwaps(
-                    "dcab", listOf(listOf(0, 3), listOf(1, 2))
+                    "dcab",
+                    listOf(listOf(0, 3), listOf(1, 2)),
                 ),
-            equalTo("bacd")
+            equalTo("bacd"),
         )
     }
 
@@ -25,10 +26,10 @@ internal class SolutionTest {
                     listOf(
                         listOf(0, 3),
                         listOf(1, 2),
-                        listOf(0, 2)
-                    )
+                        listOf(0, 2),
+                    ),
                 ),
-            equalTo("abcd")
+            equalTo("abcd"),
         )
     }
 
@@ -37,9 +38,10 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .smallestStringWithSwaps(
-                    "cba", listOf(listOf(0, 1), listOf(1, 2))
+                    "cba",
+                    listOf(listOf(0, 1), listOf(1, 2)),
                 ),
-            equalTo("abc")
+            equalTo("abc"),
         )
     }
 }
diff --git a/src/test/kotlin/g1201_1300/s1203_sort_items_by_groups_respecting_dependencies/SolutionTest.kt b/src/test/kotlin/g1201_1300/s1203_sort_items_by_groups_respecting_dependencies/SolutionTest.kt
index 6c5f3be09..cfca67d22 100644
--- a/src/test/kotlin/g1201_1300/s1203_sort_items_by_groups_respecting_dependencies/SolutionTest.kt
+++ b/src/test/kotlin/g1201_1300/s1203_sort_items_by_groups_respecting_dependencies/SolutionTest.kt
@@ -11,13 +11,20 @@ internal class SolutionTest {
             Solution()
                 .sortItems(
                     8,
-                    2, intArrayOf(-1, -1, 1, 0, 0, 1, 0, -1),
+                    2,
+                    intArrayOf(-1, -1, 1, 0, 0, 1, 0, -1),
                     listOf(
-                        emptyList(), listOf(6), listOf(5), listOf(6),
-                        listOf(3, 6), emptyList(), emptyList(), emptyList()
-                    )
+                        emptyList(),
+                        listOf(6),
+                        listOf(5),
+                        listOf(6),
+                        listOf(3, 6),
+                        emptyList(),
+                        emptyList(),
+                        emptyList(),
+                    ),
                 ),
-            equalTo(intArrayOf(6, 3, 4, 5, 2, 0, 7, 1))
+            equalTo(intArrayOf(6, 3, 4, 5, 2, 0, 7, 1)),
         )
     }
 
@@ -27,7 +34,8 @@ internal class SolutionTest {
             Solution()
                 .sortItems(
                     8,
-                    2, intArrayOf(-1, -1, 1, 0, 0, 1, 0, -1),
+                    2,
+                    intArrayOf(-1, -1, 1, 0, 0, 1, 0, -1),
                     listOf(
                         emptyList(),
                         listOf(6),
@@ -36,10 +44,10 @@ internal class SolutionTest {
                         listOf(3),
                         emptyList(),
                         listOf(4),
-                        emptyList()
-                    )
+                        emptyList(),
+                    ),
                 ),
-            equalTo(intArrayOf())
+            equalTo(intArrayOf()),
         )
     }
 }
diff --git a/src/test/kotlin/g1201_1300/s1204_last_person_to_fit_in_the_bus/MysqlTest.kt b/src/test/kotlin/g1201_1300/s1204_last_person_to_fit_in_the_bus/MysqlTest.kt
index aec8d21a4..294fe4f09 100644
--- a/src/test/kotlin/g1201_1300/s1204_last_person_to_fit_in_the_bus/MysqlTest.kt
+++ b/src/test/kotlin/g1201_1300/s1204_last_person_to_fit_in_the_bus/MysqlTest.kt
@@ -28,8 +28,8 @@ import javax.sql.DataSource
             "INSERT INTO Queue(person_id, person_name, weight, turn)" +
             " VALUES (1, 'Winston', 500, 6); " +
             "INSERT INTO Queue(person_id, person_name, weight, turn)" +
-            " VALUES (2, 'Marie', 200, 4); "
-    ]
+            " VALUES (2, 'Marie', 200, 4); ",
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -40,12 +40,12 @@ internal class MysqlTest {
                 statement.executeQuery(
                     BufferedReader(
                         FileReader(
-                            "src/main/kotlin/g1201_1300/s1204_last_person_to_fit_in_the_bus/script.sql"
-                        )
+                            "src/main/kotlin/g1201_1300/s1204_last_person_to_fit_in_the_bus/script.sql",
+                        ),
                     )
                         .lines()
                         .collect(Collectors.joining("\n"))
-                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace("#.*?\\r?\\n".toRegex(), ""),
                 ).use { resultSet ->
                     assertThat(resultSet.next(), equalTo(true))
                     assertThat(resultSet.getNString(1), equalTo("John Cena"))
diff --git a/src/test/kotlin/g1201_1300/s1207_unique_number_of_occurrences/SolutionTest.kt b/src/test/kotlin/g1201_1300/s1207_unique_number_of_occurrences/SolutionTest.kt
index 439097ac7..9b2fe0fe1 100644
--- a/src/test/kotlin/g1201_1300/s1207_unique_number_of_occurrences/SolutionTest.kt
+++ b/src/test/kotlin/g1201_1300/s1207_unique_number_of_occurrences/SolutionTest.kt
@@ -19,7 +19,7 @@ internal class SolutionTest {
     fun uniqueOccurrences3() {
         assertThat(
             Solution().uniqueOccurrences(intArrayOf(-3, 0, 1, -3, 1, 1, 1, -3, 10, 0)),
-            equalTo(true)
+            equalTo(true),
         )
     }
 }
diff --git a/src/test/kotlin/g1201_1300/s1210_minimum_moves_to_reach_target_with_rotations/SolutionTest.kt b/src/test/kotlin/g1201_1300/s1210_minimum_moves_to_reach_target_with_rotations/SolutionTest.kt
index 7bdb55e60..7de349755 100644
--- a/src/test/kotlin/g1201_1300/s1210_minimum_moves_to_reach_target_with_rotations/SolutionTest.kt
+++ b/src/test/kotlin/g1201_1300/s1210_minimum_moves_to_reach_target_with_rotations/SolutionTest.kt
@@ -13,7 +13,7 @@ internal class SolutionTest {
             intArrayOf(0, 0, 0, 0, 1, 1),
             intArrayOf(0, 0, 1, 0, 1, 0),
             intArrayOf(0, 1, 1, 0, 0, 0),
-            intArrayOf(0, 1, 1, 0, 0, 0)
+            intArrayOf(0, 1, 1, 0, 0, 0),
         )
         assertThat(Solution().minimumMoves(input), equalTo(11))
     }
@@ -26,7 +26,7 @@ internal class SolutionTest {
             intArrayOf(1, 1, 0, 0, 0, 1),
             intArrayOf(1, 1, 1, 0, 0, 1),
             intArrayOf(1, 1, 1, 0, 0, 1),
-            intArrayOf(1, 1, 1, 0, 0, 0)
+            intArrayOf(1, 1, 1, 0, 0, 0),
         )
         assertThat(Solution().minimumMoves(input), equalTo(9))
     }
diff --git a/src/test/kotlin/g1201_1300/s1211_queries_quality_and_percentage/MysqlTest.kt b/src/test/kotlin/g1201_1300/s1211_queries_quality_and_percentage/MysqlTest.kt
index 2808b8b26..9f8b5217e 100644
--- a/src/test/kotlin/g1201_1300/s1211_queries_quality_and_percentage/MysqlTest.kt
+++ b/src/test/kotlin/g1201_1300/s1211_queries_quality_and_percentage/MysqlTest.kt
@@ -28,8 +28,8 @@ import javax.sql.DataSource
             "INSERT INTO Queries(query_name, result, position, rating)" +
             " VALUES ('Cat', 'Siamese', 3, 3); " +
             "INSERT INTO Queries(query_name, result, position, rating)" +
-            " VALUES ('Cat', 'Sphynx', 7, 4); "
-    ]
+            " VALUES ('Cat', 'Sphynx', 7, 4); ",
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -40,12 +40,12 @@ internal class MysqlTest {
                 statement.executeQuery(
                     BufferedReader(
                         FileReader(
-                            "src/main/kotlin/g1201_1300/s1211_queries_quality_and_percentage/script.sql"
-                        )
+                            "src/main/kotlin/g1201_1300/s1211_queries_quality_and_percentage/script.sql",
+                        ),
                     )
                         .lines()
                         .collect(Collectors.joining("\n"))
-                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace("#.*?\\r?\\n".toRegex(), ""),
                 ).use { resultSet ->
                     assertThat(resultSet.next(), equalTo(true))
                     assertThat(resultSet.getNString(1), equalTo("Cat"))
diff --git a/src/test/kotlin/g1201_1300/s1218_longest_arithmetic_subsequence_of_given_difference/SolutionTest.kt b/src/test/kotlin/g1201_1300/s1218_longest_arithmetic_subsequence_of_given_difference/SolutionTest.kt
index e259ad33a..d8798ff02 100644
--- a/src/test/kotlin/g1201_1300/s1218_longest_arithmetic_subsequence_of_given_difference/SolutionTest.kt
+++ b/src/test/kotlin/g1201_1300/s1218_longest_arithmetic_subsequence_of_given_difference/SolutionTest.kt
@@ -19,7 +19,7 @@ internal class SolutionTest {
     fun longestSubsequence3() {
         assertThat(
             Solution().longestSubsequence(intArrayOf(1, 5, 7, 8, 5, 3, 4, 2, 1), -2),
-            equalTo(4)
+            equalTo(4),
         )
     }
 }
diff --git a/src/test/kotlin/g1201_1300/s1219_path_with_maximum_gold/SolutionTest.kt b/src/test/kotlin/g1201_1300/s1219_path_with_maximum_gold/SolutionTest.kt
index 3ea1b6eb6..a677f057c 100644
--- a/src/test/kotlin/g1201_1300/s1219_path_with_maximum_gold/SolutionTest.kt
+++ b/src/test/kotlin/g1201_1300/s1219_path_with_maximum_gold/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun maximumGold() {
         assertThat(
             Solution().getMaximumGold(arrayOf(intArrayOf(0, 6, 0), intArrayOf(5, 8, 7), intArrayOf(0, 9, 0))),
-            equalTo(24)
+            equalTo(24),
         )
     }
 
@@ -23,10 +23,10 @@ internal class SolutionTest {
                         intArrayOf(2, 0, 6),
                         intArrayOf(3, 4, 5),
                         intArrayOf(0, 3, 0),
-                        intArrayOf(9, 0, 20)
-                    )
+                        intArrayOf(9, 0, 20),
+                    ),
                 ),
-            equalTo(28)
+            equalTo(28),
         )
     }
 }
diff --git a/src/test/kotlin/g1201_1300/s1222_queens_that_can_attack_the_king/SolutionTest.kt b/src/test/kotlin/g1201_1300/s1222_queens_that_can_attack_the_king/SolutionTest.kt
index 3a486fe41..e42f54032 100644
--- a/src/test/kotlin/g1201_1300/s1222_queens_that_can_attack_the_king/SolutionTest.kt
+++ b/src/test/kotlin/g1201_1300/s1222_queens_that_can_attack_the_king/SolutionTest.kt
@@ -16,14 +16,14 @@ internal class SolutionTest {
                     intArrayOf(4, 0),
                     intArrayOf(0, 4),
                     intArrayOf(3, 3),
-                    intArrayOf(2, 4)
+                    intArrayOf(2, 4),
                 ),
-                intArrayOf(0, 0)
+                intArrayOf(0, 0),
             )
         val expected = listOf(mutableListOf(0, 1), mutableListOf(1, 0), mutableListOf(3, 3))
         assertThat(
             CommonUtils.compareMatrix(actual, expected),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
@@ -38,14 +38,14 @@ internal class SolutionTest {
                     intArrayOf(3, 4),
                     intArrayOf(3, 5),
                     intArrayOf(4, 4),
-                    intArrayOf(4, 5)
+                    intArrayOf(4, 5),
                 ),
-                intArrayOf(3, 3)
+                intArrayOf(3, 3),
             )
         val expected = listOf(mutableListOf(2, 2), mutableListOf(3, 4), mutableListOf(4, 4))
         assertThat(
             CommonUtils.compareMatrix(actual, expected),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
@@ -87,9 +87,9 @@ internal class SolutionTest {
                     intArrayOf(6, 1),
                     intArrayOf(0, 6),
                     intArrayOf(4, 3),
-                    intArrayOf(1, 7)
+                    intArrayOf(1, 7),
                 ),
-                intArrayOf(3, 4)
+                intArrayOf(3, 4),
             )
         val expected = listOf(
             mutableListOf(2, 3),
@@ -98,11 +98,11 @@ internal class SolutionTest {
             mutableListOf(3, 7),
             mutableListOf(4, 3),
             mutableListOf(5, 4),
-            mutableListOf(4, 5)
+            mutableListOf(4, 5),
         )
         assertThat(
             CommonUtils.compareMatrix(actual, expected),
-            equalTo(true)
+            equalTo(true),
         )
     }
 }
diff --git a/src/test/kotlin/g1201_1300/s1224_maximum_equal_frequency/SolutionTest.kt b/src/test/kotlin/g1201_1300/s1224_maximum_equal_frequency/SolutionTest.kt
index 5af01e357..413145911 100644
--- a/src/test/kotlin/g1201_1300/s1224_maximum_equal_frequency/SolutionTest.kt
+++ b/src/test/kotlin/g1201_1300/s1224_maximum_equal_frequency/SolutionTest.kt
@@ -14,7 +14,7 @@ internal class SolutionTest {
     fun maxEqualFreq2() {
         assertThat(
             Solution().maxEqualFreq(intArrayOf(1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5)),
-            equalTo(13)
+            equalTo(13),
         )
     }
 }
diff --git a/src/test/kotlin/g1201_1300/s1226_the_dining_philosophers/DiningPhilosophersTest.kt b/src/test/kotlin/g1201_1300/s1226_the_dining_philosophers/DiningPhilosophersTest.kt
index d54ff528b..2f4607321 100644
--- a/src/test/kotlin/g1201_1300/s1226_the_dining_philosophers/DiningPhilosophersTest.kt
+++ b/src/test/kotlin/g1201_1300/s1226_the_dining_philosophers/DiningPhilosophersTest.kt
@@ -20,7 +20,7 @@ internal class DiningPhilosophersTest {
                         { calls[0]++ },
                         { calls[0]++ },
                         { calls[0]++ },
-                        { calls[0]++ }
+                        { calls[0]++ },
                     ) { calls[0]++ }
                 } catch (e: InterruptedException) {
                     e.printStackTrace()
@@ -36,7 +36,7 @@ internal class DiningPhilosophersTest {
                         { calls[0]++ },
                         { calls[0]++ },
                         { calls[0]++ },
-                        { calls[0]++ }
+                        { calls[0]++ },
                     ) { calls[0]++ }
                 } catch (e: InterruptedException) {
                     e.printStackTrace()
@@ -52,7 +52,7 @@ internal class DiningPhilosophersTest {
                         { calls[0]++ },
                         { calls[0]++ },
                         { calls[0]++ },
-                        { calls[0]++ }
+                        { calls[0]++ },
                     ) { calls[0]++ }
                 } catch (e: InterruptedException) {
                     e.printStackTrace()
@@ -68,7 +68,7 @@ internal class DiningPhilosophersTest {
                         { calls[0]++ },
                         { calls[0]++ },
                         { calls[0]++ },
-                        { calls[0]++ }
+                        { calls[0]++ },
                     ) { calls[0]++ }
                 } catch (e: InterruptedException) {
                     e.printStackTrace()
@@ -84,7 +84,7 @@ internal class DiningPhilosophersTest {
                         { calls[0]++ },
                         { calls[0]++ },
                         { calls[0]++ },
-                        { calls[0]++ }
+                        { calls[0]++ },
                     ) { calls[0]++ }
                 } catch (e: InterruptedException) {
                     e.printStackTrace()
diff --git a/src/test/kotlin/g1201_1300/s1232_check_if_it_is_a_straight_line/SolutionTest.kt b/src/test/kotlin/g1201_1300/s1232_check_if_it_is_a_straight_line/SolutionTest.kt
index ea06709c1..c201e4e57 100644
--- a/src/test/kotlin/g1201_1300/s1232_check_if_it_is_a_straight_line/SolutionTest.kt
+++ b/src/test/kotlin/g1201_1300/s1232_check_if_it_is_a_straight_line/SolutionTest.kt
@@ -16,10 +16,10 @@ internal class SolutionTest {
                         intArrayOf(3, 4),
                         intArrayOf(4, 5),
                         intArrayOf(5, 6),
-                        intArrayOf(6, 7)
-                    )
+                        intArrayOf(6, 7),
+                    ),
                 ),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
@@ -34,10 +34,10 @@ internal class SolutionTest {
                         intArrayOf(3, 4),
                         intArrayOf(4, 5),
                         intArrayOf(5, 6),
-                        intArrayOf(7, 7)
-                    )
+                        intArrayOf(7, 7),
+                    ),
                 ),
-            equalTo(false)
+            equalTo(false),
         )
     }
 }
diff --git a/src/test/kotlin/g1201_1300/s1233_remove_sub_folders_from_the_filesystem/SolutionTest.kt b/src/test/kotlin/g1201_1300/s1233_remove_sub_folders_from_the_filesystem/SolutionTest.kt
index 8d21cd1d3..1589f81e2 100644
--- a/src/test/kotlin/g1201_1300/s1233_remove_sub_folders_from_the_filesystem/SolutionTest.kt
+++ b/src/test/kotlin/g1201_1300/s1233_remove_sub_folders_from_the_filesystem/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .removeSubfolders(arrayOf("/a", "/a/b", "/c/d", "/c/d/e", "/c/f")),
-            equalTo(mutableListOf("/a", "/c/d", "/c/f"))
+            equalTo(mutableListOf("/a", "/c/d", "/c/f")),
         )
     }
 
@@ -18,7 +18,7 @@ internal class SolutionTest {
     fun removeSubfolders2() {
         assertThat(
             Solution().removeSubfolders(arrayOf("/a", "/a/b/c", "/a/b/d")),
-            equalTo(listOf("/a"))
+            equalTo(listOf("/a")),
         )
     }
 
@@ -26,7 +26,7 @@ internal class SolutionTest {
     fun removeSubfolders3() {
         assertThat(
             Solution().removeSubfolders(arrayOf("/a/b/c", "/a/b/ca", "/a/b/d")),
-            equalTo(mutableListOf("/a/b/c", "/a/b/ca", "/a/b/d"))
+            equalTo(mutableListOf("/a/b/c", "/a/b/ca", "/a/b/d")),
         )
     }
 }
diff --git a/src/test/kotlin/g1201_1300/s1235_maximum_profit_in_job_scheduling/SolutionTest.kt b/src/test/kotlin/g1201_1300/s1235_maximum_profit_in_job_scheduling/SolutionTest.kt
index 29d73b3be..8712cbd27 100644
--- a/src/test/kotlin/g1201_1300/s1235_maximum_profit_in_job_scheduling/SolutionTest.kt
+++ b/src/test/kotlin/g1201_1300/s1235_maximum_profit_in_job_scheduling/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .jobScheduling(intArrayOf(1, 2, 3, 3), intArrayOf(3, 4, 5, 6), intArrayOf(50, 10, 40, 70)),
-            equalTo(120)
+            equalTo(120),
         )
     }
 
@@ -19,7 +19,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .jobScheduling(intArrayOf(1, 2, 3, 4, 6), intArrayOf(3, 5, 10, 6, 9), intArrayOf(20, 20, 100, 70, 60)),
-            equalTo(150)
+            equalTo(150),
         )
     }
 
@@ -28,7 +28,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .jobScheduling(intArrayOf(1, 1, 1), intArrayOf(2, 3, 4), intArrayOf(5, 6, 4)),
-            equalTo(6)
+            equalTo(6),
         )
     }
 }
diff --git a/src/test/kotlin/g1201_1300/s1237_find_positive_integer_solution_for_a_given_equation/SolutionTest.kt b/src/test/kotlin/g1201_1300/s1237_find_positive_integer_solution_for_a_given_equation/SolutionTest.kt
index 0ad384321..8127af49f 100644
--- a/src/test/kotlin/g1201_1300/s1237_find_positive_integer_solution_for_a_given_equation/SolutionTest.kt
+++ b/src/test/kotlin/g1201_1300/s1237_find_positive_integer_solution_for_a_given_equation/SolutionTest.kt
@@ -15,7 +15,7 @@ internal class SolutionTest {
         }
         assertThat(
             Solution().findSolution(customFunction, 1),
-            equalTo(listOf(mutableListOf(2, 1000)))
+            equalTo(listOf(mutableListOf(2, 1000))),
         )
     }
 }
diff --git a/src/test/kotlin/g1201_1300/s1238_circular_permutation_in_binary_representation/SolutionTest.kt b/src/test/kotlin/g1201_1300/s1238_circular_permutation_in_binary_representation/SolutionTest.kt
index 4dd14e817..4423324e5 100644
--- a/src/test/kotlin/g1201_1300/s1238_circular_permutation_in_binary_representation/SolutionTest.kt
+++ b/src/test/kotlin/g1201_1300/s1238_circular_permutation_in_binary_representation/SolutionTest.kt
@@ -11,7 +11,7 @@ internal class SolutionTest {
         val actual = Solution().circularPermutation(2, 3)
         assertThat(
             CommonUtils.compareArray(actual, mutableListOf<Int>(3, 2, 0, 1)),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
@@ -20,7 +20,7 @@ internal class SolutionTest {
         val actual = Solution().circularPermutation(3, 2)
         assertThat(
             CommonUtils.compareArray(actual, mutableListOf<Int>(2, 6, 7, 5, 4, 0, 1, 3)),
-            equalTo(true)
+            equalTo(true),
         )
     }
 }
diff --git a/src/test/kotlin/g1201_1300/s1239_maximum_length_of_a_concatenated_string_with_unique_characters/SolutionTest.kt b/src/test/kotlin/g1201_1300/s1239_maximum_length_of_a_concatenated_string_with_unique_characters/SolutionTest.kt
index cf885039d..9844e535e 100644
--- a/src/test/kotlin/g1201_1300/s1239_maximum_length_of_a_concatenated_string_with_unique_characters/SolutionTest.kt
+++ b/src/test/kotlin/g1201_1300/s1239_maximum_length_of_a_concatenated_string_with_unique_characters/SolutionTest.kt
@@ -19,7 +19,7 @@ internal class SolutionTest {
     fun maxLength3() {
         assertThat(
             Solution().maxLength(listOf("abcdefghijklmnopqrstuvwxyz")),
-            equalTo(26)
+            equalTo(26),
         )
     }
 }
diff --git a/src/test/kotlin/g1201_1300/s1248_count_number_of_nice_subarrays/SolutionTest.kt b/src/test/kotlin/g1201_1300/s1248_count_number_of_nice_subarrays/SolutionTest.kt
index 58b808be1..9fe8db956 100644
--- a/src/test/kotlin/g1201_1300/s1248_count_number_of_nice_subarrays/SolutionTest.kt
+++ b/src/test/kotlin/g1201_1300/s1248_count_number_of_nice_subarrays/SolutionTest.kt
@@ -19,7 +19,7 @@ internal class SolutionTest {
     fun numberOfSubarrays3() {
         assertThat(
             Solution().numberOfSubarrays(intArrayOf(2, 2, 2, 1, 2, 2, 1, 2, 2, 2), 2),
-            equalTo(16)
+            equalTo(16),
         )
     }
 }
diff --git a/src/test/kotlin/g1201_1300/s1251_average_selling_price/MysqlTest.kt b/src/test/kotlin/g1201_1300/s1251_average_selling_price/MysqlTest.kt
index f27e63455..e489530a6 100644
--- a/src/test/kotlin/g1201_1300/s1251_average_selling_price/MysqlTest.kt
+++ b/src/test/kotlin/g1201_1300/s1251_average_selling_price/MysqlTest.kt
@@ -33,8 +33,8 @@ import javax.sql.DataSource
             "INSERT INTO UnitsSold(product_id, purchase_date, units)" +
             " VALUES (2, '2019-02-10', 200); " +
             "INSERT INTO UnitsSold(product_id, purchase_date, units)" +
-            " VALUES (2, '2019-03-22', 30); "
-    ]
+            " VALUES (2, '2019-03-22', 30); ",
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -45,12 +45,12 @@ internal class MysqlTest {
                 statement.executeQuery(
                     BufferedReader(
                         FileReader(
-                            "src/main/kotlin/g1201_1300/s1251_average_selling_price/script.sql"
-                        )
+                            "src/main/kotlin/g1201_1300/s1251_average_selling_price/script.sql",
+                        ),
                     )
                         .lines()
                         .collect(Collectors.joining("\n"))
-                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace("#.*?\\r?\\n".toRegex(), ""),
                 ).use { resultSet ->
                     assertThat(resultSet.next(), equalTo(true))
                     assertThat(resultSet.getInt(1), equalTo(1))
diff --git a/src/test/kotlin/g1201_1300/s1252_cells_with_odd_values_in_a_matrix/SolutionTest.kt b/src/test/kotlin/g1201_1300/s1252_cells_with_odd_values_in_a_matrix/SolutionTest.kt
index dac83fb95..11f438921 100644
--- a/src/test/kotlin/g1201_1300/s1252_cells_with_odd_values_in_a_matrix/SolutionTest.kt
+++ b/src/test/kotlin/g1201_1300/s1252_cells_with_odd_values_in_a_matrix/SolutionTest.kt
@@ -9,13 +9,14 @@ internal class SolutionTest {
     fun oddCells() {
         assertThat(
             Solution().oddCells(
-                2, 3,
+                2,
+                3,
                 arrayOf(
                     intArrayOf(0, 1),
-                    intArrayOf(1, 1)
-                )
+                    intArrayOf(1, 1),
+                ),
             ),
-            equalTo(6)
+            equalTo(6),
         )
     }
 
@@ -23,13 +24,14 @@ internal class SolutionTest {
     fun oddCells2() {
         assertThat(
             Solution().oddCells(
-                2, 2,
+                2,
+                2,
                 arrayOf(
                     intArrayOf(1, 1),
-                    intArrayOf(0, 0)
-                )
+                    intArrayOf(0, 0),
+                ),
             ),
-            equalTo(0)
+            equalTo(0),
         )
     }
 }
diff --git a/src/test/kotlin/g1201_1300/s1253_reconstruct_a_2_row_binary_matrix/SolutionTest.kt b/src/test/kotlin/g1201_1300/s1253_reconstruct_a_2_row_binary_matrix/SolutionTest.kt
index edef03c74..ff8b2f919 100644
--- a/src/test/kotlin/g1201_1300/s1253_reconstruct_a_2_row_binary_matrix/SolutionTest.kt
+++ b/src/test/kotlin/g1201_1300/s1253_reconstruct_a_2_row_binary_matrix/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun reconstructMatrix() {
         assertThat(
             Solution().reconstructMatrix(2, 1, intArrayOf(1, 1, 1)),
-            equalTo(listOf(mutableListOf(0, 1, 1), mutableListOf(1, 0, 0)))
+            equalTo(listOf(mutableListOf(0, 1, 1), mutableListOf(1, 0, 0))),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun reconstructMatrix2() {
         assertThat(
             Solution().reconstructMatrix(2, 3, intArrayOf(2, 2, 1, 1)),
-            equalTo(emptyList<Any>())
+            equalTo(emptyList<Any>()),
         )
     }
 
@@ -26,8 +26,8 @@ internal class SolutionTest {
         assertThat(
             Solution().reconstructMatrix(5, 5, intArrayOf(2, 1, 2, 0, 1, 0, 1, 2, 0, 1)),
             equalTo(
-                listOf(mutableListOf(1, 0, 1, 0, 0, 0, 1, 1, 0, 1), mutableListOf(1, 1, 1, 0, 1, 0, 0, 1, 0, 0))
-            )
+                listOf(mutableListOf(1, 0, 1, 0, 0, 0, 1, 1, 0, 1), mutableListOf(1, 1, 1, 0, 1, 0, 0, 1, 0, 0)),
+            ),
         )
     }
 }
diff --git a/src/test/kotlin/g1201_1300/s1254_number_of_closed_islands/SolutionTest.kt b/src/test/kotlin/g1201_1300/s1254_number_of_closed_islands/SolutionTest.kt
index f7284fd33..ce468cc72 100644
--- a/src/test/kotlin/g1201_1300/s1254_number_of_closed_islands/SolutionTest.kt
+++ b/src/test/kotlin/g1201_1300/s1254_number_of_closed_islands/SolutionTest.kt
@@ -8,9 +8,11 @@ internal class SolutionTest {
     @Test
     fun closedIsland() {
         val grid = arrayOf(
-            intArrayOf(1, 1, 1, 1, 1, 1, 1, 0), intArrayOf(1, 0, 0, 0, 0, 1, 1, 0),
+            intArrayOf(1, 1, 1, 1, 1, 1, 1, 0),
+            intArrayOf(1, 0, 0, 0, 0, 1, 1, 0),
             intArrayOf(1, 0, 1, 0, 1, 1, 1, 0),
-            intArrayOf(1, 0, 0, 0, 0, 1, 0, 1), intArrayOf(1, 1, 1, 1, 1, 1, 1, 0)
+            intArrayOf(1, 0, 0, 0, 0, 1, 0, 1),
+            intArrayOf(1, 1, 1, 1, 1, 1, 1, 0),
         )
         assertThat(Solution().closedIsland(grid), equalTo(2))
     }
@@ -24,9 +26,13 @@ internal class SolutionTest {
     @Test
     fun closedIsland3() {
         val grid = arrayOf(
-            intArrayOf(1, 1, 1, 1, 1, 1, 1), intArrayOf(1, 0, 0, 0, 0, 0, 1),
-            intArrayOf(1, 0, 1, 1, 1, 0, 1), intArrayOf(1, 0, 1, 0, 1, 0, 1),
-            intArrayOf(1, 0, 1, 1, 1, 0, 1), intArrayOf(1, 0, 0, 0, 0, 0, 1), intArrayOf(1, 1, 1, 1, 1, 1, 1)
+            intArrayOf(1, 1, 1, 1, 1, 1, 1),
+            intArrayOf(1, 0, 0, 0, 0, 0, 1),
+            intArrayOf(1, 0, 1, 1, 1, 0, 1),
+            intArrayOf(1, 0, 1, 0, 1, 0, 1),
+            intArrayOf(1, 0, 1, 1, 1, 0, 1),
+            intArrayOf(1, 0, 0, 0, 0, 0, 1),
+            intArrayOf(1, 1, 1, 1, 1, 1, 1),
         )
         assertThat(Solution().closedIsland(grid), equalTo(2))
     }
diff --git a/src/test/kotlin/g1201_1300/s1255_maximum_score_words_formed_by_letters/SolutionTest.kt b/src/test/kotlin/g1201_1300/s1255_maximum_score_words_formed_by_letters/SolutionTest.kt
index 99be53dfe..7d35250c1 100644
--- a/src/test/kotlin/g1201_1300/s1255_maximum_score_words_formed_by_letters/SolutionTest.kt
+++ b/src/test/kotlin/g1201_1300/s1255_maximum_score_words_formed_by_letters/SolutionTest.kt
@@ -10,13 +10,14 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .maxScoreWords(
-                    arrayOf("dog", "cat", "dad", "good"), charArrayOf('a', 'a', 'c', 'd', 'd', 'd', 'g', 'o', 'o'),
+                    arrayOf("dog", "cat", "dad", "good"),
+                    charArrayOf('a', 'a', 'c', 'd', 'd', 'd', 'g', 'o', 'o'),
                     intArrayOf(
                         1, 0, 9, 5, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0,
-                        0, 0, 0, 0, 0
-                    )
+                        0, 0, 0, 0, 0,
+                    ),
                 ),
-            equalTo(23)
+            equalTo(23),
         )
     }
 
@@ -25,13 +26,14 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .maxScoreWords(
-                    arrayOf("xxxz", "ax", "bx", "cx"), charArrayOf('z', 'a', 'b', 'c', 'x', 'x', 'x'),
+                    arrayOf("xxxz", "ax", "bx", "cx"),
+                    charArrayOf('z', 'a', 'b', 'c', 'x', 'x', 'x'),
                     intArrayOf(
                         4, 4, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-                        0, 0, 5, 0, 10
-                    )
+                        0, 0, 5, 0, 10,
+                    ),
                 ),
-            equalTo(27)
+            equalTo(27),
         )
     }
 
@@ -40,13 +42,14 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .maxScoreWords(
-                    arrayOf("leetcode"), charArrayOf('l', 'e', 't', 'c', 'o', 'd'),
+                    arrayOf("leetcode"),
+                    charArrayOf('l', 'e', 't', 'c', 'o', 'd'),
                     intArrayOf(
                         0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0,
-                        0, 0, 0, 0, 0
-                    )
+                        0, 0, 0, 0, 0,
+                    ),
                 ),
-            equalTo(0)
+            equalTo(0),
         )
     }
 }
diff --git a/src/test/kotlin/g1201_1300/s1260_shift_2d_grid/SolutionTest.kt b/src/test/kotlin/g1201_1300/s1260_shift_2d_grid/SolutionTest.kt
index 1c4e79cfe..9de917b5e 100644
--- a/src/test/kotlin/g1201_1300/s1260_shift_2d_grid/SolutionTest.kt
+++ b/src/test/kotlin/g1201_1300/s1260_shift_2d_grid/SolutionTest.kt
@@ -10,8 +10,8 @@ internal class SolutionTest {
         assertThat(
             Solution().shiftGrid(arrayOf(intArrayOf(1, 2, 3), intArrayOf(4, 5, 6), intArrayOf(7, 8, 9)), 1),
             equalTo(
-                listOf(mutableListOf(9, 1, 2), mutableListOf(3, 4, 5), mutableListOf(6, 7, 8))
-            )
+                listOf(mutableListOf(9, 1, 2), mutableListOf(3, 4, 5), mutableListOf(6, 7, 8)),
+            ),
         )
     }
 
@@ -21,17 +21,21 @@ internal class SolutionTest {
             Solution()
                 .shiftGrid(
                     arrayOf(
-                        intArrayOf(3, 8, 1, 9), intArrayOf(19, 7, 2, 5),
-                        intArrayOf(4, 6, 11, 10), intArrayOf(12, 0, 21, 13)
+                        intArrayOf(3, 8, 1, 9),
+                        intArrayOf(19, 7, 2, 5),
+                        intArrayOf(4, 6, 11, 10),
+                        intArrayOf(12, 0, 21, 13),
                     ),
-                    4
+                    4,
                 ),
             equalTo(
                 listOf(
-                    mutableListOf(12, 0, 21, 13), mutableListOf(3, 8, 1, 9),
-                    mutableListOf(19, 7, 2, 5), mutableListOf(4, 6, 11, 10)
-                )
-            )
+                    mutableListOf(12, 0, 21, 13),
+                    mutableListOf(3, 8, 1, 9),
+                    mutableListOf(19, 7, 2, 5),
+                    mutableListOf(4, 6, 11, 10),
+                ),
+            ),
         )
     }
 
@@ -40,8 +44,8 @@ internal class SolutionTest {
         assertThat(
             Solution().shiftGrid(arrayOf(intArrayOf(1, 2, 3), intArrayOf(4, 5, 6), intArrayOf(7, 8, 9)), 9),
             equalTo(
-                listOf(mutableListOf(1, 2, 3), mutableListOf(4, 5, 6), mutableListOf(7, 8, 9))
-            )
+                listOf(mutableListOf(1, 2, 3), mutableListOf(4, 5, 6), mutableListOf(7, 8, 9)),
+            ),
         )
     }
 }
diff --git a/src/test/kotlin/g1201_1300/s1263_minimum_moves_to_move_a_box_to_their_target_location/SolutionTest.kt b/src/test/kotlin/g1201_1300/s1263_minimum_moves_to_move_a_box_to_their_target_location/SolutionTest.kt
index 094cd6ad5..3160e285a 100644
--- a/src/test/kotlin/g1201_1300/s1263_minimum_moves_to_move_a_box_to_their_target_location/SolutionTest.kt
+++ b/src/test/kotlin/g1201_1300/s1263_minimum_moves_to_move_a_box_to_their_target_location/SolutionTest.kt
@@ -16,10 +16,10 @@ internal class SolutionTest {
                         charArrayOf('#', '.', '.', 'B', '.', '#'),
                         charArrayOf('#', '.', '#', '#', '.', '#'),
                         charArrayOf('#', '.', '.', '.', 'S', '#'),
-                        charArrayOf('#', '#', '#', '#', '#', '#')
-                    )
+                        charArrayOf('#', '#', '#', '#', '#', '#'),
+                    ),
                 ),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
@@ -34,10 +34,10 @@ internal class SolutionTest {
                         charArrayOf('#', '.', '.', 'B', '.', '#'),
                         charArrayOf('#', '#', '#', '#', '.', '#'),
                         charArrayOf('#', '.', '.', '.', 'S', '#'),
-                        charArrayOf('#', '#', '#', '#', '#', '#')
-                    )
+                        charArrayOf('#', '#', '#', '#', '#', '#'),
+                    ),
                 ),
-            equalTo(-1)
+            equalTo(-1),
         )
     }
 
@@ -52,10 +52,10 @@ internal class SolutionTest {
                         charArrayOf('#', '.', '#', 'B', '.', '#'),
                         charArrayOf('#', '.', '.', '.', '.', '#'),
                         charArrayOf('#', '.', '.', '.', 'S', '#'),
-                        charArrayOf('#', '#', '#', '#', '#', '#')
-                    )
+                        charArrayOf('#', '#', '#', '#', '#', '#'),
+                    ),
                 ),
-            equalTo(5)
+            equalTo(5),
         )
     }
 }
diff --git a/src/test/kotlin/g1201_1300/s1266_minimum_time_visiting_all_points/SolutionTest.kt b/src/test/kotlin/g1201_1300/s1266_minimum_time_visiting_all_points/SolutionTest.kt
index 9571924c7..75ccb0541 100644
--- a/src/test/kotlin/g1201_1300/s1266_minimum_time_visiting_all_points/SolutionTest.kt
+++ b/src/test/kotlin/g1201_1300/s1266_minimum_time_visiting_all_points/SolutionTest.kt
@@ -9,14 +9,15 @@ internal class SolutionTest {
     fun minTimeToVisitAllPoints() {
         assertThat(
             Solution().minTimeToVisitAllPoints(arrayOf(intArrayOf(1, 1), intArrayOf(3, 4), intArrayOf(-1, 0))),
-            equalTo(7)
+            equalTo(7),
         )
     }
 
     @Test
     fun minTimeToVisitAllPoints2() {
         assertThat(
-            Solution().minTimeToVisitAllPoints(arrayOf(intArrayOf(3, 2), intArrayOf(-2, 2))), equalTo(5)
+            Solution().minTimeToVisitAllPoints(arrayOf(intArrayOf(3, 2), intArrayOf(-2, 2))),
+            equalTo(5),
         )
     }
 }
diff --git a/src/test/kotlin/g1201_1300/s1267_count_servers_that_communicate/SolutionTest.kt b/src/test/kotlin/g1201_1300/s1267_count_servers_that_communicate/SolutionTest.kt
index 807e92e1f..69b6cca0d 100644
--- a/src/test/kotlin/g1201_1300/s1267_count_servers_that_communicate/SolutionTest.kt
+++ b/src/test/kotlin/g1201_1300/s1267_count_servers_that_communicate/SolutionTest.kt
@@ -11,10 +11,10 @@ internal class SolutionTest {
             Solution().countServers(
                 arrayOf(
                     intArrayOf(1, 0),
-                    intArrayOf(0, 1)
-                )
+                    intArrayOf(0, 1),
+                ),
             ),
-            equalTo(0)
+            equalTo(0),
         )
     }
 
@@ -24,10 +24,10 @@ internal class SolutionTest {
             Solution().countServers(
                 arrayOf(
                     intArrayOf(1, 0),
-                    intArrayOf(1, 1)
-                )
+                    intArrayOf(1, 1),
+                ),
             ),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
@@ -37,11 +37,13 @@ internal class SolutionTest {
             Solution()
                 .countServers(
                     arrayOf(
-                        intArrayOf(1, 1, 0, 0), intArrayOf(0, 0, 1, 0),
-                        intArrayOf(0, 0, 1, 0), intArrayOf(0, 0, 0, 1)
-                    )
+                        intArrayOf(1, 1, 0, 0),
+                        intArrayOf(0, 0, 1, 0),
+                        intArrayOf(0, 0, 1, 0),
+                        intArrayOf(0, 0, 0, 1),
+                    ),
                 ),
-            equalTo(4)
+            equalTo(4),
         )
     }
 }
diff --git a/src/test/kotlin/g1201_1300/s1268_search_suggestions_system/SolutionTest.kt b/src/test/kotlin/g1201_1300/s1268_search_suggestions_system/SolutionTest.kt
index 21e8c9769..78ed3648d 100644
--- a/src/test/kotlin/g1201_1300/s1268_search_suggestions_system/SolutionTest.kt
+++ b/src/test/kotlin/g1201_1300/s1268_search_suggestions_system/SolutionTest.kt
@@ -10,28 +10,33 @@ internal class SolutionTest {
         val expected = listOf(
             mutableListOf("mobile", "moneypot", "monitor"),
             mutableListOf("mobile", "moneypot", "monitor"),
-            mutableListOf("mouse", "mousepad"), mutableListOf("mouse", "mousepad"),
-            mutableListOf("mouse", "mousepad")
+            mutableListOf("mouse", "mousepad"),
+            mutableListOf("mouse", "mousepad"),
+            mutableListOf("mouse", "mousepad"),
         )
         assertThat(
             Solution()
                 .suggestedProducts(
                     arrayOf("mobile", "mouse", "moneypot", "monitor", "mousepad"),
-                    "mouse"
+                    "mouse",
                 ),
-            equalTo(expected)
+            equalTo(expected),
         )
     }
 
     @Test
     fun suggestedProducts2() {
         val expected = listOf(
-            listOf("havana"), listOf("havana"), listOf("havana"),
-            listOf("havana"), listOf("havana"), listOf("havana")
+            listOf("havana"),
+            listOf("havana"),
+            listOf("havana"),
+            listOf("havana"),
+            listOf("havana"),
+            listOf("havana"),
         )
         assertThat(
             Solution().suggestedProducts(arrayOf("havana"), "havana"),
-            equalTo(expected)
+            equalTo(expected),
         )
     }
 
@@ -39,15 +44,17 @@ internal class SolutionTest {
     fun suggestedProducts3() {
         val expected = listOf(
             mutableListOf("baggage", "bags", "banner"),
-            mutableListOf("baggage", "bags", "banner"), mutableListOf("baggage", "bags"), listOf("bags")
+            mutableListOf("baggage", "bags", "banner"),
+            mutableListOf("baggage", "bags"),
+            listOf("bags"),
         )
         assertThat(
             Solution()
                 .suggestedProducts(
                     arrayOf("bags", "baggage", "banner", "box", "cloths"),
-                    "bags"
+                    "bags",
                 ),
-            equalTo(expected)
+            equalTo(expected),
         )
     }
 }
diff --git a/src/test/kotlin/g1201_1300/s1275_find_winner_on_a_tic_tac_toe_game/SolutionTest.kt b/src/test/kotlin/g1201_1300/s1275_find_winner_on_a_tic_tac_toe_game/SolutionTest.kt
index e1e34ffd7..278318da4 100644
--- a/src/test/kotlin/g1201_1300/s1275_find_winner_on_a_tic_tac_toe_game/SolutionTest.kt
+++ b/src/test/kotlin/g1201_1300/s1275_find_winner_on_a_tic_tac_toe_game/SolutionTest.kt
@@ -10,11 +10,14 @@ internal class SolutionTest {
         assertThat(
             Solution().tictactoe(
                 arrayOf(
-                    intArrayOf(0, 0), intArrayOf(2, 0),
-                    intArrayOf(1, 1), intArrayOf(2, 1), intArrayOf(2, 2)
-                )
+                    intArrayOf(0, 0),
+                    intArrayOf(2, 0),
+                    intArrayOf(1, 1),
+                    intArrayOf(2, 1),
+                    intArrayOf(2, 2),
+                ),
             ),
-            equalTo("A")
+            equalTo("A"),
         )
     }
 
@@ -24,11 +27,15 @@ internal class SolutionTest {
             Solution()
                 .tictactoe(
                     arrayOf(
-                        intArrayOf(0, 0), intArrayOf(1, 1),
-                        intArrayOf(0, 1), intArrayOf(0, 2), intArrayOf(1, 0), intArrayOf(2, 0)
-                    )
+                        intArrayOf(0, 0),
+                        intArrayOf(1, 1),
+                        intArrayOf(0, 1),
+                        intArrayOf(0, 2),
+                        intArrayOf(1, 0),
+                        intArrayOf(2, 0),
+                    ),
                 ),
-            equalTo("B")
+            equalTo("B"),
         )
     }
 
@@ -40,10 +47,10 @@ internal class SolutionTest {
                     arrayOf(
                         intArrayOf(0, 0), intArrayOf(1, 1),
                         intArrayOf(2, 0), intArrayOf(1, 0), intArrayOf(1, 2), intArrayOf(2, 1),
-                        intArrayOf(0, 1), intArrayOf(0, 2), intArrayOf(2, 2)
-                    )
+                        intArrayOf(0, 1), intArrayOf(0, 2), intArrayOf(2, 2),
+                    ),
                 ),
-            equalTo("Draw")
+            equalTo("Draw"),
         )
     }
 }
diff --git a/src/test/kotlin/g1201_1300/s1277_count_square_submatrices_with_all_ones/SolutionTest.kt b/src/test/kotlin/g1201_1300/s1277_count_square_submatrices_with_all_ones/SolutionTest.kt
index 49315e7ae..3c2ab3c34 100644
--- a/src/test/kotlin/g1201_1300/s1277_count_square_submatrices_with_all_ones/SolutionTest.kt
+++ b/src/test/kotlin/g1201_1300/s1277_count_square_submatrices_with_all_ones/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun countSquares() {
         assertThat(
             Solution().countSquares(arrayOf(intArrayOf(0, 1, 1, 1), intArrayOf(1, 1, 1, 1), intArrayOf(0, 1, 1, 1))),
-            equalTo(15)
+            equalTo(15),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun countSquares2() {
         assertThat(
             Solution().countSquares(arrayOf(intArrayOf(1, 0, 1), intArrayOf(1, 1, 0), intArrayOf(1, 1, 0))),
-            equalTo(7)
+            equalTo(7),
         )
     }
 }
diff --git a/src/test/kotlin/g1201_1300/s1280_students_and_examinations/MysqlTest.kt b/src/test/kotlin/g1201_1300/s1280_students_and_examinations/MysqlTest.kt
index 96fd9476b..1f5fea8dd 100644
--- a/src/test/kotlin/g1201_1300/s1280_students_and_examinations/MysqlTest.kt
+++ b/src/test/kotlin/g1201_1300/s1280_students_and_examinations/MysqlTest.kt
@@ -54,8 +54,8 @@ import javax.sql.DataSource
             "INSERT INTO Examinations(student_id, subject_name)" +
             " VALUES (2, 'Math'); " +
             "INSERT INTO Examinations(student_id, subject_name)" +
-            " VALUES (1, 'Math'); "
-    ]
+            " VALUES (1, 'Math'); ",
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -66,12 +66,12 @@ internal class MysqlTest {
                 statement.executeQuery(
                     BufferedReader(
                         FileReader(
-                            "src/main/kotlin/g1201_1300/s1280_students_and_examinations/script.sql"
-                        )
+                            "src/main/kotlin/g1201_1300/s1280_students_and_examinations/script.sql",
+                        ),
                     )
                         .lines()
                         .collect(Collectors.joining("\n"))
-                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace("#.*?\\r?\\n".toRegex(), ""),
                 ).use { resultSet ->
                     assertThat(resultSet.next(), equalTo(true))
                     assertThat(resultSet.getInt(1), equalTo(1))
diff --git a/src/test/kotlin/g1201_1300/s1282_group_the_people_given_the_group_size_they_belong_to/SolutionTest.kt b/src/test/kotlin/g1201_1300/s1282_group_the_people_given_the_group_size_they_belong_to/SolutionTest.kt
index 31c65c1c7..44085b6f1 100644
--- a/src/test/kotlin/g1201_1300/s1282_group_the_people_given_the_group_size_they_belong_to/SolutionTest.kt
+++ b/src/test/kotlin/g1201_1300/s1282_group_the_people_given_the_group_size_they_belong_to/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
     fun groupThePeople() {
         assertThat(
             Solution().groupThePeople(intArrayOf(3, 3, 3, 3, 3, 1, 3)),
-            equalTo(getLists(arrayOf(intArrayOf(5), intArrayOf(0, 1, 2), intArrayOf(3, 4, 6))))
+            equalTo(getLists(arrayOf(intArrayOf(5), intArrayOf(0, 1, 2), intArrayOf(3, 4, 6)))),
         )
     }
 
@@ -18,7 +18,7 @@ internal class SolutionTest {
     fun groupThePeople2() {
         assertThat(
             Solution().groupThePeople(intArrayOf(2, 1, 3, 3, 3, 2)),
-            equalTo(getLists(arrayOf(intArrayOf(1), intArrayOf(0, 5), intArrayOf(2, 3, 4))))
+            equalTo(getLists(arrayOf(intArrayOf(1), intArrayOf(0, 5), intArrayOf(2, 3, 4)))),
         )
     }
 }
diff --git a/src/test/kotlin/g1201_1300/s1284_minimum_number_of_flips_to_convert_binary_matrix_to_zero_matrix/SolutionTest.kt b/src/test/kotlin/g1201_1300/s1284_minimum_number_of_flips_to_convert_binary_matrix_to_zero_matrix/SolutionTest.kt
index 8259ee042..f0f88c3bb 100644
--- a/src/test/kotlin/g1201_1300/s1284_minimum_number_of_flips_to_convert_binary_matrix_to_zero_matrix/SolutionTest.kt
+++ b/src/test/kotlin/g1201_1300/s1284_minimum_number_of_flips_to_convert_binary_matrix_to_zero_matrix/SolutionTest.kt
@@ -11,10 +11,10 @@ internal class SolutionTest {
             Solution().minFlips(
                 arrayOf(
                     intArrayOf(0, 0),
-                    intArrayOf(0, 1)
-                )
+                    intArrayOf(0, 1),
+                ),
             ),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
@@ -22,7 +22,7 @@ internal class SolutionTest {
     fun minFlips2() {
         assertThat(
             Solution().minFlips(arrayOf(intArrayOf(0))),
-            equalTo(0)
+            equalTo(0),
         )
     }
 
@@ -32,10 +32,10 @@ internal class SolutionTest {
             Solution().minFlips(
                 arrayOf(
                     intArrayOf(1, 0, 0),
-                    intArrayOf(1, 0, 0)
-                )
+                    intArrayOf(1, 0, 0),
+                ),
             ),
-            equalTo(-1)
+            equalTo(-1),
         )
     }
 }
diff --git a/src/test/kotlin/g1201_1300/s1287_element_appearing_more_than_25_in_sorted_array/SolutionTest.kt b/src/test/kotlin/g1201_1300/s1287_element_appearing_more_than_25_in_sorted_array/SolutionTest.kt
index 11ba5e2d9..667f9c208 100644
--- a/src/test/kotlin/g1201_1300/s1287_element_appearing_more_than_25_in_sorted_array/SolutionTest.kt
+++ b/src/test/kotlin/g1201_1300/s1287_element_appearing_more_than_25_in_sorted_array/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun findSpecialInteger() {
         assertThat(
             Solution().findSpecialInteger(intArrayOf(1, 2, 2, 6, 6, 6, 6, 7, 10)),
-            equalTo(6)
+            equalTo(6),
         )
     }
 
diff --git a/src/test/kotlin/g1201_1300/s1288_remove_covered_intervals/SolutionTest.kt b/src/test/kotlin/g1201_1300/s1288_remove_covered_intervals/SolutionTest.kt
index aef41b045..203c97fef 100644
--- a/src/test/kotlin/g1201_1300/s1288_remove_covered_intervals/SolutionTest.kt
+++ b/src/test/kotlin/g1201_1300/s1288_remove_covered_intervals/SolutionTest.kt
@@ -11,10 +11,11 @@ internal class SolutionTest {
             Solution().removeCoveredIntervals(
                 arrayOf(
                     intArrayOf(1, 4),
-                    intArrayOf(3, 6), intArrayOf(2, 8)
-                )
+                    intArrayOf(3, 6),
+                    intArrayOf(2, 8),
+                ),
             ),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -24,10 +25,10 @@ internal class SolutionTest {
             Solution().removeCoveredIntervals(
                 arrayOf(
                     intArrayOf(1, 4),
-                    intArrayOf(2, 3)
-                )
+                    intArrayOf(2, 3),
+                ),
             ),
-            equalTo(1)
+            equalTo(1),
         )
     }
 }
diff --git a/src/test/kotlin/g1201_1300/s1289_minimum_falling_path_sum_ii/SolutionTest.kt b/src/test/kotlin/g1201_1300/s1289_minimum_falling_path_sum_ii/SolutionTest.kt
index eea91a069..e72a203e4 100644
--- a/src/test/kotlin/g1201_1300/s1289_minimum_falling_path_sum_ii/SolutionTest.kt
+++ b/src/test/kotlin/g1201_1300/s1289_minimum_falling_path_sum_ii/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun minFallingPathSum() {
         assertThat(
             Solution().minFallingPathSum(arrayOf(intArrayOf(1, 2, 3), intArrayOf(4, 5, 6), intArrayOf(7, 8, 9))),
-            equalTo(13)
+            equalTo(13),
         )
     }
 
diff --git a/src/test/kotlin/g1201_1300/s1291_sequential_digits/SolutionTest.kt b/src/test/kotlin/g1201_1300/s1291_sequential_digits/SolutionTest.kt
index bb6290d26..45e368655 100644
--- a/src/test/kotlin/g1201_1300/s1291_sequential_digits/SolutionTest.kt
+++ b/src/test/kotlin/g1201_1300/s1291_sequential_digits/SolutionTest.kt
@@ -14,7 +14,7 @@ internal class SolutionTest {
     fun sequentialDigits2() {
         assertThat(
             Solution().sequentialDigits(1000, 13000),
-            equalTo(mutableListOf(1234, 2345, 3456, 4567, 5678, 6789, 12345))
+            equalTo(mutableListOf(1234, 2345, 3456, 4567, 5678, 6789, 12345)),
         )
     }
 }
diff --git a/src/test/kotlin/g1201_1300/s1292_maximum_side_length_of_a_square_with_sum_less_than_or_equal_to_threshold/SolutionTest.kt b/src/test/kotlin/g1201_1300/s1292_maximum_side_length_of_a_square_with_sum_less_than_or_equal_to_threshold/SolutionTest.kt
index b2c0d283c..a2de0174c 100644
--- a/src/test/kotlin/g1201_1300/s1292_maximum_side_length_of_a_square_with_sum_less_than_or_equal_to_threshold/SolutionTest.kt
+++ b/src/test/kotlin/g1201_1300/s1292_maximum_side_length_of_a_square_with_sum_less_than_or_equal_to_threshold/SolutionTest.kt
@@ -12,11 +12,12 @@ internal class SolutionTest {
                 .maxSideLength(
                     arrayOf(
                         intArrayOf(1, 1, 3, 2, 4, 3, 2),
-                        intArrayOf(1, 1, 3, 2, 4, 3, 2), intArrayOf(1, 1, 3, 2, 4, 3, 2)
+                        intArrayOf(1, 1, 3, 2, 4, 3, 2),
+                        intArrayOf(1, 1, 3, 2, 4, 3, 2),
                     ),
-                    4
+                    4,
                 ),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -26,12 +27,15 @@ internal class SolutionTest {
             Solution()
                 .maxSideLength(
                     arrayOf(
-                        intArrayOf(2, 2, 2, 2, 2), intArrayOf(2, 2, 2, 2, 2),
-                        intArrayOf(2, 2, 2, 2, 2), intArrayOf(2, 2, 2, 2, 2), intArrayOf(2, 2, 2, 2, 2)
+                        intArrayOf(2, 2, 2, 2, 2),
+                        intArrayOf(2, 2, 2, 2, 2),
+                        intArrayOf(2, 2, 2, 2, 2),
+                        intArrayOf(2, 2, 2, 2, 2),
+                        intArrayOf(2, 2, 2, 2, 2),
                     ),
-                    1
+                    1,
                 ),
-            equalTo(0)
+            equalTo(0),
         )
     }
 }
diff --git a/src/test/kotlin/g1201_1300/s1293_shortest_path_in_a_grid_with_obstacles_elimination/SolutionTest.kt b/src/test/kotlin/g1201_1300/s1293_shortest_path_in_a_grid_with_obstacles_elimination/SolutionTest.kt
index e5e01f54b..43734666c 100644
--- a/src/test/kotlin/g1201_1300/s1293_shortest_path_in_a_grid_with_obstacles_elimination/SolutionTest.kt
+++ b/src/test/kotlin/g1201_1300/s1293_shortest_path_in_a_grid_with_obstacles_elimination/SolutionTest.kt
@@ -11,12 +11,15 @@ internal class SolutionTest {
             Solution()
                 .shortestPath(
                     arrayOf(
-                        intArrayOf(0, 0, 0), intArrayOf(1, 1, 0),
-                        intArrayOf(0, 0, 0), intArrayOf(0, 1, 1), intArrayOf(0, 0, 0)
+                        intArrayOf(0, 0, 0),
+                        intArrayOf(1, 1, 0),
+                        intArrayOf(0, 0, 0),
+                        intArrayOf(0, 1, 1),
+                        intArrayOf(0, 0, 0),
                     ),
-                    1
+                    1,
                 ),
-            equalTo(6)
+            equalTo(6),
         )
     }
 
@@ -25,12 +28,13 @@ internal class SolutionTest {
         assertThat(
             Solution().shortestPath(
                 arrayOf(
-                    intArrayOf(0, 1, 1), intArrayOf(1, 1, 1),
-                    intArrayOf(1, 0, 0)
+                    intArrayOf(0, 1, 1),
+                    intArrayOf(1, 1, 1),
+                    intArrayOf(1, 0, 0),
                 ),
-                1
+                1,
             ),
-            equalTo(-1)
+            equalTo(-1),
         )
     }
 }
diff --git a/src/test/kotlin/g1201_1300/s1296_divide_array_in_sets_of_k_consecutive_numbers/SolutionTest.kt b/src/test/kotlin/g1201_1300/s1296_divide_array_in_sets_of_k_consecutive_numbers/SolutionTest.kt
index 5678b7685..fc659cc2a 100644
--- a/src/test/kotlin/g1201_1300/s1296_divide_array_in_sets_of_k_consecutive_numbers/SolutionTest.kt
+++ b/src/test/kotlin/g1201_1300/s1296_divide_array_in_sets_of_k_consecutive_numbers/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun isPossibleDivide() {
         assertThat(
             Solution().isPossibleDivide(intArrayOf(1, 2, 3, 3, 4, 4, 5, 6), 4),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
@@ -18,7 +18,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .isPossibleDivide(intArrayOf(3, 2, 1, 2, 3, 4, 3, 4, 5, 9, 10, 11), 3),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
diff --git a/src/test/kotlin/g1201_1300/s1298_maximum_candies_you_can_get_from_boxes/SolutionTest.kt b/src/test/kotlin/g1201_1300/s1298_maximum_candies_you_can_get_from_boxes/SolutionTest.kt
index 5fb33ff36..15c628e15 100644
--- a/src/test/kotlin/g1201_1300/s1298_maximum_candies_you_can_get_from_boxes/SolutionTest.kt
+++ b/src/test/kotlin/g1201_1300/s1298_maximum_candies_you_can_get_from_boxes/SolutionTest.kt
@@ -10,18 +10,23 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .maxCandies(
-                    intArrayOf(1, 0, 1, 0), intArrayOf(7, 5, 4, 100),
+                    intArrayOf(1, 0, 1, 0),
+                    intArrayOf(7, 5, 4, 100),
                     arrayOf(
-                        intArrayOf(), intArrayOf(), intArrayOf(1),
-                        intArrayOf()
+                        intArrayOf(),
+                        intArrayOf(),
+                        intArrayOf(1),
+                        intArrayOf(),
                     ),
                     arrayOf(
-                        intArrayOf(1, 2), intArrayOf(3),
-                        intArrayOf(), intArrayOf()
+                        intArrayOf(1, 2),
+                        intArrayOf(3),
+                        intArrayOf(),
+                        intArrayOf(),
                     ),
-                    intArrayOf(0)
+                    intArrayOf(0),
                 ),
-            equalTo(16)
+            equalTo(16),
         )
     }
 
@@ -34,15 +39,23 @@ internal class SolutionTest {
                     intArrayOf(1, 1, 1, 1, 1, 1),
                     arrayOf(
                         intArrayOf(1, 2, 3, 4, 5),
-                        intArrayOf(), intArrayOf(), intArrayOf(), intArrayOf(), intArrayOf()
+                        intArrayOf(),
+                        intArrayOf(),
+                        intArrayOf(),
+                        intArrayOf(),
+                        intArrayOf(),
                     ),
                     arrayOf(
-                        intArrayOf(1, 2, 3, 4, 5), intArrayOf(), intArrayOf(),
-                        intArrayOf(), intArrayOf(), intArrayOf()
+                        intArrayOf(1, 2, 3, 4, 5),
+                        intArrayOf(),
+                        intArrayOf(),
+                        intArrayOf(),
+                        intArrayOf(),
+                        intArrayOf(),
                     ),
-                    intArrayOf(0)
+                    intArrayOf(0),
                 ),
-            equalTo(6)
+            equalTo(6),
         )
     }
 }
diff --git a/src/test/kotlin/g1201_1300/s1299_replace_elements_with_greatest_element_on_right_side/SolutionTest.kt b/src/test/kotlin/g1201_1300/s1299_replace_elements_with_greatest_element_on_right_side/SolutionTest.kt
index 704467d47..b5d5fa543 100644
--- a/src/test/kotlin/g1201_1300/s1299_replace_elements_with_greatest_element_on_right_side/SolutionTest.kt
+++ b/src/test/kotlin/g1201_1300/s1299_replace_elements_with_greatest_element_on_right_side/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun replaceElements() {
         assertThat(
             Solution().replaceElements(intArrayOf(17, 18, 5, 4, 6, 1)),
-            equalTo(intArrayOf(18, 6, 6, 6, 1, -1))
+            equalTo(intArrayOf(18, 6, 6, 6, 1, -1)),
         )
     }
 
diff --git a/src/test/kotlin/g1301_1400/s1301_number_of_paths_with_max_score/SolutionTest.kt b/src/test/kotlin/g1301_1400/s1301_number_of_paths_with_max_score/SolutionTest.kt
index 25869cf00..1b34eb662 100644
--- a/src/test/kotlin/g1301_1400/s1301_number_of_paths_with_max_score/SolutionTest.kt
+++ b/src/test/kotlin/g1301_1400/s1301_number_of_paths_with_max_score/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun pathsWithMaxScore() {
         assertThat(
             Solution().pathsWithMaxScore(mutableListOf("E23", "2X2", "12S")),
-            equalTo(intArrayOf(7, 1))
+            equalTo(intArrayOf(7, 1)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun pathsWithMaxScore2() {
         assertThat(
             Solution().pathsWithMaxScore(mutableListOf("E12", "1X1", "21S")),
-            equalTo(intArrayOf(4, 2))
+            equalTo(intArrayOf(4, 2)),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun pathsWithMaxScore3() {
         assertThat(
             Solution().pathsWithMaxScore(mutableListOf("E11", "XXX", "11S")),
-            equalTo(intArrayOf(0, 0))
+            equalTo(intArrayOf(0, 0)),
         )
     }
 }
diff --git a/src/test/kotlin/g1301_1400/s1305_all_elements_in_two_binary_search_trees/SolutionTest.kt b/src/test/kotlin/g1301_1400/s1305_all_elements_in_two_binary_search_trees/SolutionTest.kt
index 765f9711d..6f581994e 100644
--- a/src/test/kotlin/g1301_1400/s1305_all_elements_in_two_binary_search_trees/SolutionTest.kt
+++ b/src/test/kotlin/g1301_1400/s1305_all_elements_in_two_binary_search_trees/SolutionTest.kt
@@ -12,9 +12,9 @@ internal class SolutionTest {
             Solution()
                 .getAllElements(
                     TreeNode.create(mutableListOf(2, 1, 4))!!,
-                    TreeNode.create(mutableListOf(1, 0, 3))!!
+                    TreeNode.create(mutableListOf(1, 0, 3))!!,
                 ),
-            equalTo(mutableListOf(0, 1, 1, 2, 3, 4))
+            equalTo(mutableListOf(0, 1, 1, 2, 3, 4)),
         )
     }
 
@@ -24,9 +24,9 @@ internal class SolutionTest {
             Solution()
                 .getAllElements(
                     TreeNode.create(mutableListOf(1, null, 8))!!,
-                    TreeNode.create(mutableListOf(8, 1))!!
+                    TreeNode.create(mutableListOf(8, 1))!!,
                 ),
-            equalTo(mutableListOf(1, 1, 8, 8))
+            equalTo(mutableListOf(1, 1, 8, 8)),
         )
     }
 }
diff --git a/src/test/kotlin/g1301_1400/s1307_verbal_arithmetic_puzzle/SolutionTest.kt b/src/test/kotlin/g1301_1400/s1307_verbal_arithmetic_puzzle/SolutionTest.kt
index 30be21061..10ad1e19f 100644
--- a/src/test/kotlin/g1301_1400/s1307_verbal_arithmetic_puzzle/SolutionTest.kt
+++ b/src/test/kotlin/g1301_1400/s1307_verbal_arithmetic_puzzle/SolutionTest.kt
@@ -8,7 +8,8 @@ internal class SolutionTest {
     @Test
     fun isSolvable() {
         assertThat(
-            Solution().isSolvable(arrayOf("SEND", "MORE"), "MONEY"), equalTo(true)
+            Solution().isSolvable(arrayOf("SEND", "MORE"), "MONEY"),
+            equalTo(true),
         )
     }
 
@@ -16,14 +17,15 @@ internal class SolutionTest {
     fun isSolvable2() {
         assertThat(
             Solution().isSolvable(arrayOf("SIX", "SEVEN", "SEVEN"), "TWENTY"),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
     @Test
     fun isSolvable3() {
         assertThat(
-            Solution().isSolvable(arrayOf("LEET", "CODE"), "POINT"), equalTo(false)
+            Solution().isSolvable(arrayOf("LEET", "CODE"), "POINT"),
+            equalTo(false),
         )
     }
 }
diff --git a/src/test/kotlin/g1301_1400/s1310_xor_queries_of_a_subarray/SolutionTest.kt b/src/test/kotlin/g1301_1400/s1310_xor_queries_of_a_subarray/SolutionTest.kt
index 7eec17530..b95980278 100644
--- a/src/test/kotlin/g1301_1400/s1310_xor_queries_of_a_subarray/SolutionTest.kt
+++ b/src/test/kotlin/g1301_1400/s1310_xor_queries_of_a_subarray/SolutionTest.kt
@@ -12,11 +12,13 @@ internal class SolutionTest {
                 .xorQueries(
                     intArrayOf(1, 3, 4, 8),
                     arrayOf(
-                        intArrayOf(0, 1), intArrayOf(1, 2),
-                        intArrayOf(0, 3), intArrayOf(3, 3)
-                    )
+                        intArrayOf(0, 1),
+                        intArrayOf(1, 2),
+                        intArrayOf(0, 3),
+                        intArrayOf(3, 3),
+                    ),
                 ),
-            equalTo(intArrayOf(2, 7, 14, 8))
+            equalTo(intArrayOf(2, 7, 14, 8)),
         )
     }
 
@@ -27,11 +29,13 @@ internal class SolutionTest {
                 .xorQueries(
                     intArrayOf(4, 8, 2, 10),
                     arrayOf(
-                        intArrayOf(2, 3), intArrayOf(1, 3),
-                        intArrayOf(0, 0), intArrayOf(0, 3)
-                    )
+                        intArrayOf(2, 3),
+                        intArrayOf(1, 3),
+                        intArrayOf(0, 0),
+                        intArrayOf(0, 3),
+                    ),
                 ),
-            equalTo(intArrayOf(8, 0, 4, 4))
+            equalTo(intArrayOf(8, 0, 4, 4)),
         )
     }
 }
diff --git a/src/test/kotlin/g1301_1400/s1311_get_watched_videos_by_your_friends/SolutionTest.kt b/src/test/kotlin/g1301_1400/s1311_get_watched_videos_by_your_friends/SolutionTest.kt
index e8a47e9c7..c74bb1855 100644
--- a/src/test/kotlin/g1301_1400/s1311_get_watched_videos_by_your_friends/SolutionTest.kt
+++ b/src/test/kotlin/g1301_1400/s1311_get_watched_videos_by_your_friends/SolutionTest.kt
@@ -11,17 +11,21 @@ internal class SolutionTest {
             Solution()
                 .watchedVideosByFriends(
                     listOf(
-                        mutableListOf("A", "B"), listOf("C"), mutableListOf("B", "C"),
-                        listOf("D")
+                        mutableListOf("A", "B"),
+                        listOf("C"),
+                        mutableListOf("B", "C"),
+                        listOf("D"),
                     ),
                     arrayOf(
-                        intArrayOf(1, 2), intArrayOf(0, 3),
-                        intArrayOf(0, 3), intArrayOf(1, 2)
+                        intArrayOf(1, 2),
+                        intArrayOf(0, 3),
+                        intArrayOf(0, 3),
+                        intArrayOf(1, 2),
                     ),
                     0,
-                    1
+                    1,
                 ),
-            equalTo(mutableListOf("B", "C"))
+            equalTo(mutableListOf("B", "C")),
         )
     }
 
@@ -31,14 +35,16 @@ internal class SolutionTest {
             Solution()
                 .watchedVideosByFriends(
                     listOf(
-                        mutableListOf("A", "B"), listOf("C"),
-                        mutableListOf("B", "C"), listOf("D")
+                        mutableListOf("A", "B"),
+                        listOf("C"),
+                        mutableListOf("B", "C"),
+                        listOf("D"),
                     ),
                     arrayOf(intArrayOf(1, 2), intArrayOf(0, 3), intArrayOf(0, 3), intArrayOf(1, 2)),
                     0,
-                    2
+                    2,
                 ),
-            equalTo(listOf("D"))
+            equalTo(listOf("D")),
         )
     }
 }
diff --git a/src/test/kotlin/g1301_1400/s1313_decompress_run_length_encoded_list/SolutionTest.kt b/src/test/kotlin/g1301_1400/s1313_decompress_run_length_encoded_list/SolutionTest.kt
index caa4920cb..0fa676f68 100644
--- a/src/test/kotlin/g1301_1400/s1313_decompress_run_length_encoded_list/SolutionTest.kt
+++ b/src/test/kotlin/g1301_1400/s1313_decompress_run_length_encoded_list/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun decompressRLElist() {
         assertThat(
             Solution().decompressRLElist(intArrayOf(1, 2, 3, 4)),
-            equalTo(intArrayOf(2, 4, 4, 4))
+            equalTo(intArrayOf(2, 4, 4, 4)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun decompressRLElist2() {
         assertThat(
             Solution().decompressRLElist(intArrayOf(1, 1, 2, 3)),
-            equalTo(intArrayOf(1, 3, 3))
+            equalTo(intArrayOf(1, 3, 3)),
         )
     }
 }
diff --git a/src/test/kotlin/g1301_1400/s1314_matrix_block_sum/SolutionTest.kt b/src/test/kotlin/g1301_1400/s1314_matrix_block_sum/SolutionTest.kt
index a6f2b21c5..d59ae51eb 100644
--- a/src/test/kotlin/g1301_1400/s1314_matrix_block_sum/SolutionTest.kt
+++ b/src/test/kotlin/g1301_1400/s1314_matrix_block_sum/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun matrixBlockSum() {
         assertThat(
             Solution().matrixBlockSum(arrayOf(intArrayOf(1, 2, 3), intArrayOf(4, 5, 6), intArrayOf(7, 8, 9)), 1),
-            equalTo(arrayOf(intArrayOf(12, 21, 16), intArrayOf(27, 45, 33), intArrayOf(24, 39, 28)))
+            equalTo(arrayOf(intArrayOf(12, 21, 16), intArrayOf(27, 45, 33), intArrayOf(24, 39, 28))),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun matrixBlockSum2() {
         assertThat(
             Solution().matrixBlockSum(arrayOf(intArrayOf(1, 2, 3), intArrayOf(4, 5, 6), intArrayOf(7, 8, 9)), 2),
-            equalTo(arrayOf(intArrayOf(45, 45, 45), intArrayOf(45, 45, 45), intArrayOf(45, 45, 45)))
+            equalTo(arrayOf(intArrayOf(45, 45, 45), intArrayOf(45, 45, 45), intArrayOf(45, 45, 45))),
         )
     }
 }
diff --git a/src/test/kotlin/g1301_1400/s1319_number_of_operations_to_make_network_connected/SolutionTest.kt b/src/test/kotlin/g1301_1400/s1319_number_of_operations_to_make_network_connected/SolutionTest.kt
index b798d4a2a..5a498796d 100644
--- a/src/test/kotlin/g1301_1400/s1319_number_of_operations_to_make_network_connected/SolutionTest.kt
+++ b/src/test/kotlin/g1301_1400/s1319_number_of_operations_to_make_network_connected/SolutionTest.kt
@@ -12,10 +12,11 @@ internal class SolutionTest {
                 4,
                 arrayOf(
                     intArrayOf(0, 1),
-                    intArrayOf(0, 2), intArrayOf(1, 2)
-                )
+                    intArrayOf(0, 2),
+                    intArrayOf(1, 2),
+                ),
             ),
-            equalTo(1)
+            equalTo(1),
         )
     }
 
@@ -27,10 +28,13 @@ internal class SolutionTest {
                     6,
                     arrayOf(
                         intArrayOf(0, 1),
-                        intArrayOf(0, 2), intArrayOf(0, 3), intArrayOf(1, 2), intArrayOf(1, 3)
-                    )
+                        intArrayOf(0, 2),
+                        intArrayOf(0, 3),
+                        intArrayOf(1, 2),
+                        intArrayOf(1, 3),
+                    ),
                 ),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -41,10 +45,12 @@ internal class SolutionTest {
                 6,
                 arrayOf(
                     intArrayOf(0, 1),
-                    intArrayOf(0, 2), intArrayOf(0, 3), intArrayOf(1, 2)
-                )
+                    intArrayOf(0, 2),
+                    intArrayOf(0, 3),
+                    intArrayOf(1, 2),
+                ),
             ),
-            equalTo(-1)
+            equalTo(-1),
         )
     }
 }
diff --git a/src/test/kotlin/g1301_1400/s1321_restaurant_growth/MysqlTest.kt b/src/test/kotlin/g1301_1400/s1321_restaurant_growth/MysqlTest.kt
index 03d46e09d..94031c3cb 100644
--- a/src/test/kotlin/g1301_1400/s1321_restaurant_growth/MysqlTest.kt
+++ b/src/test/kotlin/g1301_1400/s1321_restaurant_growth/MysqlTest.kt
@@ -39,8 +39,8 @@ import javax.sql.DataSource
             "INSERT INTO Customer(customer_id, name, visited_on, amount)" +
             " VALUES (1, 'Jhon', '2019-01-10', 130); " +
             "INSERT INTO Customer(customer_id, name, visited_on, amount)" +
-            " VALUES (3, 'Jaze', '2019-01-10', 150); "
-    ]
+            " VALUES (3, 'Jaze', '2019-01-10', 150); ",
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -52,12 +52,12 @@ internal class MysqlTest {
                     BufferedReader(
                         FileReader(
                             "src/main/kotlin/g1301_1400/s1321_restaurant_growth" +
-                                "/script.sql"
-                        )
+                                "/script.sql",
+                        ),
                     )
                         .lines()
                         .collect(Collectors.joining("\n"))
-                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace("#.*?\\r?\\n".toRegex(), ""),
                 ).use { resultSet ->
                     assertThat(resultSet.next(), equalTo(true))
                     assertThat(resultSet.getNString(1), equalTo("2019-01-07"))
diff --git a/src/test/kotlin/g1301_1400/s1324_print_words_vertically/SolutionTest.kt b/src/test/kotlin/g1301_1400/s1324_print_words_vertically/SolutionTest.kt
index 5a5a23e4f..5c5c89b71 100644
--- a/src/test/kotlin/g1301_1400/s1324_print_words_vertically/SolutionTest.kt
+++ b/src/test/kotlin/g1301_1400/s1324_print_words_vertically/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun printVertically() {
         assertThat(
             Solution().printVertically("HOW ARE YOU"),
-            equalTo(mutableListOf("HAY", "ORO", "WEU"))
+            equalTo(mutableListOf("HAY", "ORO", "WEU")),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun printVertically2() {
         assertThat(
             Solution().printVertically("TO BE OR NOT TO BE"),
-            equalTo(mutableListOf("TBONTB", "OEROOE", "   T"))
+            equalTo(mutableListOf("TBONTB", "OEROOE", "   T")),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun printVertically3() {
         assertThat(
             Solution().printVertically("CONTEST IS COMING"),
-            equalTo(mutableListOf("CIC", "OSO", "N M", "T I", "E N", "S G", "T"))
+            equalTo(mutableListOf("CIC", "OSO", "N M", "T I", "E N", "S G", "T")),
         )
     }
 }
diff --git a/src/test/kotlin/g1301_1400/s1325_delete_leaves_with_a_given_value/SolutionTest.kt b/src/test/kotlin/g1301_1400/s1325_delete_leaves_with_a_given_value/SolutionTest.kt
index d120a472c..531161671 100644
--- a/src/test/kotlin/g1301_1400/s1325_delete_leaves_with_a_given_value/SolutionTest.kt
+++ b/src/test/kotlin/g1301_1400/s1325_delete_leaves_with_a_given_value/SolutionTest.kt
@@ -12,7 +12,7 @@ internal class SolutionTest {
         val expected = TreeNode.create(mutableListOf(1, null, 3, null, 4))
         assertThat(
             Solution().removeLeafNodes(treeNode, 2).toString(),
-            equalTo(expected.toString())
+            equalTo(expected.toString()),
         )
     }
 
@@ -22,7 +22,7 @@ internal class SolutionTest {
         val expected = TreeNode.create(mutableListOf(1, 3, null, null, 2))
         assertThat(
             Solution().removeLeafNodes(treeNode, 3).toString(),
-            equalTo(expected.toString())
+            equalTo(expected.toString()),
         )
     }
 
@@ -32,7 +32,7 @@ internal class SolutionTest {
         val expected = TreeNode.create(listOf(1))
         assertThat(
             Solution().removeLeafNodes(treeNode, 2).toString(),
-            equalTo(expected.toString())
+            equalTo(expected.toString()),
         )
     }
 }
diff --git a/src/test/kotlin/g1301_1400/s1327_list_the_products_ordered_in_a_period/MysqlTest.kt b/src/test/kotlin/g1301_1400/s1327_list_the_products_ordered_in_a_period/MysqlTest.kt
index b17df81a6..07c448c05 100644
--- a/src/test/kotlin/g1301_1400/s1327_list_the_products_ordered_in_a_period/MysqlTest.kt
+++ b/src/test/kotlin/g1301_1400/s1327_list_the_products_ordered_in_a_period/MysqlTest.kt
@@ -51,8 +51,8 @@ import javax.sql.DataSource
             "INSERT INTO Orders(product_id, order_date, unit)" +
             " VALUES (5, '2020-02-27', 50); " +
             "INSERT INTO Orders(product_id, order_date, unit)" +
-            " VALUES (5, '2020-03-01', 50); "
-    ]
+            " VALUES (5, '2020-03-01', 50); ",
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -64,12 +64,12 @@ internal class MysqlTest {
                     BufferedReader(
                         FileReader(
                             "src/main/kotlin/g1301_1400/s1327_list_the_products_ordered_in_a_period" +
-                                "/script.sql"
-                        )
+                                "/script.sql",
+                        ),
                     )
                         .lines()
                         .collect(Collectors.joining("\n"))
-                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace("#.*?\\r?\\n".toRegex(), ""),
                 ).use { resultSet ->
                     assertThat(resultSet.next(), equalTo(true))
                     assertThat(resultSet.getNString(1), equalTo("Leetcode Kit"))
diff --git a/src/test/kotlin/g1301_1400/s1329_sort_the_matrix_diagonally/SolutionTest.kt b/src/test/kotlin/g1301_1400/s1329_sort_the_matrix_diagonally/SolutionTest.kt
index 5295b980a..04b702cce 100644
--- a/src/test/kotlin/g1301_1400/s1329_sort_the_matrix_diagonally/SolutionTest.kt
+++ b/src/test/kotlin/g1301_1400/s1329_sort_the_matrix_diagonally/SolutionTest.kt
@@ -15,13 +15,18 @@ internal class SolutionTest {
     @Test
     fun diagonalSort2() {
         val mat = arrayOf(
-            intArrayOf(11, 25, 66, 1, 69, 7), intArrayOf(23, 55, 17, 45, 15, 52),
-            intArrayOf(75, 31, 36, 44, 58, 8), intArrayOf(22, 27, 33, 25, 68, 4), intArrayOf(84, 28, 14, 11, 5, 50)
+            intArrayOf(11, 25, 66, 1, 69, 7),
+            intArrayOf(23, 55, 17, 45, 15, 52),
+            intArrayOf(75, 31, 36, 44, 58, 8),
+            intArrayOf(22, 27, 33, 25, 68, 4),
+            intArrayOf(84, 28, 14, 11, 5, 50),
         )
         val expected = arrayOf(
-            intArrayOf(5, 17, 4, 1, 52, 7), intArrayOf(11, 11, 25, 45, 8, 69),
-            intArrayOf(14, 23, 25, 44, 58, 15), intArrayOf(22, 27, 31, 36, 50, 66),
-            intArrayOf(84, 28, 75, 33, 55, 68)
+            intArrayOf(5, 17, 4, 1, 52, 7),
+            intArrayOf(11, 11, 25, 45, 8, 69),
+            intArrayOf(14, 23, 25, 44, 58, 15),
+            intArrayOf(22, 27, 31, 36, 50, 66),
+            intArrayOf(84, 28, 75, 33, 55, 68),
         )
         assertThat(Solution().diagonalSort(mat), equalTo(expected))
     }
diff --git a/src/test/kotlin/g1301_1400/s1330_reverse_subarray_to_maximize_array_value/SolutionTest.kt b/src/test/kotlin/g1301_1400/s1330_reverse_subarray_to_maximize_array_value/SolutionTest.kt
index cc0d49e91..1854e9de0 100644
--- a/src/test/kotlin/g1301_1400/s1330_reverse_subarray_to_maximize_array_value/SolutionTest.kt
+++ b/src/test/kotlin/g1301_1400/s1330_reverse_subarray_to_maximize_array_value/SolutionTest.kt
@@ -14,7 +14,7 @@ internal class SolutionTest {
     fun maxValueAfterReverse2() {
         assertThat(
             Solution().maxValueAfterReverse(intArrayOf(2, 4, 9, 24, 2, 1, 10)),
-            equalTo(68)
+            equalTo(68),
         )
     }
 }
diff --git a/src/test/kotlin/g1301_1400/s1331_rank_transform_of_an_array/SolutionTest.kt b/src/test/kotlin/g1301_1400/s1331_rank_transform_of_an_array/SolutionTest.kt
index 9257afd7a..536bf7589 100644
--- a/src/test/kotlin/g1301_1400/s1331_rank_transform_of_an_array/SolutionTest.kt
+++ b/src/test/kotlin/g1301_1400/s1331_rank_transform_of_an_array/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun arrayRankTransform() {
         assertThat(
             Solution().arrayRankTransform(intArrayOf(40, 10, 20, 30)),
-            equalTo(intArrayOf(4, 1, 2, 3))
+            equalTo(intArrayOf(4, 1, 2, 3)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun arrayRankTransform2() {
         assertThat(
             Solution().arrayRankTransform(intArrayOf(100, 100, 100)),
-            equalTo(intArrayOf(1, 1, 1))
+            equalTo(intArrayOf(1, 1, 1)),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun arrayRankTransform3() {
         assertThat(
             Solution().arrayRankTransform(intArrayOf(37, 12, 28, 9, 100, 56, 80, 5, 12)),
-            equalTo(intArrayOf(5, 3, 4, 2, 8, 6, 7, 1, 3))
+            equalTo(intArrayOf(5, 3, 4, 2, 8, 6, 7, 1, 3)),
         )
     }
 }
diff --git a/src/test/kotlin/g1301_1400/s1333_filter_restaurants_by_vegan_friendly_price_and_distance/SolutionTest.kt b/src/test/kotlin/g1301_1400/s1333_filter_restaurants_by_vegan_friendly_price_and_distance/SolutionTest.kt
index eeffb2cc1..372f518b6 100644
--- a/src/test/kotlin/g1301_1400/s1333_filter_restaurants_by_vegan_friendly_price_and_distance/SolutionTest.kt
+++ b/src/test/kotlin/g1301_1400/s1333_filter_restaurants_by_vegan_friendly_price_and_distance/SolutionTest.kt
@@ -8,36 +8,45 @@ internal class SolutionTest {
     @Test
     fun filterRestaurants() {
         val restaurants = arrayOf(
-            intArrayOf(1, 4, 1, 40, 10), intArrayOf(2, 8, 0, 50, 5),
-            intArrayOf(3, 8, 1, 30, 4), intArrayOf(4, 10, 0, 10, 3), intArrayOf(5, 1, 1, 15, 1)
+            intArrayOf(1, 4, 1, 40, 10),
+            intArrayOf(2, 8, 0, 50, 5),
+            intArrayOf(3, 8, 1, 30, 4),
+            intArrayOf(4, 10, 0, 10, 3),
+            intArrayOf(5, 1, 1, 15, 1),
         )
         assertThat(
             Solution().filterRestaurants(restaurants, 1, 50, 10),
-            equalTo(mutableListOf(3, 1, 5))
+            equalTo(mutableListOf(3, 1, 5)),
         )
     }
 
     @Test
     fun filterRestaurants2() {
         val restaurants = arrayOf(
-            intArrayOf(1, 4, 1, 40, 10), intArrayOf(2, 8, 0, 50, 5),
-            intArrayOf(3, 8, 1, 30, 4), intArrayOf(4, 10, 0, 10, 3), intArrayOf(5, 1, 1, 15, 1)
+            intArrayOf(1, 4, 1, 40, 10),
+            intArrayOf(2, 8, 0, 50, 5),
+            intArrayOf(3, 8, 1, 30, 4),
+            intArrayOf(4, 10, 0, 10, 3),
+            intArrayOf(5, 1, 1, 15, 1),
         )
         assertThat(
             Solution().filterRestaurants(restaurants, 0, 50, 10),
-            equalTo(mutableListOf(4, 3, 2, 1, 5))
+            equalTo(mutableListOf(4, 3, 2, 1, 5)),
         )
     }
 
     @Test
     fun filterRestaurants3() {
         val restaurants = arrayOf(
-            intArrayOf(1, 4, 1, 40, 10), intArrayOf(2, 8, 0, 50, 5),
-            intArrayOf(3, 8, 1, 30, 4), intArrayOf(4, 10, 0, 10, 3), intArrayOf(5, 1, 1, 15, 1)
+            intArrayOf(1, 4, 1, 40, 10),
+            intArrayOf(2, 8, 0, 50, 5),
+            intArrayOf(3, 8, 1, 30, 4),
+            intArrayOf(4, 10, 0, 10, 3),
+            intArrayOf(5, 1, 1, 15, 1),
         )
         assertThat(
             Solution().filterRestaurants(restaurants, 0, 30, 3),
-            equalTo(mutableListOf(4, 5))
+            equalTo(mutableListOf(4, 5)),
         )
     }
 }
diff --git a/src/test/kotlin/g1301_1400/s1334_find_the_city_with_the_smallest_number_of_neighbors_at_a_threshold_distance/SolutionTest.kt b/src/test/kotlin/g1301_1400/s1334_find_the_city_with_the_smallest_number_of_neighbors_at_a_threshold_distance/SolutionTest.kt
index e40bdd5f4..a4e0a94fe 100644
--- a/src/test/kotlin/g1301_1400/s1334_find_the_city_with_the_smallest_number_of_neighbors_at_a_threshold_distance/SolutionTest.kt
+++ b/src/test/kotlin/g1301_1400/s1334_find_the_city_with_the_smallest_number_of_neighbors_at_a_threshold_distance/SolutionTest.kt
@@ -14,8 +14,12 @@ internal class SolutionTest {
     @Test
     fun findTheCity2() {
         val edges = arrayOf(
-            intArrayOf(0, 1, 2), intArrayOf(0, 4, 8), intArrayOf(1, 2, 3), intArrayOf(1, 4, 2),
-            intArrayOf(2, 3, 1), intArrayOf(3, 4, 1)
+            intArrayOf(0, 1, 2),
+            intArrayOf(0, 4, 8),
+            intArrayOf(1, 2, 3),
+            intArrayOf(1, 4, 2),
+            intArrayOf(2, 3, 1),
+            intArrayOf(3, 4, 1),
         )
         assertThat(Solution().findTheCity(5, edges, 2), equalTo(0))
     }
diff --git a/src/test/kotlin/g1301_1400/s1337_the_k_weakest_rows_in_a_matrix/SolutionTest.kt b/src/test/kotlin/g1301_1400/s1337_the_k_weakest_rows_in_a_matrix/SolutionTest.kt
index c6d1510c3..6c0b1ea1b 100644
--- a/src/test/kotlin/g1301_1400/s1337_the_k_weakest_rows_in_a_matrix/SolutionTest.kt
+++ b/src/test/kotlin/g1301_1400/s1337_the_k_weakest_rows_in_a_matrix/SolutionTest.kt
@@ -8,8 +8,11 @@ internal class SolutionTest {
     @Test
     fun kWeakestRows() {
         val mat = arrayOf(
-            intArrayOf(1, 1, 0, 0, 0), intArrayOf(1, 1, 1, 1, 0), intArrayOf(1, 0, 0, 0, 0),
-            intArrayOf(1, 1, 0, 0, 0), intArrayOf(1, 1, 1, 1, 1)
+            intArrayOf(1, 1, 0, 0, 0),
+            intArrayOf(1, 1, 1, 1, 0),
+            intArrayOf(1, 0, 0, 0, 0),
+            intArrayOf(1, 1, 0, 0, 0),
+            intArrayOf(1, 1, 1, 1, 1),
         )
         assertThat(Solution().kWeakestRows(mat, 3), equalTo(intArrayOf(2, 0, 3)))
     }
@@ -17,8 +20,10 @@ internal class SolutionTest {
     @Test
     fun kWeakestRows2() {
         val mat = arrayOf(
-            intArrayOf(1, 0, 0, 0), intArrayOf(1, 1, 1, 1), intArrayOf(1, 0, 0, 0),
-            intArrayOf(1, 0, 0, 0)
+            intArrayOf(1, 0, 0, 0),
+            intArrayOf(1, 1, 1, 1),
+            intArrayOf(1, 0, 0, 0),
+            intArrayOf(1, 0, 0, 0),
         )
         assertThat(Solution().kWeakestRows(mat, 2), equalTo(intArrayOf(0, 2)))
     }
diff --git a/src/test/kotlin/g1301_1400/s1338_reduce_array_size_to_the_half/SolutionTest.kt b/src/test/kotlin/g1301_1400/s1338_reduce_array_size_to_the_half/SolutionTest.kt
index 88b6256ca..25ed113a1 100644
--- a/src/test/kotlin/g1301_1400/s1338_reduce_array_size_to_the_half/SolutionTest.kt
+++ b/src/test/kotlin/g1301_1400/s1338_reduce_array_size_to_the_half/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun minSetSize() {
         assertThat(
             Solution().minSetSize(intArrayOf(3, 3, 3, 3, 5, 5, 5, 2, 2, 7)),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
diff --git a/src/test/kotlin/g1301_1400/s1340_jump_game_v/SolutionTest.kt b/src/test/kotlin/g1301_1400/s1340_jump_game_v/SolutionTest.kt
index 38d0c4e09..e6446debf 100644
--- a/src/test/kotlin/g1301_1400/s1340_jump_game_v/SolutionTest.kt
+++ b/src/test/kotlin/g1301_1400/s1340_jump_game_v/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun maxJumps() {
         assertThat(
             Solution().maxJumps(intArrayOf(6, 4, 14, 6, 8, 13, 9, 7, 10, 6, 12), 2),
-            equalTo(4)
+            equalTo(4),
         )
     }
 
diff --git a/src/test/kotlin/g1301_1400/s1341_movie_rating/MysqlTest.kt b/src/test/kotlin/g1301_1400/s1341_movie_rating/MysqlTest.kt
index 95acf9972..8295d1f36 100644
--- a/src/test/kotlin/g1301_1400/s1341_movie_rating/MysqlTest.kt
+++ b/src/test/kotlin/g1301_1400/s1341_movie_rating/MysqlTest.kt
@@ -50,8 +50,8 @@ import javax.sql.DataSource
             "INSERT INTO MovieRating(movie_id, user_id, rating, created_at)" +
             " VALUES (3, 1, 3, '2020-02-22'); " +
             "INSERT INTO MovieRating(movie_id, user_id, rating, created_at)" +
-            " VALUES (3, 2, 4, '2020-02-25'); "
-    ]
+            " VALUES (3, 2, 4, '2020-02-25'); ",
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -63,12 +63,12 @@ internal class MysqlTest {
                     BufferedReader(
                         FileReader(
                             "src/main/kotlin/g1301_1400/s1341_movie_rating" +
-                                "/script.sql"
-                        )
+                                "/script.sql",
+                        ),
                     )
                         .lines()
                         .collect(Collectors.joining("\n"))
-                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace("#.*?\\r?\\n".toRegex(), ""),
                 ).use { resultSet ->
                     assertThat(resultSet.next(), equalTo(true))
                     assertThat(resultSet.getNString(1), equalTo("Daniel"))
diff --git a/src/test/kotlin/g1301_1400/s1343_number_of_sub_arrays_of_size_k_and_average_greater_than_or_equal_to_threshold/SolutionTest.kt b/src/test/kotlin/g1301_1400/s1343_number_of_sub_arrays_of_size_k_and_average_greater_than_or_equal_to_threshold/SolutionTest.kt
index 01f9643ab..2d65c3dc1 100644
--- a/src/test/kotlin/g1301_1400/s1343_number_of_sub_arrays_of_size_k_and_average_greater_than_or_equal_to_threshold/SolutionTest.kt
+++ b/src/test/kotlin/g1301_1400/s1343_number_of_sub_arrays_of_size_k_and_average_greater_than_or_equal_to_threshold/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun numOfSubarrays() {
         assertThat(
             Solution().numOfSubarrays(intArrayOf(2, 2, 2, 2, 5, 5, 5, 8), 3, 4),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun numOfSubarrays2() {
         assertThat(
             Solution().numOfSubarrays(intArrayOf(11, 13, 17, 23, 29, 31, 7, 5, 2, 3), 3, 5),
-            equalTo(6)
+            equalTo(6),
         )
     }
 }
diff --git a/src/test/kotlin/g1301_1400/s1345_jump_game_iv/SolutionTest.kt b/src/test/kotlin/g1301_1400/s1345_jump_game_iv/SolutionTest.kt
index a01f55421..feb67e321 100644
--- a/src/test/kotlin/g1301_1400/s1345_jump_game_iv/SolutionTest.kt
+++ b/src/test/kotlin/g1301_1400/s1345_jump_game_iv/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun minJumps() {
         assertThat(
             Solution().minJumps(intArrayOf(100, -23, -23, 404, 100, 23, 23, 23, 3, 404)),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
diff --git a/src/test/kotlin/g1301_1400/s1348_tweet_counts_per_frequency/TweetCountsTest.kt b/src/test/kotlin/g1301_1400/s1348_tweet_counts_per_frequency/TweetCountsTest.kt
index db06096d7..9fb786fe5 100644
--- a/src/test/kotlin/g1301_1400/s1348_tweet_counts_per_frequency/TweetCountsTest.kt
+++ b/src/test/kotlin/g1301_1400/s1348_tweet_counts_per_frequency/TweetCountsTest.kt
@@ -13,16 +13,16 @@ internal class TweetCountsTest {
         tweetCounts.recordTweet("tweet3", 10)
         assertThat(
             tweetCounts.getTweetCountsPerFrequency("minute", "tweet3", 0, 59),
-            equalTo(listOf(2))
+            equalTo(listOf(2)),
         )
         assertThat(
             tweetCounts.getTweetCountsPerFrequency("minute", "tweet3", 0, 60),
-            equalTo(mutableListOf(2, 1))
+            equalTo(mutableListOf(2, 1)),
         )
         tweetCounts.recordTweet("tweet3", 120)
         assertThat(
             tweetCounts.getTweetCountsPerFrequency("hour", "tweet3", 0, 210),
-            equalTo(listOf(4))
+            equalTo(listOf(4)),
         )
     }
 }
diff --git a/src/test/kotlin/g1301_1400/s1349_maximum_students_taking_exam/SolutionTest.kt b/src/test/kotlin/g1301_1400/s1349_maximum_students_taking_exam/SolutionTest.kt
index d71b03605..fcf59078b 100644
--- a/src/test/kotlin/g1301_1400/s1349_maximum_students_taking_exam/SolutionTest.kt
+++ b/src/test/kotlin/g1301_1400/s1349_maximum_students_taking_exam/SolutionTest.kt
@@ -9,7 +9,8 @@ internal class SolutionTest {
     fun maxStudents() {
         val input = arrayOf(
             charArrayOf('#', '.', '#', '#', '.', '#'),
-            charArrayOf('.', '#', '#', '#', '#', '.'), charArrayOf('#', '.', '#', '#', '.', '#')
+            charArrayOf('.', '#', '#', '#', '#', '.'),
+            charArrayOf('#', '.', '#', '#', '.', '#'),
         )
         assertThat(Solution().maxStudents(input), equalTo(4))
     }
@@ -17,8 +18,11 @@ internal class SolutionTest {
     @Test
     fun maxStudents2() {
         val input = arrayOf(
-            charArrayOf('.', '#'), charArrayOf('#', '#'),
-            charArrayOf('#', '.'), charArrayOf('#', '#'), charArrayOf('.', '#')
+            charArrayOf('.', '#'),
+            charArrayOf('#', '#'),
+            charArrayOf('#', '.'),
+            charArrayOf('#', '#'),
+            charArrayOf('.', '#'),
         )
         assertThat(Solution().maxStudents(input), equalTo(3))
     }
@@ -27,8 +31,10 @@ internal class SolutionTest {
     fun maxStudents3() {
         val input = arrayOf(
             charArrayOf('#', '.', '.', '.', '#'),
-            charArrayOf('.', '#', '.', '#', '.'), charArrayOf('.', '.', '#', '.', '.'),
-            charArrayOf('.', '#', '.', '#', '.'), charArrayOf('#', '.', '.', '.', '#')
+            charArrayOf('.', '#', '.', '#', '.'),
+            charArrayOf('.', '.', '#', '.', '.'),
+            charArrayOf('.', '#', '.', '#', '.'),
+            charArrayOf('#', '.', '.', '.', '#'),
         )
         assertThat(Solution().maxStudents(input), equalTo(10))
     }
diff --git a/src/test/kotlin/g1301_1400/s1351_count_negative_numbers_in_a_sorted_matrix/SolutionTest.kt b/src/test/kotlin/g1301_1400/s1351_count_negative_numbers_in_a_sorted_matrix/SolutionTest.kt
index a92fe5fbb..9eaf1fbb5 100644
--- a/src/test/kotlin/g1301_1400/s1351_count_negative_numbers_in_a_sorted_matrix/SolutionTest.kt
+++ b/src/test/kotlin/g1301_1400/s1351_count_negative_numbers_in_a_sorted_matrix/SolutionTest.kt
@@ -12,10 +12,12 @@ internal class SolutionTest {
                 .countNegatives(
                     arrayOf(
                         intArrayOf(4, 3, 2, -1),
-                        intArrayOf(3, 2, 1, -1), intArrayOf(1, 1, -1, -2), intArrayOf(-1, -1, -2, -3)
-                    )
+                        intArrayOf(3, 2, 1, -1),
+                        intArrayOf(1, 1, -1, -2),
+                        intArrayOf(-1, -1, -2, -3),
+                    ),
                 ),
-            equalTo(8)
+            equalTo(8),
         )
     }
 
@@ -23,7 +25,7 @@ internal class SolutionTest {
     fun countNegatives2() {
         assertThat(
             Solution().countNegatives(arrayOf(intArrayOf(3, 2), intArrayOf(1, 0))),
-            equalTo(0)
+            equalTo(0),
         )
     }
 }
diff --git a/src/test/kotlin/g1301_1400/s1353_maximum_number_of_events_that_can_be_attended/SolutionTest.kt b/src/test/kotlin/g1301_1400/s1353_maximum_number_of_events_that_can_be_attended/SolutionTest.kt
index 11dafdd33..a72ba0440 100644
--- a/src/test/kotlin/g1301_1400/s1353_maximum_number_of_events_that_can_be_attended/SolutionTest.kt
+++ b/src/test/kotlin/g1301_1400/s1353_maximum_number_of_events_that_can_be_attended/SolutionTest.kt
@@ -11,10 +11,11 @@ internal class SolutionTest {
             Solution().maxEvents(
                 arrayOf(
                     intArrayOf(1, 2),
-                    intArrayOf(2, 3), intArrayOf(3, 4)
-                )
+                    intArrayOf(2, 3),
+                    intArrayOf(3, 4),
+                ),
             ),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
@@ -23,11 +24,13 @@ internal class SolutionTest {
         assertThat(
             Solution().maxEvents(
                 arrayOf(
-                    intArrayOf(1, 2), intArrayOf(2, 3),
-                    intArrayOf(3, 4), intArrayOf(1, 2)
-                )
+                    intArrayOf(1, 2),
+                    intArrayOf(2, 3),
+                    intArrayOf(3, 4),
+                    intArrayOf(1, 2),
+                ),
             ),
-            equalTo(4)
+            equalTo(4),
         )
     }
 }
diff --git a/src/test/kotlin/g1301_1400/s1356_sort_integers_by_the_number_of_1_bits/SolutionTest.kt b/src/test/kotlin/g1301_1400/s1356_sort_integers_by_the_number_of_1_bits/SolutionTest.kt
index 8a63774de..13acefdd6 100644
--- a/src/test/kotlin/g1301_1400/s1356_sort_integers_by_the_number_of_1_bits/SolutionTest.kt
+++ b/src/test/kotlin/g1301_1400/s1356_sort_integers_by_the_number_of_1_bits/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun sortByBits() {
         assertThat(
             Solution().sortByBits(intArrayOf(0, 1, 2, 3, 4, 5, 6, 7, 8)),
-            equalTo(intArrayOf(0, 1, 2, 4, 8, 3, 5, 6, 7))
+            equalTo(intArrayOf(0, 1, 2, 4, 8, 3, 5, 6, 7)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun sortByBits2() {
         assertThat(
             Solution().sortByBits(intArrayOf(1024, 512, 256, 128, 64, 32, 16, 8, 4, 2, 1)),
-            equalTo(intArrayOf(1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024))
+            equalTo(intArrayOf(1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024)),
         )
     }
 }
diff --git a/src/test/kotlin/g1301_1400/s1357_apply_discount_every_n_orders/CashierTest.kt b/src/test/kotlin/g1301_1400/s1357_apply_discount_every_n_orders/CashierTest.kt
index 280dc6e98..5b5ecef89 100644
--- a/src/test/kotlin/g1301_1400/s1357_apply_discount_every_n_orders/CashierTest.kt
+++ b/src/test/kotlin/g1301_1400/s1357_apply_discount_every_n_orders/CashierTest.kt
@@ -9,19 +9,21 @@ internal class CashierTest {
     fun cashierTest() {
         val cashier = Cashier(
             3,
-            50, intArrayOf(1, 2, 3, 4, 5, 6, 7), intArrayOf(100, 200, 300, 400, 300, 200, 100)
+            50,
+            intArrayOf(1, 2, 3, 4, 5, 6, 7),
+            intArrayOf(100, 200, 300, 400, 300, 200, 100),
         )
         assertThat(cashier.getBill(intArrayOf(1, 2), intArrayOf(1, 2)), equalTo(500.0))
         assertThat(cashier.getBill(intArrayOf(3, 7), intArrayOf(10, 10)), equalTo(4000.0))
         assertThat(
             cashier.getBill(intArrayOf(1, 2, 3, 4, 5, 6, 7), intArrayOf(1, 1, 1, 1, 1, 1, 1)),
-            equalTo(800.0)
+            equalTo(800.0),
         )
         assertThat(cashier.getBill(intArrayOf(4), intArrayOf(10)), equalTo(4000.0))
         assertThat(cashier.getBill(intArrayOf(7, 3), intArrayOf(10, 10)), equalTo(4000.0))
         assertThat(
             cashier.getBill(intArrayOf(7, 5, 3, 1, 6, 4, 2), intArrayOf(10, 10, 10, 9, 9, 9, 7)),
-            equalTo(7350.0)
+            equalTo(7350.0),
         )
         cashier.getBill(intArrayOf(2, 3, 5), intArrayOf(5, 3, 2))
     }
diff --git a/src/test/kotlin/g1301_1400/s1361_validate_binary_tree_nodes/SolutionTest.kt b/src/test/kotlin/g1301_1400/s1361_validate_binary_tree_nodes/SolutionTest.kt
index 40a9976e8..0767d5616 100644
--- a/src/test/kotlin/g1301_1400/s1361_validate_binary_tree_nodes/SolutionTest.kt
+++ b/src/test/kotlin/g1301_1400/s1361_validate_binary_tree_nodes/SolutionTest.kt
@@ -10,9 +10,11 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .validateBinaryTreeNodes(
-                    4, intArrayOf(1, -1, 3, -1), intArrayOf(2, -1, -1, -1)
+                    4,
+                    intArrayOf(1, -1, 3, -1),
+                    intArrayOf(2, -1, -1, -1),
                 ),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
@@ -21,9 +23,11 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .validateBinaryTreeNodes(
-                    4, intArrayOf(1, -1, 3, -1), intArrayOf(2, 3, -1, -1)
+                    4,
+                    intArrayOf(1, -1, 3, -1),
+                    intArrayOf(2, 3, -1, -1),
                 ),
-            equalTo(false)
+            equalTo(false),
         )
     }
 
@@ -31,7 +35,7 @@ internal class SolutionTest {
     fun validateBinaryTreeNodes3() {
         assertThat(
             Solution().validateBinaryTreeNodes(2, intArrayOf(1, 0), intArrayOf(-1, -1)),
-            equalTo(false)
+            equalTo(false),
         )
     }
 }
diff --git a/src/test/kotlin/g1301_1400/s1363_largest_multiple_of_three/SolutionTest.kt b/src/test/kotlin/g1301_1400/s1363_largest_multiple_of_three/SolutionTest.kt
index 92906bb3b..1bee24e63 100644
--- a/src/test/kotlin/g1301_1400/s1363_largest_multiple_of_three/SolutionTest.kt
+++ b/src/test/kotlin/g1301_1400/s1363_largest_multiple_of_three/SolutionTest.kt
@@ -13,7 +13,8 @@ internal class SolutionTest {
     @Test
     fun largestMultipleOfThree2() {
         assertThat(
-            Solution().largestMultipleOfThree(intArrayOf(8, 6, 7, 1, 0)), equalTo("8760")
+            Solution().largestMultipleOfThree(intArrayOf(8, 6, 7, 1, 0)),
+            equalTo("8760"),
         )
     }
 
diff --git a/src/test/kotlin/g1301_1400/s1365_how_many_numbers_are_smaller_than_the_current_number/SolutionTest.kt b/src/test/kotlin/g1301_1400/s1365_how_many_numbers_are_smaller_than_the_current_number/SolutionTest.kt
index a336e8812..c53f63656 100644
--- a/src/test/kotlin/g1301_1400/s1365_how_many_numbers_are_smaller_than_the_current_number/SolutionTest.kt
+++ b/src/test/kotlin/g1301_1400/s1365_how_many_numbers_are_smaller_than_the_current_number/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun smallerNumbersThanCurrent() {
         assertThat(
             Solution().smallerNumbersThanCurrent(intArrayOf(8, 1, 2, 2, 3)),
-            equalTo(intArrayOf(4, 0, 1, 1, 3))
+            equalTo(intArrayOf(4, 0, 1, 1, 3)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun smallerNumbersThanCurrent2() {
         assertThat(
             Solution().smallerNumbersThanCurrent(intArrayOf(6, 5, 4, 8)),
-            equalTo(intArrayOf(2, 1, 0, 3))
+            equalTo(intArrayOf(2, 1, 0, 3)),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun smallerNumbersThanCurrent3() {
         assertThat(
             Solution().smallerNumbersThanCurrent(intArrayOf(7, 7, 7, 7)),
-            equalTo(intArrayOf(0, 0, 0, 0))
+            equalTo(intArrayOf(0, 0, 0, 0)),
         )
     }
 }
diff --git a/src/test/kotlin/g1301_1400/s1366_rank_teams_by_votes/SolutionTest.kt b/src/test/kotlin/g1301_1400/s1366_rank_teams_by_votes/SolutionTest.kt
index 8e8895c75..febf71419 100644
--- a/src/test/kotlin/g1301_1400/s1366_rank_teams_by_votes/SolutionTest.kt
+++ b/src/test/kotlin/g1301_1400/s1366_rank_teams_by_votes/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun rankTeams() {
         assertThat(
             Solution().rankTeams(arrayOf("ABC", "ACB", "ABC", "ACB", "ACB")),
-            equalTo("ACB")
+            equalTo("ACB"),
         )
     }
 
@@ -22,7 +22,7 @@ internal class SolutionTest {
     fun rankTeams3() {
         assertThat(
             Solution().rankTeams(arrayOf("ZMNAGUEDSJYLBOPHRQICWFXTVK")),
-            equalTo("ZMNAGUEDSJYLBOPHRQICWFXTVK")
+            equalTo("ZMNAGUEDSJYLBOPHRQICWFXTVK"),
         )
     }
 }
diff --git a/src/test/kotlin/g1301_1400/s1367_linked_list_in_binary_tree/SolutionTest.kt b/src/test/kotlin/g1301_1400/s1367_linked_list_in_binary_tree/SolutionTest.kt
index 45032afe5..a15853bba 100644
--- a/src/test/kotlin/g1301_1400/s1367_linked_list_in_binary_tree/SolutionTest.kt
+++ b/src/test/kotlin/g1301_1400/s1367_linked_list_in_binary_tree/SolutionTest.kt
@@ -13,8 +13,8 @@ internal class SolutionTest {
         val treeNode = TreeNode.create(
             mutableListOf(
                 1, 4, 4, null, 2, 2, null, 1, null, 6, 8, null, null, null, null, 1,
-                3
-            )
+                3,
+            ),
         )
         assertThat(Solution().isSubPath(listNode, treeNode), equalTo(true))
     }
@@ -25,8 +25,8 @@ internal class SolutionTest {
         val treeNode = TreeNode.create(
             mutableListOf(
                 1, 4, 4, null, 2, 2, null, 1, null, 6, 8, null, null, null, null, 1,
-                3
-            )
+                3,
+            ),
         )
         assertThat(Solution().isSubPath(listNode, treeNode), equalTo(true))
     }
@@ -37,8 +37,8 @@ internal class SolutionTest {
         val treeNode = TreeNode.create(
             mutableListOf(
                 1, 4, 4, null, 2, 2, null, 1, null, 6, 8, null, null, null, null, 1,
-                3
-            )
+                3,
+            ),
         )
         assertThat(Solution().isSubPath(listNode, treeNode), equalTo(false))
     }
diff --git a/src/test/kotlin/g1301_1400/s1368_minimum_cost_to_make_at_least_one_valid_path_in_a_grid/SolutionTest.kt b/src/test/kotlin/g1301_1400/s1368_minimum_cost_to_make_at_least_one_valid_path_in_a_grid/SolutionTest.kt
index e0a431d0f..cb243a4ee 100644
--- a/src/test/kotlin/g1301_1400/s1368_minimum_cost_to_make_at_least_one_valid_path_in_a_grid/SolutionTest.kt
+++ b/src/test/kotlin/g1301_1400/s1368_minimum_cost_to_make_at_least_one_valid_path_in_a_grid/SolutionTest.kt
@@ -11,11 +11,13 @@ internal class SolutionTest {
             Solution()
                 .minCost(
                     arrayOf(
-                        intArrayOf(1, 1, 1, 1), intArrayOf(2, 2, 2, 2),
-                        intArrayOf(1, 1, 1, 1), intArrayOf(2, 2, 2, 2)
-                    )
+                        intArrayOf(1, 1, 1, 1),
+                        intArrayOf(2, 2, 2, 2),
+                        intArrayOf(1, 1, 1, 1),
+                        intArrayOf(2, 2, 2, 2),
+                    ),
                 ),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
@@ -24,11 +26,12 @@ internal class SolutionTest {
         assertThat(
             Solution().minCost(
                 arrayOf(
-                    intArrayOf(1, 1, 3), intArrayOf(3, 2, 2),
-                    intArrayOf(1, 1, 4)
-                )
+                    intArrayOf(1, 1, 3),
+                    intArrayOf(3, 2, 2),
+                    intArrayOf(1, 1, 4),
+                ),
             ),
-            equalTo(0)
+            equalTo(0),
         )
     }
 
@@ -38,10 +41,10 @@ internal class SolutionTest {
             Solution().minCost(
                 arrayOf(
                     intArrayOf(1, 2),
-                    intArrayOf(4, 3)
-                )
+                    intArrayOf(4, 3),
+                ),
             ),
-            equalTo(1)
+            equalTo(1),
         )
     }
 }
diff --git a/src/test/kotlin/g1301_1400/s1372_longest_zigzag_path_in_a_binary_tree/SolutionTest.kt b/src/test/kotlin/g1301_1400/s1372_longest_zigzag_path_in_a_binary_tree/SolutionTest.kt
index e402ef959..937b22f98 100644
--- a/src/test/kotlin/g1301_1400/s1372_longest_zigzag_path_in_a_binary_tree/SolutionTest.kt
+++ b/src/test/kotlin/g1301_1400/s1372_longest_zigzag_path_in_a_binary_tree/SolutionTest.kt
@@ -11,8 +11,8 @@ internal class SolutionTest {
         val treeNode = TreeNode.create(
             mutableListOf(
                 1, null, 1, 1, 1, null, null, 1, 1, null, 1, null, null, null, 1,
-                null, 1
-            )
+                null, 1,
+            ),
         )
         assertThat(Solution().longestZigZag(treeNode), equalTo(3))
     }
diff --git a/src/test/kotlin/g1301_1400/s1373_maximum_sum_bst_in_binary_tree/SolutionTest.kt b/src/test/kotlin/g1301_1400/s1373_maximum_sum_bst_in_binary_tree/SolutionTest.kt
index 68cc59361..d2053502f 100644
--- a/src/test/kotlin/g1301_1400/s1373_maximum_sum_bst_in_binary_tree/SolutionTest.kt
+++ b/src/test/kotlin/g1301_1400/s1373_maximum_sum_bst_in_binary_tree/SolutionTest.kt
@@ -10,8 +10,8 @@ internal class SolutionTest {
     fun maxSumBST() {
         val treeNode = TreeNode.create(
             mutableListOf(
-                1, 4, 3, 2, 4, 2, 5, null, null, null, null, null, null, 4, 6
-            )
+                1, 4, 3, 2, 4, 2, 5, null, null, null, null, null, null, 4, 6,
+            ),
         )
         assertThat(Solution().maxSumBST(treeNode), equalTo(20))
     }
diff --git a/src/test/kotlin/g1301_1400/s1376_time_needed_to_inform_all_employees/SolutionTest.kt b/src/test/kotlin/g1301_1400/s1376_time_needed_to_inform_all_employees/SolutionTest.kt
index 7d5e08e54..4133e4ea2 100644
--- a/src/test/kotlin/g1301_1400/s1376_time_needed_to_inform_all_employees/SolutionTest.kt
+++ b/src/test/kotlin/g1301_1400/s1376_time_needed_to_inform_all_employees/SolutionTest.kt
@@ -15,9 +15,12 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .numOfMinutes(
-                    6, 2, intArrayOf(2, 2, -1, 2, 2, 2), intArrayOf(0, 0, 1, 0, 0, 0)
+                    6,
+                    2,
+                    intArrayOf(2, 2, -1, 2, 2, 2),
+                    intArrayOf(0, 0, 1, 0, 0, 0),
                 ),
-            equalTo(1)
+            equalTo(1),
         )
     }
 }
diff --git a/src/test/kotlin/g1301_1400/s1377_frog_position_after_t_seconds/SolutionTest.kt b/src/test/kotlin/g1301_1400/s1377_frog_position_after_t_seconds/SolutionTest.kt
index c309e1a8a..3a9a0a38f 100644
--- a/src/test/kotlin/g1301_1400/s1377_frog_position_after_t_seconds/SolutionTest.kt
+++ b/src/test/kotlin/g1301_1400/s1377_frog_position_after_t_seconds/SolutionTest.kt
@@ -12,13 +12,17 @@ internal class SolutionTest {
                 .frogPosition(
                     7,
                     arrayOf(
-                        intArrayOf(1, 2), intArrayOf(1, 3),
-                        intArrayOf(1, 7), intArrayOf(2, 4), intArrayOf(2, 6), intArrayOf(3, 5)
+                        intArrayOf(1, 2),
+                        intArrayOf(1, 3),
+                        intArrayOf(1, 7),
+                        intArrayOf(2, 4),
+                        intArrayOf(2, 6),
+                        intArrayOf(3, 5),
                     ),
                     2,
-                    4
+                    4,
                 ),
-            equalTo(0.16666666666666666)
+            equalTo(0.16666666666666666),
         )
     }
 
@@ -29,13 +33,17 @@ internal class SolutionTest {
                 .frogPosition(
                     7,
                     arrayOf(
-                        intArrayOf(1, 2), intArrayOf(1, 3),
-                        intArrayOf(1, 7), intArrayOf(2, 4), intArrayOf(2, 6), intArrayOf(3, 5)
+                        intArrayOf(1, 2),
+                        intArrayOf(1, 3),
+                        intArrayOf(1, 7),
+                        intArrayOf(2, 4),
+                        intArrayOf(2, 6),
+                        intArrayOf(3, 5),
                     ),
                     1,
-                    7
+                    7,
                 ),
-            equalTo(0.3333333333333333)
+            equalTo(0.3333333333333333),
         )
     }
 }
diff --git a/src/test/kotlin/g1301_1400/s1378_replace_employee_id_with_the_unique_identifier/MysqlTest.kt b/src/test/kotlin/g1301_1400/s1378_replace_employee_id_with_the_unique_identifier/MysqlTest.kt
index 20666be8b..8c07dddf7 100644
--- a/src/test/kotlin/g1301_1400/s1378_replace_employee_id_with_the_unique_identifier/MysqlTest.kt
+++ b/src/test/kotlin/g1301_1400/s1378_replace_employee_id_with_the_unique_identifier/MysqlTest.kt
@@ -33,8 +33,8 @@ import javax.sql.DataSource
             "INSERT INTO EmployeeUNI(id, unique_id)" +
             " VALUES (11, 2); " +
             "INSERT INTO EmployeeUNI(id, unique_id)" +
-            " VALUES (90, 3); "
-    ]
+            " VALUES (90, 3); ",
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -46,12 +46,12 @@ internal class MysqlTest {
                     BufferedReader(
                         FileReader(
                             "src/main/kotlin/g1301_1400/s1378_replace_employee_id_with_the_unique_identifier" +
-                                "/script.sql"
-                        )
+                                "/script.sql",
+                        ),
                     )
                         .lines()
                         .collect(Collectors.joining("\n"))
-                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace("#.*?\\r?\\n".toRegex(), ""),
                 ).use { resultSet ->
                     assertThat(resultSet.next(), equalTo(true))
                     assertThat(resultSet.getNString(1), equalTo(null))
diff --git a/src/test/kotlin/g1301_1400/s1379_find_a_corresponding_node_of_a_binary_tree_in_a_clone_of_that_tree/SolutionTest.kt b/src/test/kotlin/g1301_1400/s1379_find_a_corresponding_node_of_a_binary_tree_in_a_clone_of_that_tree/SolutionTest.kt
index af85714a9..2f33f1154 100644
--- a/src/test/kotlin/g1301_1400/s1379_find_a_corresponding_node_of_a_binary_tree_in_a_clone_of_that_tree/SolutionTest.kt
+++ b/src/test/kotlin/g1301_1400/s1379_find_a_corresponding_node_of_a_binary_tree_in_a_clone_of_that_tree/SolutionTest.kt
@@ -13,7 +13,7 @@ internal class SolutionTest {
         val target = TreeNode.create(mutableListOf(3, 6, 19))
         assertThat(
             Solution().getTargetCopy(original, cloned, target!!).toString(),
-            equalTo("3,6,19")
+            equalTo("3,6,19"),
         )
     }
 
@@ -24,7 +24,7 @@ internal class SolutionTest {
         val target = TreeNode.create(mutableListOf(7))
         assertThat(
             Solution().getTargetCopy(original, cloned, target!!).toString(),
-            equalTo("7")
+            equalTo("7"),
         )
     }
 
@@ -35,7 +35,7 @@ internal class SolutionTest {
         val target = TreeNode.create(mutableListOf(4, null, 3, null, 2, null, 1))
         assertThat(
             Solution().getTargetCopy(original, cloned, target!!).toString(),
-            equalTo("4,null,3,null,2,null,1")
+            equalTo("4,null,3,null,2,null,1"),
         )
     }
 
@@ -46,7 +46,7 @@ internal class SolutionTest {
         val target = TreeNode.create(mutableListOf(5, 10))
         assertThat(
             Solution().getTargetCopy(original, cloned, target!!).toString(),
-            equalTo("5,10,null")
+            equalTo("5,10,null"),
         )
     }
 
@@ -57,7 +57,7 @@ internal class SolutionTest {
         val target = TreeNode.create(mutableListOf(2, 3))
         assertThat(
             Solution().getTargetCopy(original, cloned, target!!).toString(),
-            equalTo("2,3,null")
+            equalTo("2,3,null"),
         )
     }
 }
diff --git a/src/test/kotlin/g1301_1400/s1380_lucky_numbers_in_a_matrix/SolutionTest.kt b/src/test/kotlin/g1301_1400/s1380_lucky_numbers_in_a_matrix/SolutionTest.kt
index bd41c055f..408197675 100644
--- a/src/test/kotlin/g1301_1400/s1380_lucky_numbers_in_a_matrix/SolutionTest.kt
+++ b/src/test/kotlin/g1301_1400/s1380_lucky_numbers_in_a_matrix/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun luckyNumbers() {
         assertThat(
             Solution().luckyNumbers(arrayOf(intArrayOf(3, 7, 8), intArrayOf(9, 11, 13), intArrayOf(15, 16, 17))),
-            equalTo(listOf(15))
+            equalTo(listOf(15)),
         )
     }
 
@@ -18,7 +18,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .luckyNumbers(arrayOf(intArrayOf(1, 10, 4, 2), intArrayOf(9, 3, 8, 7), intArrayOf(15, 16, 17, 12))),
-            equalTo(listOf(12))
+            equalTo(listOf(12)),
         )
     }
 
@@ -26,7 +26,7 @@ internal class SolutionTest {
     fun luckyNumbers3() {
         assertThat(
             Solution().luckyNumbers(arrayOf(intArrayOf(7, 8), intArrayOf(1, 2))),
-            equalTo(listOf(7))
+            equalTo(listOf(7)),
         )
     }
 }
diff --git a/src/test/kotlin/g1301_1400/s1382_balance_a_binary_search_tree/SolutionTest.kt b/src/test/kotlin/g1301_1400/s1382_balance_a_binary_search_tree/SolutionTest.kt
index 00f2c6121..f0b85096e 100644
--- a/src/test/kotlin/g1301_1400/s1382_balance_a_binary_search_tree/SolutionTest.kt
+++ b/src/test/kotlin/g1301_1400/s1382_balance_a_binary_search_tree/SolutionTest.kt
@@ -11,10 +11,10 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .balanceBST(
-                    TreeNode.create(mutableListOf(1, null, 2, null, 3, null, 4, null, null))
+                    TreeNode.create(mutableListOf(1, null, 2, null, 3, null, 4, null, null)),
                 )
                 .toString(),
-            equalTo("2,1,3,null,4")
+            equalTo("2,1,3,null,4"),
         )
     }
 
@@ -22,7 +22,7 @@ internal class SolutionTest {
     fun balanceBST2() {
         assertThat(
             Solution().balanceBST(TreeNode.create(mutableListOf(2, 1, 3))).toString(),
-            equalTo("2,1,3")
+            equalTo("2,1,3"),
         )
     }
 }
diff --git a/src/test/kotlin/g1301_1400/s1383_maximum_performance_of_a_team/SolutionTest.kt b/src/test/kotlin/g1301_1400/s1383_maximum_performance_of_a_team/SolutionTest.kt
index e0c291cad..e715d1881 100644
--- a/src/test/kotlin/g1301_1400/s1383_maximum_performance_of_a_team/SolutionTest.kt
+++ b/src/test/kotlin/g1301_1400/s1383_maximum_performance_of_a_team/SolutionTest.kt
@@ -10,9 +10,12 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .maxPerformance(
-                    6, intArrayOf(2, 10, 3, 1, 5, 8), intArrayOf(5, 4, 3, 9, 7, 2), 2
+                    6,
+                    intArrayOf(2, 10, 3, 1, 5, 8),
+                    intArrayOf(5, 4, 3, 9, 7, 2),
+                    2,
                 ),
-            equalTo(60)
+            equalTo(60),
         )
     }
 
@@ -21,9 +24,12 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .maxPerformance(
-                    6, intArrayOf(2, 10, 3, 1, 5, 8), intArrayOf(5, 4, 3, 9, 7, 2), 3
+                    6,
+                    intArrayOf(2, 10, 3, 1, 5, 8),
+                    intArrayOf(5, 4, 3, 9, 7, 2),
+                    3,
                 ),
-            equalTo(68)
+            equalTo(68),
         )
     }
 
@@ -32,9 +38,12 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .maxPerformance(
-                    6, intArrayOf(2, 10, 3, 1, 5, 8), intArrayOf(5, 4, 3, 9, 7, 2), 4
+                    6,
+                    intArrayOf(2, 10, 3, 1, 5, 8),
+                    intArrayOf(5, 4, 3, 9, 7, 2),
+                    4,
                 ),
-            equalTo(72)
+            equalTo(72),
         )
     }
 }
diff --git a/src/test/kotlin/g1301_1400/s1385_find_the_distance_value_between_two_arrays/SolutionTest.kt b/src/test/kotlin/g1301_1400/s1385_find_the_distance_value_between_two_arrays/SolutionTest.kt
index 320c521ed..0858b2356 100644
--- a/src/test/kotlin/g1301_1400/s1385_find_the_distance_value_between_two_arrays/SolutionTest.kt
+++ b/src/test/kotlin/g1301_1400/s1385_find_the_distance_value_between_two_arrays/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .findTheDistanceValue(intArrayOf(4, 5, 8), intArrayOf(10, 9, 1, 8), 2),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -19,7 +19,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .findTheDistanceValue(intArrayOf(1, 4, 2, 3), intArrayOf(-4, -3, 6, 10, 20, 30), 3),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -28,7 +28,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .findTheDistanceValue(intArrayOf(2, 1, 100, 3), intArrayOf(-5, -2, 10, -3, 7), 6),
-            equalTo(1)
+            equalTo(1),
         )
     }
 }
diff --git a/src/test/kotlin/g1301_1400/s1386_cinema_seat_allocation/SolutionTest.kt b/src/test/kotlin/g1301_1400/s1386_cinema_seat_allocation/SolutionTest.kt
index 1b1cfe681..570445d01 100644
--- a/src/test/kotlin/g1301_1400/s1386_cinema_seat_allocation/SolutionTest.kt
+++ b/src/test/kotlin/g1301_1400/s1386_cinema_seat_allocation/SolutionTest.kt
@@ -12,11 +12,15 @@ internal class SolutionTest {
                 .maxNumberOfFamilies(
                     3,
                     arrayOf(
-                        intArrayOf(1, 2), intArrayOf(1, 3), intArrayOf(1, 8),
-                        intArrayOf(2, 6), intArrayOf(3, 1), intArrayOf(3, 10)
-                    )
+                        intArrayOf(1, 2),
+                        intArrayOf(1, 3),
+                        intArrayOf(1, 8),
+                        intArrayOf(2, 6),
+                        intArrayOf(3, 1),
+                        intArrayOf(3, 10),
+                    ),
                 ),
-            equalTo(4)
+            equalTo(4),
         )
     }
 
@@ -24,7 +28,7 @@ internal class SolutionTest {
     fun maxNumberOfFamilies2() {
         assertThat(
             Solution().maxNumberOfFamilies(2, arrayOf(intArrayOf(2, 1), intArrayOf(1, 8), intArrayOf(2, 6))),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -35,10 +39,12 @@ internal class SolutionTest {
                 4,
                 arrayOf(
                     intArrayOf(4, 3),
-                    intArrayOf(1, 4), intArrayOf(4, 6), intArrayOf(1, 7)
-                )
+                    intArrayOf(1, 4),
+                    intArrayOf(4, 6),
+                    intArrayOf(1, 7),
+                ),
             ),
-            equalTo(4)
+            equalTo(4),
         )
     }
 }
diff --git a/src/test/kotlin/g1301_1400/s1389_create_target_array_in_the_given_order/SolutionTest.kt b/src/test/kotlin/g1301_1400/s1389_create_target_array_in_the_given_order/SolutionTest.kt
index 39cfd6468..d94b55d07 100644
--- a/src/test/kotlin/g1301_1400/s1389_create_target_array_in_the_given_order/SolutionTest.kt
+++ b/src/test/kotlin/g1301_1400/s1389_create_target_array_in_the_given_order/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .createTargetArray(intArrayOf(0, 1, 2, 3, 4), intArrayOf(0, 1, 2, 2, 1)),
-            equalTo(intArrayOf(0, 4, 1, 3, 2))
+            equalTo(intArrayOf(0, 4, 1, 3, 2)),
         )
     }
 
@@ -19,7 +19,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .createTargetArray(intArrayOf(1, 2, 3, 4, 0), intArrayOf(0, 1, 2, 3, 0)),
-            equalTo(intArrayOf(0, 1, 2, 3, 4))
+            equalTo(intArrayOf(0, 1, 2, 3, 4)),
         )
     }
 }
diff --git a/src/test/kotlin/g1301_1400/s1391_check_if_there_is_a_valid_path_in_a_grid/SolutionTest.kt b/src/test/kotlin/g1301_1400/s1391_check_if_there_is_a_valid_path_in_a_grid/SolutionTest.kt
index 396a10500..a4ca629a1 100644
--- a/src/test/kotlin/g1301_1400/s1391_check_if_there_is_a_valid_path_in_a_grid/SolutionTest.kt
+++ b/src/test/kotlin/g1301_1400/s1391_check_if_there_is_a_valid_path_in_a_grid/SolutionTest.kt
@@ -11,10 +11,10 @@ internal class SolutionTest {
             Solution().hasValidPath(
                 arrayOf(
                     intArrayOf(2, 4, 3),
-                    intArrayOf(6, 5, 2)
-                )
+                    intArrayOf(6, 5, 2),
+                ),
             ),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
@@ -24,10 +24,10 @@ internal class SolutionTest {
             Solution().hasValidPath(
                 arrayOf(
                     intArrayOf(1, 2, 1),
-                    intArrayOf(1, 2, 1)
-                )
+                    intArrayOf(1, 2, 1),
+                ),
             ),
-            equalTo(false)
+            equalTo(false),
         )
     }
 
@@ -35,7 +35,7 @@ internal class SolutionTest {
     fun hasValidPath3() {
         assertThat(
             Solution().hasValidPath(arrayOf(intArrayOf(1, 1, 2))),
-            equalTo(false)
+            equalTo(false),
         )
     }
 }
diff --git a/src/test/kotlin/g1301_1400/s1393_capital_gainloss/MysqlTest.kt b/src/test/kotlin/g1301_1400/s1393_capital_gainloss/MysqlTest.kt
index 2f3114ba4..38a6eeca4 100644
--- a/src/test/kotlin/g1301_1400/s1393_capital_gainloss/MysqlTest.kt
+++ b/src/test/kotlin/g1301_1400/s1393_capital_gainloss/MysqlTest.kt
@@ -37,8 +37,8 @@ import javax.sql.DataSource
             "INSERT INTO Stocks(stock_name, operation, operation_day, price)" +
             " VALUES ('Handbags', 'Sell', 29, 7000); " +
             "INSERT INTO Stocks(stock_name, operation, operation_day, price)" +
-            " VALUES ('Corona Masks', 'Sell', 10, 10000); "
-    ]
+            " VALUES ('Corona Masks', 'Sell', 10, 10000); ",
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -51,12 +51,12 @@ internal class MysqlTest {
                         FileReader(
                             "src/main/kotlin/g1301_1400/s1393_" +
                                 "capital_gainloss" +
-                                "/script.sql"
-                        )
+                                "/script.sql",
+                        ),
                     )
                         .lines()
                         .collect(Collectors.joining("\n"))
-                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace("#.*?\\r?\\n".toRegex(), ""),
                 ).use { resultSet ->
                     assertThat(resultSet.next(), equalTo(true))
                     assertThat(resultSet.getNString(1), equalTo("Corona Masks"))
diff --git a/src/test/kotlin/g1301_1400/s1396_design_underground_system/UndergroundSystemTest.kt b/src/test/kotlin/g1301_1400/s1396_design_underground_system/UndergroundSystemTest.kt
index 2a234ce90..055c766d7 100644
--- a/src/test/kotlin/g1301_1400/s1396_design_underground_system/UndergroundSystemTest.kt
+++ b/src/test/kotlin/g1301_1400/s1396_design_underground_system/UndergroundSystemTest.kt
@@ -48,7 +48,8 @@ internal class UndergroundSystemTest {
         undergroundSystem.checkOut(2, "Paradise", 30)
         // return 6.66667, (5 + 6 + 9) / 3 = 6.66667
         assertThat(
-            undergroundSystem.getAverageTime("Leyton", "Paradise"), equalTo(6.666666666666667)
+            undergroundSystem.getAverageTime("Leyton", "Paradise"),
+            equalTo(6.666666666666667),
         )
     }
 }
diff --git a/src/test/kotlin/g1401_1500/s1403_minimum_subsequence_in_non_increasing_order/SolutionTest.kt b/src/test/kotlin/g1401_1500/s1403_minimum_subsequence_in_non_increasing_order/SolutionTest.kt
index 6e1ed5b4a..c5738791b 100644
--- a/src/test/kotlin/g1401_1500/s1403_minimum_subsequence_in_non_increasing_order/SolutionTest.kt
+++ b/src/test/kotlin/g1401_1500/s1403_minimum_subsequence_in_non_increasing_order/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun minSubsequence() {
         assertThat(
             Solution().minSubsequence(intArrayOf(4, 3, 10, 9, 8)),
-            equalTo(mutableListOf(10, 9))
+            equalTo(mutableListOf(10, 9)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun minSubsequence2() {
         assertThat(
             Solution().minSubsequence(intArrayOf(4, 4, 7, 6, 7)),
-            equalTo(mutableListOf(7, 7, 6))
+            equalTo(mutableListOf(7, 7, 6)),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun minSubsequence3() {
         assertThat(
             Solution().minSubsequence(intArrayOf(6)),
-            equalTo(listOf(6))
+            equalTo(listOf(6)),
         )
     }
 }
diff --git a/src/test/kotlin/g1401_1500/s1407_top_travellers/MysqlTest.kt b/src/test/kotlin/g1401_1500/s1407_top_travellers/MysqlTest.kt
index 58929f3b6..1f34b094b 100644
--- a/src/test/kotlin/g1401_1500/s1407_top_travellers/MysqlTest.kt
+++ b/src/test/kotlin/g1401_1500/s1407_top_travellers/MysqlTest.kt
@@ -42,8 +42,8 @@ import javax.sql.DataSource
             "INSERT INTO Rides(id, user_id, distance)" +
             " VALUES (8, 19, 400); " +
             "INSERT INTO Rides(id, user_id, distance)" +
-            " VALUES (9, 7, 230); "
-    ]
+            " VALUES (9, 7, 230); ",
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -55,12 +55,12 @@ internal class MysqlTest {
                     BufferedReader(
                         FileReader(
                             "src/main/kotlin/g1401_1500/s1407_top_trave" +
-                                "llers/script.sql"
-                        )
+                                "llers/script.sql",
+                        ),
                     )
                         .lines()
                         .collect(Collectors.joining("\n"))
-                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace("#.*?\\r?\\n".toRegex(), ""),
                 ).use { resultSet ->
                     assertThat(resultSet.next(), equalTo(true))
                     assertThat(resultSet.getNString(1), equalTo("Elvis"))
diff --git a/src/test/kotlin/g1401_1500/s1408_string_matching_in_an_array/SolutionTest.kt b/src/test/kotlin/g1401_1500/s1408_string_matching_in_an_array/SolutionTest.kt
index b9534d5be..1190ab624 100644
--- a/src/test/kotlin/g1401_1500/s1408_string_matching_in_an_array/SolutionTest.kt
+++ b/src/test/kotlin/g1401_1500/s1408_string_matching_in_an_array/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun stringMatching() {
         assertThat(
             Solution().stringMatching(arrayOf("mass", "as", "hero", "superhero")),
-            equalTo(mutableListOf("as", "hero"))
+            equalTo(mutableListOf("as", "hero")),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun stringMatching2() {
         assertThat(
             Solution().stringMatching(arrayOf("leetcode", "et", "code")),
-            equalTo(mutableListOf("code", "et"))
+            equalTo(mutableListOf("code", "et")),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun stringMatching3() {
         assertThat(
             Solution().stringMatching(arrayOf("blue", "green", "bu")),
-            equalTo(emptyList<Any>())
+            equalTo(emptyList<Any>()),
         )
     }
 }
diff --git a/src/test/kotlin/g1401_1500/s1409_queries_on_a_permutation_with_key/SolutionTest.kt b/src/test/kotlin/g1401_1500/s1409_queries_on_a_permutation_with_key/SolutionTest.kt
index 8da9267ab..7f276c4d1 100644
--- a/src/test/kotlin/g1401_1500/s1409_queries_on_a_permutation_with_key/SolutionTest.kt
+++ b/src/test/kotlin/g1401_1500/s1409_queries_on_a_permutation_with_key/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun processQueries() {
         assertThat(
             Solution().processQueries(intArrayOf(3, 1, 2, 1), 5),
-            equalTo(intArrayOf(2, 1, 2, 1))
+            equalTo(intArrayOf(2, 1, 2, 1)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun processQueries2() {
         assertThat(
             Solution().processQueries(intArrayOf(4, 1, 2, 2), 4),
-            equalTo(intArrayOf(3, 1, 2, 0))
+            equalTo(intArrayOf(3, 1, 2, 0)),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun processQueries3() {
         assertThat(
             Solution().processQueries(intArrayOf(7, 5, 5, 8, 3), 8),
-            equalTo(intArrayOf(6, 5, 0, 7, 5))
+            equalTo(intArrayOf(6, 5, 0, 7, 5)),
         )
     }
 }
diff --git a/src/test/kotlin/g1401_1500/s1410_html_entity_parser/SolutionTest.kt b/src/test/kotlin/g1401_1500/s1410_html_entity_parser/SolutionTest.kt
index 7e6208dfe..6409c11c8 100644
--- a/src/test/kotlin/g1401_1500/s1410_html_entity_parser/SolutionTest.kt
+++ b/src/test/kotlin/g1401_1500/s1410_html_entity_parser/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun entityParser() {
         assertThat(
             Solution().entityParser("&amp; is an HTML entity but &ambassador; is not."),
-            equalTo("& is an HTML entity but &ambassador; is not.")
+            equalTo("& is an HTML entity but &ambassador; is not."),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun entityParser2() {
         assertThat(
             Solution().entityParser("and I quote: &quot;...&quot;"),
-            equalTo("and I quote: \"...\"")
+            equalTo("and I quote: \"...\""),
         )
     }
 
diff --git a/src/test/kotlin/g1401_1500/s1418_display_table_of_food_orders_in_a_restaurant/SolutionTest.kt b/src/test/kotlin/g1401_1500/s1418_display_table_of_food_orders_in_a_restaurant/SolutionTest.kt
index 7d7732c3e..73a5f61f6 100644
--- a/src/test/kotlin/g1401_1500/s1418_display_table_of_food_orders_in_a_restaurant/SolutionTest.kt
+++ b/src/test/kotlin/g1401_1500/s1418_display_table_of_food_orders_in_a_restaurant/SolutionTest.kt
@@ -9,14 +9,17 @@ internal class SolutionTest {
     fun displayTable() {
         val orders = listOf(
             mutableListOf("David", "3", "Ceviche"),
-            mutableListOf("Corina", "10", "Beef Burrito"), mutableListOf("David", "3", "Fried Chicken"),
-            mutableListOf("Carla", "5", "Water"), mutableListOf("Carla", "5", "Ceviche"),
-            mutableListOf("Rous", "3", "Ceviche")
+            mutableListOf("Corina", "10", "Beef Burrito"),
+            mutableListOf("David", "3", "Fried Chicken"),
+            mutableListOf("Carla", "5", "Water"),
+            mutableListOf("Carla", "5", "Ceviche"),
+            mutableListOf("Rous", "3", "Ceviche"),
         )
         val output = listOf(
             mutableListOf("Table", "Beef Burrito", "Ceviche", "Fried Chicken", "Water"),
-            mutableListOf("3", "0", "2", "1", "0"), mutableListOf("5", "0", "1", "0", "1"),
-            mutableListOf("10", "1", "0", "0", "0")
+            mutableListOf("3", "0", "2", "1", "0"),
+            mutableListOf("5", "0", "1", "0", "1"),
+            mutableListOf("10", "1", "0", "0", "0"),
         )
         assertThat(Solution().displayTable(orders), equalTo(output))
     }
@@ -25,12 +28,15 @@ internal class SolutionTest {
     fun displayTable2() {
         val orders = listOf(
             mutableListOf("James", "12", "Fried Chicken"),
-            mutableListOf("Ratesh", "12", "Fried Chicken"), mutableListOf("Amadeus", "12", "Fried Chicken"),
-            mutableListOf("Adam", "1", "Canadian Waffles"), mutableListOf("Brianna", "1", "Canadian Waffles")
+            mutableListOf("Ratesh", "12", "Fried Chicken"),
+            mutableListOf("Amadeus", "12", "Fried Chicken"),
+            mutableListOf("Adam", "1", "Canadian Waffles"),
+            mutableListOf("Brianna", "1", "Canadian Waffles"),
         )
         val output = listOf(
             mutableListOf("Table", "Canadian Waffles", "Fried Chicken"),
-            mutableListOf("1", "2", "0"), mutableListOf("12", "0", "3")
+            mutableListOf("1", "2", "0"),
+            mutableListOf("12", "0", "3"),
         )
         assertThat(Solution().displayTable(orders), equalTo(output))
     }
@@ -39,11 +45,12 @@ internal class SolutionTest {
     fun displayTable3() {
         val orders = listOf(
             mutableListOf("Laura", "2", "Bean Burrito"),
-            mutableListOf("Jhon", "2", "Beef Burrito"), mutableListOf("Melissa", "2", "Soda")
+            mutableListOf("Jhon", "2", "Beef Burrito"),
+            mutableListOf("Melissa", "2", "Soda"),
         )
         val output = listOf(
             mutableListOf("Table", "Bean Burrito", "Beef Burrito", "Soda"),
-            mutableListOf("2", "1", "1", "1")
+            mutableListOf("2", "1", "1", "1"),
         )
         assertThat(Solution().displayTable(orders), equalTo(output))
     }
diff --git a/src/test/kotlin/g1401_1500/s1424_diagonal_traverse_ii/SolutionTest.kt b/src/test/kotlin/g1401_1500/s1424_diagonal_traverse_ii/SolutionTest.kt
index 61c271bad..a57e73f5b 100644
--- a/src/test/kotlin/g1401_1500/s1424_diagonal_traverse_ii/SolutionTest.kt
+++ b/src/test/kotlin/g1401_1500/s1424_diagonal_traverse_ii/SolutionTest.kt
@@ -10,19 +10,22 @@ internal class SolutionTest {
         val input = listOf(mutableListOf(1, 2, 3), mutableListOf(4, 5, 6), mutableListOf(7, 8, 9))
         assertThat(
             Solution().findDiagonalOrder(input),
-            equalTo(intArrayOf(1, 4, 2, 7, 5, 3, 8, 6, 9))
+            equalTo(intArrayOf(1, 4, 2, 7, 5, 3, 8, 6, 9)),
         )
     }
 
     @Test
     fun findDiagonalOrder2() {
         val input = listOf(
-            mutableListOf(1, 2, 3, 4, 5), mutableListOf(6, 7), mutableListOf(8),
-            mutableListOf(9, 10, 11), mutableListOf(12, 13, 14, 15, 16)
+            mutableListOf(1, 2, 3, 4, 5),
+            mutableListOf(6, 7),
+            mutableListOf(8),
+            mutableListOf(9, 10, 11),
+            mutableListOf(12, 13, 14, 15, 16),
         )
         assertThat(
             Solution().findDiagonalOrder(input),
-            equalTo(intArrayOf(1, 6, 2, 8, 7, 3, 9, 4, 12, 10, 5, 13, 11, 14, 15, 16))
+            equalTo(intArrayOf(1, 6, 2, 8, 7, 3, 9, 4, 12, 10, 5, 13, 11, 14, 15, 16)),
         )
     }
 }
diff --git a/src/test/kotlin/g1401_1500/s1425_constrained_subsequence_sum/SolutionTest.kt b/src/test/kotlin/g1401_1500/s1425_constrained_subsequence_sum/SolutionTest.kt
index a8ec8cbaf..6703090b4 100644
--- a/src/test/kotlin/g1401_1500/s1425_constrained_subsequence_sum/SolutionTest.kt
+++ b/src/test/kotlin/g1401_1500/s1425_constrained_subsequence_sum/SolutionTest.kt
@@ -8,7 +8,8 @@ internal class SolutionTest {
     @Test
     fun constrainedSubsetSum() {
         assertThat(
-            Solution().constrainedSubsetSum(intArrayOf(10, 2, -10, 5, 20), 2), equalTo(37)
+            Solution().constrainedSubsetSum(intArrayOf(10, 2, -10, 5, 20), 2),
+            equalTo(37),
         )
     }
 
@@ -21,7 +22,7 @@ internal class SolutionTest {
     fun constrainedSubsetSum3() {
         assertThat(
             Solution().constrainedSubsetSum(intArrayOf(10, -2, -10, -5, 20), 2),
-            equalTo(23)
+            equalTo(23),
         )
     }
 }
diff --git a/src/test/kotlin/g1401_1500/s1431_kids_with_the_greatest_number_of_candies/SolutionTest.kt b/src/test/kotlin/g1401_1500/s1431_kids_with_the_greatest_number_of_candies/SolutionTest.kt
index 8b7e9d1b7..f7346fafa 100644
--- a/src/test/kotlin/g1401_1500/s1431_kids_with_the_greatest_number_of_candies/SolutionTest.kt
+++ b/src/test/kotlin/g1401_1500/s1431_kids_with_the_greatest_number_of_candies/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun kidsWithCandies() {
         assertThat(
             Solution().kidsWithCandies(intArrayOf(2, 3, 5, 1, 3), 3),
-            equalTo(mutableListOf(true, true, true, false, true))
+            equalTo(mutableListOf(true, true, true, false, true)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun kidsWithCandies2() {
         assertThat(
             Solution().kidsWithCandies(intArrayOf(4, 2, 1, 1, 2), 1),
-            equalTo(mutableListOf(true, false, false, false, false))
+            equalTo(mutableListOf(true, false, false, false, false)),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun kidsWithCandies3() {
         assertThat(
             Solution().kidsWithCandies(intArrayOf(12, 1, 12), 10),
-            equalTo(mutableListOf(true, false, true))
+            equalTo(mutableListOf(true, false, true)),
         )
     }
 }
diff --git a/src/test/kotlin/g1401_1500/s1434_number_of_ways_to_wear_different_hats_to_each_other/SolutionTest.kt b/src/test/kotlin/g1401_1500/s1434_number_of_ways_to_wear_different_hats_to_each_other/SolutionTest.kt
index fa4438c4e..40e8a9e4e 100644
--- a/src/test/kotlin/g1401_1500/s1434_number_of_ways_to_wear_different_hats_to_each_other/SolutionTest.kt
+++ b/src/test/kotlin/g1401_1500/s1434_number_of_ways_to_wear_different_hats_to_each_other/SolutionTest.kt
@@ -20,8 +20,10 @@ internal class SolutionTest {
     @Test
     fun numberWays3() {
         val input = listOf(
-            mutableListOf(1, 2, 3, 4), mutableListOf(1, 2, 3, 4),
-            mutableListOf(1, 2, 3, 4), mutableListOf(1, 2, 3, 4)
+            mutableListOf(1, 2, 3, 4),
+            mutableListOf(1, 2, 3, 4),
+            mutableListOf(1, 2, 3, 4),
+            mutableListOf(1, 2, 3, 4),
         )
         assertThat(Solution().numberWays(input), equalTo(24))
     }
diff --git a/src/test/kotlin/g1401_1500/s1436_destination_city/SolutionTest.kt b/src/test/kotlin/g1401_1500/s1436_destination_city/SolutionTest.kt
index 0a3f72f95..a84974d2f 100644
--- a/src/test/kotlin/g1401_1500/s1436_destination_city/SolutionTest.kt
+++ b/src/test/kotlin/g1401_1500/s1436_destination_city/SolutionTest.kt
@@ -9,7 +9,8 @@ internal class SolutionTest {
     fun destCity() {
         val input = listOf(
             mutableListOf("London", "New York"),
-            mutableListOf("New York", "Lima"), mutableListOf("Lima", "Sao Paulo")
+            mutableListOf("New York", "Lima"),
+            mutableListOf("Lima", "Sao Paulo"),
         )
         assertThat(Solution().destCity(input), equalTo("Sao Paulo"))
     }
diff --git a/src/test/kotlin/g1401_1500/s1437_check_if_all_1s_are_at_least_length_k_places_away/SolutionTest.kt b/src/test/kotlin/g1401_1500/s1437_check_if_all_1s_are_at_least_length_k_places_away/SolutionTest.kt
index c61b172ca..e4525e094 100644
--- a/src/test/kotlin/g1401_1500/s1437_check_if_all_1s_are_at_least_length_k_places_away/SolutionTest.kt
+++ b/src/test/kotlin/g1401_1500/s1437_check_if_all_1s_are_at_least_length_k_places_away/SolutionTest.kt
@@ -8,7 +8,8 @@ internal class SolutionTest {
     @Test
     fun kLengthApart() {
         assertThat(
-            Solution().kLengthApart(intArrayOf(1, 0, 0, 0, 1, 0, 0, 1), 2), equalTo(true)
+            Solution().kLengthApart(intArrayOf(1, 0, 0, 0, 1, 0, 0, 1), 2),
+            equalTo(true),
         )
     }
 
diff --git a/src/test/kotlin/g1401_1500/s1438_longest_continuous_subarray_with_absolute_diff_less_than_or_equal_to_limit/SolutionTest.kt b/src/test/kotlin/g1401_1500/s1438_longest_continuous_subarray_with_absolute_diff_less_than_or_equal_to_limit/SolutionTest.kt
index 9754fb29f..c499ba598 100644
--- a/src/test/kotlin/g1401_1500/s1438_longest_continuous_subarray_with_absolute_diff_less_than_or_equal_to_limit/SolutionTest.kt
+++ b/src/test/kotlin/g1401_1500/s1438_longest_continuous_subarray_with_absolute_diff_less_than_or_equal_to_limit/SolutionTest.kt
@@ -18,7 +18,8 @@ internal class SolutionTest {
     @Test
     fun longestSubarray3() {
         assertThat(
-            Solution().longestSubarray(intArrayOf(4, 2, 2, 2, 4, 4, 2, 2), 0), equalTo(3)
+            Solution().longestSubarray(intArrayOf(4, 2, 2, 2, 4, 4, 2, 2), 0),
+            equalTo(3),
         )
     }
 }
diff --git a/src/test/kotlin/g1401_1500/s1439_find_the_kth_smallest_sum_of_a_matrix_with_sorted_rows/SolutionTest.kt b/src/test/kotlin/g1401_1500/s1439_find_the_kth_smallest_sum_of_a_matrix_with_sorted_rows/SolutionTest.kt
index d13ad2158..81718c359 100644
--- a/src/test/kotlin/g1401_1500/s1439_find_the_kth_smallest_sum_of_a_matrix_with_sorted_rows/SolutionTest.kt
+++ b/src/test/kotlin/g1401_1500/s1439_find_the_kth_smallest_sum_of_a_matrix_with_sorted_rows/SolutionTest.kt
@@ -19,7 +19,7 @@ internal class SolutionTest {
     fun kthSmallest3() {
         assertThat(
             Solution().kthSmallest(arrayOf(intArrayOf(1, 10, 10), intArrayOf(1, 4, 5), intArrayOf(2, 3, 6)), 7),
-            equalTo(9)
+            equalTo(9),
         )
     }
 }
diff --git a/src/test/kotlin/g1401_1500/s1441_build_an_array_with_stack_operations/SolutionTest.kt b/src/test/kotlin/g1401_1500/s1441_build_an_array_with_stack_operations/SolutionTest.kt
index c2ee1eda9..fc508e582 100644
--- a/src/test/kotlin/g1401_1500/s1441_build_an_array_with_stack_operations/SolutionTest.kt
+++ b/src/test/kotlin/g1401_1500/s1441_build_an_array_with_stack_operations/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun buildArray() {
         assertThat(
             Solution().buildArray(intArrayOf(1, 3), 3),
-            equalTo(mutableListOf("Push", "Push", "Pop", "Push"))
+            equalTo(mutableListOf("Push", "Push", "Pop", "Push")),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun buildArray2() {
         assertThat(
             Solution().buildArray(intArrayOf(1, 2, 3), 3),
-            equalTo(mutableListOf("Push", "Push", "Push"))
+            equalTo(mutableListOf("Push", "Push", "Push")),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun buildArray3() {
         assertThat(
             Solution().buildArray(intArrayOf(1, 2), 4),
-            equalTo(mutableListOf("Push", "Push"))
+            equalTo(mutableListOf("Push", "Push")),
         )
     }
 }
diff --git a/src/test/kotlin/g1401_1500/s1443_minimum_time_to_collect_all_apples_in_a_tree/SolutionTest.kt b/src/test/kotlin/g1401_1500/s1443_minimum_time_to_collect_all_apples_in_a_tree/SolutionTest.kt
index b774dc859..74fbb9afd 100644
--- a/src/test/kotlin/g1401_1500/s1443_minimum_time_to_collect_all_apples_in_a_tree/SolutionTest.kt
+++ b/src/test/kotlin/g1401_1500/s1443_minimum_time_to_collect_all_apples_in_a_tree/SolutionTest.kt
@@ -12,13 +12,16 @@ internal class SolutionTest {
                 .minTime(
                     7,
                     arrayOf(
-                        intArrayOf(0, 1), intArrayOf(0, 2),
-                        intArrayOf(1, 4), intArrayOf(1, 5), intArrayOf(2, 3),
-                        intArrayOf(2, 6)
+                        intArrayOf(0, 1),
+                        intArrayOf(0, 2),
+                        intArrayOf(1, 4),
+                        intArrayOf(1, 5),
+                        intArrayOf(2, 3),
+                        intArrayOf(2, 6),
                     ),
-                    mutableListOf(false, false, true, false, true, true, false)
+                    mutableListOf(false, false, true, false, true, true, false),
                 ),
-            equalTo(8)
+            equalTo(8),
         )
     }
 
@@ -29,12 +32,16 @@ internal class SolutionTest {
                 .minTime(
                     7,
                     arrayOf(
-                        intArrayOf(0, 1), intArrayOf(0, 2), intArrayOf(1, 4),
-                        intArrayOf(1, 5), intArrayOf(2, 3), intArrayOf(2, 6)
+                        intArrayOf(0, 1),
+                        intArrayOf(0, 2),
+                        intArrayOf(1, 4),
+                        intArrayOf(1, 5),
+                        intArrayOf(2, 3),
+                        intArrayOf(2, 6),
                     ),
-                    mutableListOf(false, false, true, false, false, true, false)
+                    mutableListOf(false, false, true, false, false, true, false),
                 ),
-            equalTo(6)
+            equalTo(6),
         )
     }
 
@@ -45,12 +52,16 @@ internal class SolutionTest {
                 .minTime(
                     7,
                     arrayOf(
-                        intArrayOf(0, 1), intArrayOf(0, 2), intArrayOf(1, 4),
-                        intArrayOf(1, 5), intArrayOf(2, 3), intArrayOf(2, 6)
+                        intArrayOf(0, 1),
+                        intArrayOf(0, 2),
+                        intArrayOf(1, 4),
+                        intArrayOf(1, 5),
+                        intArrayOf(2, 3),
+                        intArrayOf(2, 6),
                     ),
-                    mutableListOf(false, false, false, false, false, false, false)
+                    mutableListOf(false, false, false, false, false, false, false),
                 ),
-            equalTo(0)
+            equalTo(0),
         )
     }
 }
diff --git a/src/test/kotlin/g1401_1500/s1447_simplified_fractions/SolutionTest.kt b/src/test/kotlin/g1401_1500/s1447_simplified_fractions/SolutionTest.kt
index 780dd03b7..4bc735684 100644
--- a/src/test/kotlin/g1401_1500/s1447_simplified_fractions/SolutionTest.kt
+++ b/src/test/kotlin/g1401_1500/s1447_simplified_fractions/SolutionTest.kt
@@ -8,7 +8,8 @@ internal class SolutionTest {
     @Test
     fun simplifiedFractions() {
         assertThat(
-            Solution().simplifiedFractions(2), equalTo(listOf("1/2"))
+            Solution().simplifiedFractions(2),
+            equalTo(listOf("1/2")),
         )
     }
 
@@ -16,7 +17,7 @@ internal class SolutionTest {
     fun simplifiedFractions2() {
         assertThat(
             Solution().simplifiedFractions(4),
-            equalTo(mutableListOf("1/2", "1/3", "2/3", "1/4", "3/4"))
+            equalTo(mutableListOf("1/2", "1/3", "2/3", "1/4", "3/4")),
         )
     }
 }
diff --git a/src/test/kotlin/g1401_1500/s1449_form_largest_integer_with_digits_that_add_up_to_target/SolutionTest.kt b/src/test/kotlin/g1401_1500/s1449_form_largest_integer_with_digits_that_add_up_to_target/SolutionTest.kt
index ed70e30c5..b88652e92 100644
--- a/src/test/kotlin/g1401_1500/s1449_form_largest_integer_with_digits_that_add_up_to_target/SolutionTest.kt
+++ b/src/test/kotlin/g1401_1500/s1449_form_largest_integer_with_digits_that_add_up_to_target/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun largestNumber() {
         assertThat(
             Solution().largestNumber(intArrayOf(4, 3, 2, 5, 6, 7, 2, 5, 5), 9),
-            equalTo("7772")
+            equalTo("7772"),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun largestNumber2() {
         assertThat(
             Solution().largestNumber(intArrayOf(7, 6, 5, 5, 5, 6, 8, 7, 8), 12),
-            equalTo("85")
+            equalTo("85"),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun largestNumber3() {
         assertThat(
             Solution().largestNumber(intArrayOf(2, 4, 6, 2, 4, 6, 4, 4, 4), 5),
-            equalTo("0")
+            equalTo("0"),
         )
     }
 }
diff --git a/src/test/kotlin/g1401_1500/s1450_number_of_students_doing_homework_at_a_given_time/SolutionTest.kt b/src/test/kotlin/g1401_1500/s1450_number_of_students_doing_homework_at_a_given_time/SolutionTest.kt
index f5265e65b..06fbfdbf6 100644
--- a/src/test/kotlin/g1401_1500/s1450_number_of_students_doing_homework_at_a_given_time/SolutionTest.kt
+++ b/src/test/kotlin/g1401_1500/s1450_number_of_students_doing_homework_at_a_given_time/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun busyStudent() {
         assertThat(
             Solution().busyStudent(intArrayOf(1, 2, 3), intArrayOf(3, 2, 7), 4),
-            equalTo(1)
+            equalTo(1),
         )
     }
 
diff --git a/src/test/kotlin/g1401_1500/s1451_rearrange_words_in_a_sentence/SolutionTest.kt b/src/test/kotlin/g1401_1500/s1451_rearrange_words_in_a_sentence/SolutionTest.kt
index 399f425f9..8bb9da43e 100644
--- a/src/test/kotlin/g1401_1500/s1451_rearrange_words_in_a_sentence/SolutionTest.kt
+++ b/src/test/kotlin/g1401_1500/s1451_rearrange_words_in_a_sentence/SolutionTest.kt
@@ -14,14 +14,15 @@ internal class SolutionTest {
     fun arrangeWords2() {
         assertThat(
             Solution().arrangeWords("Keep calm and code on"),
-            equalTo("On and keep calm code")
+            equalTo("On and keep calm code"),
         )
     }
 
     @Test
     fun arrangeWords3() {
         assertThat(
-            Solution().arrangeWords("To be or not to be"), equalTo("To be or to be not")
+            Solution().arrangeWords("To be or not to be"),
+            equalTo("To be or to be not"),
         )
     }
 }
diff --git a/src/test/kotlin/g1401_1500/s1452_people_whose_list_of_favorite_companies_is_not_a_subset_of_another_list/SolutionTest.kt b/src/test/kotlin/g1401_1500/s1452_people_whose_list_of_favorite_companies_is_not_a_subset_of_another_list/SolutionTest.kt
index 9efd6b6d6..b4c1c0fd2 100644
--- a/src/test/kotlin/g1401_1500/s1452_people_whose_list_of_favorite_companies_is_not_a_subset_of_another_list/SolutionTest.kt
+++ b/src/test/kotlin/g1401_1500/s1452_people_whose_list_of_favorite_companies_is_not_a_subset_of_another_list/SolutionTest.kt
@@ -12,7 +12,7 @@ internal class SolutionTest {
             mutableListOf("google", "microsoft"),
             mutableListOf("google", "facebook"),
             listOf("google"),
-            listOf("amazon")
+            listOf("amazon"),
         )
         assertThat(Solution().peopleIndexes(input), equalTo(mutableListOf(0, 1, 4)))
     }
@@ -22,7 +22,7 @@ internal class SolutionTest {
         val input = listOf(
             mutableListOf("leetcode", "google", "facebook"),
             mutableListOf("leetcode", "amazon"),
-            mutableListOf("facebook", "google")
+            mutableListOf("facebook", "google"),
         )
         assertThat(Solution().peopleIndexes(input), equalTo(mutableListOf(0, 1)))
     }
diff --git a/src/test/kotlin/g1401_1500/s1453_maximum_number_of_darts_inside_of_a_circular_dartboard/SolutionTest.kt b/src/test/kotlin/g1401_1500/s1453_maximum_number_of_darts_inside_of_a_circular_dartboard/SolutionTest.kt
index 8dc65603e..a3c077bb2 100644
--- a/src/test/kotlin/g1401_1500/s1453_maximum_number_of_darts_inside_of_a_circular_dartboard/SolutionTest.kt
+++ b/src/test/kotlin/g1401_1500/s1453_maximum_number_of_darts_inside_of_a_circular_dartboard/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun numPoints() {
         assertThat(
             Solution().numPoints(arrayOf(intArrayOf(-2, 0), intArrayOf(2, 0), intArrayOf(0, 2), intArrayOf(0, -2)), 2),
-            equalTo(4)
+            equalTo(4),
         )
     }
 
@@ -24,11 +24,11 @@ internal class SolutionTest {
                         intArrayOf(2, 6),
                         intArrayOf(5, 4),
                         intArrayOf(0, 9),
-                        intArrayOf(7, 8)
+                        intArrayOf(7, 8),
                     ),
-                    5
+                    5,
                 ),
-            equalTo(5)
+            equalTo(5),
         )
     }
 }
diff --git a/src/test/kotlin/g1401_1500/s1455_check_if_a_word_occurs_as_a_prefix_of_any_word_in_a_sentence/SolutionTest.kt b/src/test/kotlin/g1401_1500/s1455_check_if_a_word_occurs_as_a_prefix_of_any_word_in_a_sentence/SolutionTest.kt
index 403d7413f..96a96b2bd 100644
--- a/src/test/kotlin/g1401_1500/s1455_check_if_a_word_occurs_as_a_prefix_of_any_word_in_a_sentence/SolutionTest.kt
+++ b/src/test/kotlin/g1401_1500/s1455_check_if_a_word_occurs_as_a_prefix_of_any_word_in_a_sentence/SolutionTest.kt
@@ -14,7 +14,7 @@ internal class SolutionTest {
     fun isPrefixOfWord2() {
         assertThat(
             Solution().isPrefixOfWord("this problem is an easy problem", "pro"),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
diff --git a/src/test/kotlin/g1401_1500/s1458_max_dot_product_of_two_subsequences/SolutionTest.kt b/src/test/kotlin/g1401_1500/s1458_max_dot_product_of_two_subsequences/SolutionTest.kt
index 7a03b6737..b8640c824 100644
--- a/src/test/kotlin/g1401_1500/s1458_max_dot_product_of_two_subsequences/SolutionTest.kt
+++ b/src/test/kotlin/g1401_1500/s1458_max_dot_product_of_two_subsequences/SolutionTest.kt
@@ -9,14 +9,15 @@ internal class SolutionTest {
     fun maxDotProduct() {
         assertThat(
             Solution().maxDotProduct(intArrayOf(2, 1, -2, 5), intArrayOf(3, 0, -6)),
-            equalTo(18)
+            equalTo(18),
         )
     }
 
     @Test
     fun maxDotProduct2() {
         assertThat(
-            Solution().maxDotProduct(intArrayOf(3, -2), intArrayOf(2, -6, 7)), equalTo(21)
+            Solution().maxDotProduct(intArrayOf(3, -2), intArrayOf(2, -6, 7)),
+            equalTo(21),
         )
     }
 
@@ -24,7 +25,7 @@ internal class SolutionTest {
     fun maxDotProduct3() {
         assertThat(
             Solution().maxDotProduct(intArrayOf(-1, -1), intArrayOf(1, 1)),
-            equalTo(-1)
+            equalTo(-1),
         )
     }
 }
diff --git a/src/test/kotlin/g1401_1500/s1460_make_two_arrays_equal_by_reversing_subarrays/SolutionTest.kt b/src/test/kotlin/g1401_1500/s1460_make_two_arrays_equal_by_reversing_subarrays/SolutionTest.kt
index 7b0b200cf..265710ac4 100644
--- a/src/test/kotlin/g1401_1500/s1460_make_two_arrays_equal_by_reversing_subarrays/SolutionTest.kt
+++ b/src/test/kotlin/g1401_1500/s1460_make_two_arrays_equal_by_reversing_subarrays/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun canBeEqual() {
         assertThat(
             Solution().canBeEqual(intArrayOf(1, 2, 3, 4), intArrayOf(2, 4, 1, 3)),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
@@ -22,7 +22,7 @@ internal class SolutionTest {
     fun canBeEqual3() {
         assertThat(
             Solution().canBeEqual(intArrayOf(3, 7, 9), intArrayOf(3, 7, 11)),
-            equalTo(false)
+            equalTo(false),
         )
     }
 }
diff --git a/src/test/kotlin/g1401_1500/s1462_course_schedule_iv/SolutionTest.kt b/src/test/kotlin/g1401_1500/s1462_course_schedule_iv/SolutionTest.kt
index 3a1b06a16..5b4c2bf68 100644
--- a/src/test/kotlin/g1401_1500/s1462_course_schedule_iv/SolutionTest.kt
+++ b/src/test/kotlin/g1401_1500/s1462_course_schedule_iv/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .checkIfPrerequisite(2, arrayOf(intArrayOf(1, 0)), arrayOf(intArrayOf(0, 1), intArrayOf(1, 0))),
-            equalTo(mutableListOf(false, true))
+            equalTo(mutableListOf(false, true)),
         )
     }
 
@@ -18,7 +18,7 @@ internal class SolutionTest {
     fun checkIfPrerequisite2() {
         assertThat(
             Solution().checkIfPrerequisite(2, arrayOf(), arrayOf(intArrayOf(1, 0), intArrayOf(0, 1))),
-            equalTo(mutableListOf(false, false))
+            equalTo(mutableListOf(false, false)),
         )
     }
 
@@ -29,9 +29,9 @@ internal class SolutionTest {
                 .checkIfPrerequisite(
                     3,
                     arrayOf(intArrayOf(1, 2), intArrayOf(1, 0), intArrayOf(2, 0)),
-                    arrayOf(intArrayOf(1, 0), intArrayOf(1, 2))
+                    arrayOf(intArrayOf(1, 0), intArrayOf(1, 2)),
                 ),
-            equalTo(mutableListOf(true, true))
+            equalTo(mutableListOf(true, true)),
         )
     }
 }
diff --git a/src/test/kotlin/g1401_1500/s1463_cherry_pickup_ii/SolutionTest.kt b/src/test/kotlin/g1401_1500/s1463_cherry_pickup_ii/SolutionTest.kt
index 56ad143c7..d0fae08f7 100644
--- a/src/test/kotlin/g1401_1500/s1463_cherry_pickup_ii/SolutionTest.kt
+++ b/src/test/kotlin/g1401_1500/s1463_cherry_pickup_ii/SolutionTest.kt
@@ -14,10 +14,10 @@ internal class SolutionTest {
                         intArrayOf(3, 1, 1),
                         intArrayOf(2, 5, 1),
                         intArrayOf(1, 5, 5),
-                        intArrayOf(2, 1, 1)
-                    )
+                        intArrayOf(2, 1, 1),
+                    ),
                 ),
-            equalTo(24)
+            equalTo(24),
         )
     }
 
@@ -31,10 +31,10 @@ internal class SolutionTest {
                         intArrayOf(2, 0, 0, 0, 0, 3, 0),
                         intArrayOf(2, 0, 9, 0, 0, 0, 0),
                         intArrayOf(0, 3, 0, 5, 4, 0, 0),
-                        intArrayOf(1, 0, 2, 3, 0, 0, 6)
-                    )
+                        intArrayOf(1, 0, 2, 3, 0, 0, 6),
+                    ),
                 ),
-            equalTo(28)
+            equalTo(28),
         )
     }
 }
diff --git a/src/test/kotlin/g1401_1500/s1465_maximum_area_of_a_piece_of_cake_after_horizontal_and_vertical_cuts/SolutionTest.kt b/src/test/kotlin/g1401_1500/s1465_maximum_area_of_a_piece_of_cake_after_horizontal_and_vertical_cuts/SolutionTest.kt
index 1273b2ab5..1d333fccf 100644
--- a/src/test/kotlin/g1401_1500/s1465_maximum_area_of_a_piece_of_cake_after_horizontal_and_vertical_cuts/SolutionTest.kt
+++ b/src/test/kotlin/g1401_1500/s1465_maximum_area_of_a_piece_of_cake_after_horizontal_and_vertical_cuts/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun maxArea() {
         assertThat(
             Solution().maxArea(5, 4, intArrayOf(1, 2, 4), intArrayOf(1, 3)),
-            equalTo(4)
+            equalTo(4),
         )
     }
 
diff --git a/src/test/kotlin/g1401_1500/s1466_reorder_routes_to_make_all_paths_lead_to_the_city_zero/SolutionTest.kt b/src/test/kotlin/g1401_1500/s1466_reorder_routes_to_make_all_paths_lead_to_the_city_zero/SolutionTest.kt
index 960559270..6eb4d5ccc 100644
--- a/src/test/kotlin/g1401_1500/s1466_reorder_routes_to_make_all_paths_lead_to_the_city_zero/SolutionTest.kt
+++ b/src/test/kotlin/g1401_1500/s1466_reorder_routes_to_make_all_paths_lead_to_the_city_zero/SolutionTest.kt
@@ -10,9 +10,9 @@ internal class SolutionTest {
         assertThat(
             Solution().minReorder(
                 6,
-                arrayOf(intArrayOf(0, 1), intArrayOf(1, 3), intArrayOf(2, 3), intArrayOf(4, 0), intArrayOf(4, 5))
+                arrayOf(intArrayOf(0, 1), intArrayOf(1, 3), intArrayOf(2, 3), intArrayOf(4, 0), intArrayOf(4, 5)),
             ),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
@@ -20,7 +20,7 @@ internal class SolutionTest {
     fun minReorder2() {
         assertThat(
             Solution().minReorder(5, arrayOf(intArrayOf(1, 0), intArrayOf(1, 2), intArrayOf(3, 2), intArrayOf(3, 4))),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -28,7 +28,7 @@ internal class SolutionTest {
     fun minReorder3() {
         assertThat(
             Solution().minReorder(6, arrayOf(intArrayOf(1, 0), intArrayOf(2, 0))),
-            equalTo(0)
+            equalTo(0),
         )
     }
 }
diff --git a/src/test/kotlin/g1401_1500/s1467_probability_of_a_two_boxes_having_the_same_number_of_distinct_balls/SolutionTest.kt b/src/test/kotlin/g1401_1500/s1467_probability_of_a_two_boxes_having_the_same_number_of_distinct_balls/SolutionTest.kt
index 0f3b46285..30aa8b3e3 100644
--- a/src/test/kotlin/g1401_1500/s1467_probability_of_a_two_boxes_having_the_same_number_of_distinct_balls/SolutionTest.kt
+++ b/src/test/kotlin/g1401_1500/s1467_probability_of_a_two_boxes_having_the_same_number_of_distinct_balls/SolutionTest.kt
@@ -14,7 +14,7 @@ internal class SolutionTest {
     fun probability2() {
         assertThat(
             Solution().getProbability(intArrayOf(2, 1, 1)),
-            equalTo(0.6666666666666666)
+            equalTo(0.6666666666666666),
         )
     }
 
diff --git a/src/test/kotlin/g1401_1500/s1470_shuffle_the_array/SolutionTest.kt b/src/test/kotlin/g1401_1500/s1470_shuffle_the_array/SolutionTest.kt
index f455c0a64..1c866e090 100644
--- a/src/test/kotlin/g1401_1500/s1470_shuffle_the_array/SolutionTest.kt
+++ b/src/test/kotlin/g1401_1500/s1470_shuffle_the_array/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun shuffle() {
         assertThat(
             Solution().shuffle(intArrayOf(2, 5, 1, 3, 4, 7), 3),
-            equalTo(intArrayOf(2, 3, 5, 4, 1, 7))
+            equalTo(intArrayOf(2, 3, 5, 4, 1, 7)),
         )
     }
 
@@ -17,14 +17,15 @@ internal class SolutionTest {
     fun shuffle2() {
         assertThat(
             Solution().shuffle(intArrayOf(1, 2, 3, 4, 4, 3, 2, 1), 4),
-            equalTo(intArrayOf(1, 4, 2, 3, 3, 2, 4, 1))
+            equalTo(intArrayOf(1, 4, 2, 3, 3, 2, 4, 1)),
         )
     }
 
     @Test
     fun shuffle3() {
         assertThat(
-            Solution().shuffle(intArrayOf(1, 1, 2, 2), 2), equalTo(intArrayOf(1, 2, 1, 2))
+            Solution().shuffle(intArrayOf(1, 1, 2, 2), 2),
+            equalTo(intArrayOf(1, 2, 1, 2)),
         )
     }
 }
diff --git a/src/test/kotlin/g1401_1500/s1471_the_k_strongest_values_in_an_array/SolutionTest.kt b/src/test/kotlin/g1401_1500/s1471_the_k_strongest_values_in_an_array/SolutionTest.kt
index f8d5952cc..c5ba28e3b 100644
--- a/src/test/kotlin/g1401_1500/s1471_the_k_strongest_values_in_an_array/SolutionTest.kt
+++ b/src/test/kotlin/g1401_1500/s1471_the_k_strongest_values_in_an_array/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun strongest() {
         assertThat(
             Solution().getStrongest(intArrayOf(1, 2, 3, 4, 5), 2),
-            equalTo(intArrayOf(5, 1))
+            equalTo(intArrayOf(5, 1)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun strongest2() {
         assertThat(
             Solution().getStrongest(intArrayOf(1, 1, 3, 5, 5), 2),
-            equalTo(intArrayOf(5, 5))
+            equalTo(intArrayOf(5, 5)),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun strongest3() {
         assertThat(
             Solution().getStrongest(intArrayOf(6, 7, 11, 7, 6, 8), 5),
-            equalTo(intArrayOf(11, 8, 6, 6, 7))
+            equalTo(intArrayOf(11, 8, 6, 6, 7)),
         )
     }
 }
diff --git a/src/test/kotlin/g1401_1500/s1473_paint_house_iii/SolutionTest.kt b/src/test/kotlin/g1401_1500/s1473_paint_house_iii/SolutionTest.kt
index 2453fd482..fe15ad215 100644
--- a/src/test/kotlin/g1401_1500/s1473_paint_house_iii/SolutionTest.kt
+++ b/src/test/kotlin/g1401_1500/s1473_paint_house_iii/SolutionTest.kt
@@ -16,13 +16,13 @@ internal class SolutionTest {
                         intArrayOf(10, 1),
                         intArrayOf(10, 1),
                         intArrayOf(1, 10),
-                        intArrayOf(5, 1)
+                        intArrayOf(5, 1),
                     ),
                     5,
                     2,
-                    3
+                    3,
                 ),
-            equalTo(9)
+            equalTo(9),
         )
     }
 
@@ -37,13 +37,13 @@ internal class SolutionTest {
                         intArrayOf(10, 1),
                         intArrayOf(10, 1),
                         intArrayOf(1, 10),
-                        intArrayOf(5, 1)
+                        intArrayOf(5, 1),
                     ),
                     5,
                     2,
-                    3
+                    3,
                 ),
-            equalTo(11)
+            equalTo(11),
         )
     }
 
@@ -56,9 +56,9 @@ internal class SolutionTest {
                     arrayOf(intArrayOf(1, 1, 1), intArrayOf(1, 1, 1), intArrayOf(1, 1, 1), intArrayOf(1, 1, 1)),
                     4,
                     3,
-                    3
+                    3,
                 ),
-            equalTo(-1)
+            equalTo(-1),
         )
     }
 }
diff --git a/src/test/kotlin/g1401_1500/s1475_final_prices_with_a_special_discount_in_a_shop/SolutionTest.kt b/src/test/kotlin/g1401_1500/s1475_final_prices_with_a_special_discount_in_a_shop/SolutionTest.kt
index abb8af9c6..148fce5ce 100644
--- a/src/test/kotlin/g1401_1500/s1475_final_prices_with_a_special_discount_in_a_shop/SolutionTest.kt
+++ b/src/test/kotlin/g1401_1500/s1475_final_prices_with_a_special_discount_in_a_shop/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun finalPrices() {
         assertThat(
             Solution().finalPrices(intArrayOf(8, 4, 6, 2, 3)),
-            equalTo(intArrayOf(4, 2, 4, 2, 3))
+            equalTo(intArrayOf(4, 2, 4, 2, 3)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun finalPrices2() {
         assertThat(
             Solution().finalPrices(intArrayOf(1, 2, 3, 4, 5)),
-            equalTo(intArrayOf(1, 2, 3, 4, 5))
+            equalTo(intArrayOf(1, 2, 3, 4, 5)),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun finalPrices3() {
         assertThat(
             Solution().finalPrices(intArrayOf(10, 1, 1, 6)),
-            equalTo(intArrayOf(9, 0, 1, 6))
+            equalTo(intArrayOf(9, 0, 1, 6)),
         )
     }
 }
diff --git a/src/test/kotlin/g1401_1500/s1476_subrectangle_queries/SubrectangleQueriesTest.kt b/src/test/kotlin/g1401_1500/s1476_subrectangle_queries/SubrectangleQueriesTest.kt
index 5458553ef..3410a7980 100644
--- a/src/test/kotlin/g1401_1500/s1476_subrectangle_queries/SubrectangleQueriesTest.kt
+++ b/src/test/kotlin/g1401_1500/s1476_subrectangle_queries/SubrectangleQueriesTest.kt
@@ -12,8 +12,8 @@ internal class SubrectangleQueriesTest {
                 intArrayOf(1, 2, 1),
                 intArrayOf(4, 3, 4),
                 intArrayOf(3, 2, 1),
-                intArrayOf(1, 1, 1)
-            )
+                intArrayOf(1, 1, 1),
+            ),
         )
         assertThat(subrectangleQueries.getValue(0, 2), equalTo(1))
         subrectangleQueries.updateSubrectangle(0, 0, 3, 2, 5)
diff --git a/src/test/kotlin/g1401_1500/s1477_find_two_non_overlapping_sub_arrays_each_with_target_sum/SolutionTest.kt b/src/test/kotlin/g1401_1500/s1477_find_two_non_overlapping_sub_arrays_each_with_target_sum/SolutionTest.kt
index 6e9e5fcd6..62912b152 100644
--- a/src/test/kotlin/g1401_1500/s1477_find_two_non_overlapping_sub_arrays_each_with_target_sum/SolutionTest.kt
+++ b/src/test/kotlin/g1401_1500/s1477_find_two_non_overlapping_sub_arrays_each_with_target_sum/SolutionTest.kt
@@ -19,7 +19,7 @@ internal class SolutionTest {
     fun minSumOfLengths3() {
         assertThat(
             Solution().minSumOfLengths(intArrayOf(4, 3, 2, 6, 2, 3, 4), 6),
-            equalTo(-1)
+            equalTo(-1),
         )
     }
 }
diff --git a/src/test/kotlin/g1401_1500/s1480_running_sum_of_1d_array/SolutionTest.kt b/src/test/kotlin/g1401_1500/s1480_running_sum_of_1d_array/SolutionTest.kt
index 2176bee9d..ab4c5c728 100644
--- a/src/test/kotlin/g1401_1500/s1480_running_sum_of_1d_array/SolutionTest.kt
+++ b/src/test/kotlin/g1401_1500/s1480_running_sum_of_1d_array/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun runningSum() {
         assertThat(
             Solution().runningSum(intArrayOf(1, 2, 3, 4)),
-            equalTo(intArrayOf(1, 3, 6, 10))
+            equalTo(intArrayOf(1, 3, 6, 10)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun runningSum2() {
         assertThat(
             Solution().runningSum(intArrayOf(1, 1, 1, 1, 1)),
-            equalTo(intArrayOf(1, 2, 3, 4, 5))
+            equalTo(intArrayOf(1, 2, 3, 4, 5)),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun runningSum3() {
         assertThat(
             Solution().runningSum(intArrayOf(3, 1, 2, 10, 1)),
-            equalTo(intArrayOf(3, 4, 6, 16, 17))
+            equalTo(intArrayOf(3, 4, 6, 16, 17)),
         )
     }
 }
diff --git a/src/test/kotlin/g1401_1500/s1481_least_number_of_unique_integers_after_k_removals/SolutionTest.kt b/src/test/kotlin/g1401_1500/s1481_least_number_of_unique_integers_after_k_removals/SolutionTest.kt
index 37e47c6d2..37f115327 100644
--- a/src/test/kotlin/g1401_1500/s1481_least_number_of_unique_integers_after_k_removals/SolutionTest.kt
+++ b/src/test/kotlin/g1401_1500/s1481_least_number_of_unique_integers_after_k_removals/SolutionTest.kt
@@ -14,7 +14,7 @@ internal class SolutionTest {
     fun findLeastNumOfUniqueInts2() {
         assertThat(
             Solution().findLeastNumOfUniqueInts(intArrayOf(4, 3, 1, 1, 3, 3, 2), 3),
-            equalTo(2)
+            equalTo(2),
         )
     }
 }
diff --git a/src/test/kotlin/g1401_1500/s1483_kth_ancestor_of_a_tree_node/TreeAncestorTest.kt b/src/test/kotlin/g1401_1500/s1483_kth_ancestor_of_a_tree_node/TreeAncestorTest.kt
index 28b682da4..ebfea6d6c 100644
--- a/src/test/kotlin/g1401_1500/s1483_kth_ancestor_of_a_tree_node/TreeAncestorTest.kt
+++ b/src/test/kotlin/g1401_1500/s1483_kth_ancestor_of_a_tree_node/TreeAncestorTest.kt
@@ -18,8 +18,8 @@ internal class TreeAncestorTest {
         val treeAncestor = TreeAncestor(
             21,
             intArrayOf(
-                -1, 0, 0, 1, 1, 2, 2, -1, 0, 0, 1, 1, 2, 2, -1, 0, 0, 1, 1, 2, 2
-            )
+                -1, 0, 0, 1, 1, 2, 2, -1, 0, 0, 1, 1, 2, 2, -1, 0, 0, 1, 1, 2, 2,
+            ),
         )
         assertThat(treeAncestor.getKthAncestor(3, 1), equalTo(1))
         assertThat(treeAncestor.getKthAncestor(5, 2), equalTo(0))
diff --git a/src/test/kotlin/g1401_1500/s1484_group_sold_products_by_the_date/MysqlTest.kt b/src/test/kotlin/g1401_1500/s1484_group_sold_products_by_the_date/MysqlTest.kt
index eaa83cdfb..cea7156e9 100644
--- a/src/test/kotlin/g1401_1500/s1484_group_sold_products_by_the_date/MysqlTest.kt
+++ b/src/test/kotlin/g1401_1500/s1484_group_sold_products_by_the_date/MysqlTest.kt
@@ -30,8 +30,8 @@ import javax.sql.DataSource
             "INSERT INTO Activities(sell_date, product)" +
             " VALUES ('2020-06-02', 'Mask'); " +
             "INSERT INTO Activities(sell_date, product)" +
-            " VALUES ('2020-05-30', 'T-Shirt'); "
-    ]
+            " VALUES ('2020-05-30', 'T-Shirt'); ",
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -43,19 +43,19 @@ internal class MysqlTest {
                     BufferedReader(
                         FileReader(
                             "src/main/kotlin/g1401_1500/s1484_group_sold_" +
-                                "products_by_the_date/script.sql"
-                        )
+                                "products_by_the_date/script.sql",
+                        ),
                     )
                         .lines()
                         .collect(Collectors.joining("\n"))
-                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace("#.*?\\r?\\n".toRegex(), ""),
                 ).use { resultSet ->
                     assertThat(resultSet.next(), equalTo(true))
                     assertThat(resultSet.getNString(1), equalTo("2020-05-30"))
                     assertThat(resultSet.getInt(2), equalTo(3))
                     assertThat(
                         resultSet.getNString(3),
-                        equalTo("Basketball,Headphone,T-Shirt")
+                        equalTo("Basketball,Headphone,T-Shirt"),
                     )
                     assertThat(resultSet.next(), equalTo(true))
                     assertThat(resultSet.getNString(1), equalTo("2020-06-01"))
diff --git a/src/test/kotlin/g1401_1500/s1487_making_file_names_unique/SolutionTest.kt b/src/test/kotlin/g1401_1500/s1487_making_file_names_unique/SolutionTest.kt
index 0caf61243..93fbfa70c 100644
--- a/src/test/kotlin/g1401_1500/s1487_making_file_names_unique/SolutionTest.kt
+++ b/src/test/kotlin/g1401_1500/s1487_making_file_names_unique/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun folderNames() {
         assertThat(
             Solution().getFolderNames(arrayOf("pes", "fifa", "gta", "pes(2019)")),
-            equalTo(arrayOf("pes", "fifa", "gta", "pes(2019)"))
+            equalTo(arrayOf("pes", "fifa", "gta", "pes(2019)")),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun folderNames2() {
         assertThat(
             Solution().getFolderNames(arrayOf("gta", "gta(1)", "gta", "avalon")),
-            equalTo(arrayOf("gta", "gta(1)", "gta(2)", "avalon"))
+            equalTo(arrayOf("gta", "gta(1)", "gta(2)", "avalon")),
         )
     }
 
@@ -31,14 +31,18 @@ internal class SolutionTest {
                         "onepiece(1)",
                         "onepiece(2)",
                         "onepiece(3)",
-                        "onepiece"
-                    )
+                        "onepiece",
+                    ),
                 ),
             equalTo(
                 arrayOf(
-                    "onepiece", "onepiece(1)", "onepiece(2)", "onepiece(3)", "onepiece(4)"
-                )
-            )
+                    "onepiece",
+                    "onepiece(1)",
+                    "onepiece(2)",
+                    "onepiece(3)",
+                    "onepiece(4)",
+                ),
+            ),
         )
     }
 }
diff --git a/src/test/kotlin/g1401_1500/s1488_avoid_flood_in_the_city/SolutionTest.kt b/src/test/kotlin/g1401_1500/s1488_avoid_flood_in_the_city/SolutionTest.kt
index 677be6825..e71e3ed9e 100644
--- a/src/test/kotlin/g1401_1500/s1488_avoid_flood_in_the_city/SolutionTest.kt
+++ b/src/test/kotlin/g1401_1500/s1488_avoid_flood_in_the_city/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun avoidFlood() {
         assertThat(
             Solution().avoidFlood(intArrayOf(1, 2, 3, 4)),
-            equalTo(intArrayOf(-1, -1, -1, -1))
+            equalTo(intArrayOf(-1, -1, -1, -1)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun avoidFlood2() {
         assertThat(
             Solution().avoidFlood(intArrayOf(1, 2, 0, 0, 2, 1)),
-            equalTo(intArrayOf(-1, -1, 2, 1, -1, -1))
+            equalTo(intArrayOf(-1, -1, 2, 1, -1, -1)),
         )
     }
 
diff --git a/src/test/kotlin/g1401_1500/s1489_find_critical_and_pseudo_critical_edges_in_minimum_spanning_tree/SolutionTest.kt b/src/test/kotlin/g1401_1500/s1489_find_critical_and_pseudo_critical_edges_in_minimum_spanning_tree/SolutionTest.kt
index e5b8679bf..41fd3fe97 100644
--- a/src/test/kotlin/g1401_1500/s1489_find_critical_and_pseudo_critical_edges_in_minimum_spanning_tree/SolutionTest.kt
+++ b/src/test/kotlin/g1401_1500/s1489_find_critical_and_pseudo_critical_edges_in_minimum_spanning_tree/SolutionTest.kt
@@ -19,10 +19,10 @@ internal class SolutionTest {
                         intArrayOf(0, 3, 2),
                         intArrayOf(0, 4, 3),
                         intArrayOf(3, 4, 3),
-                        intArrayOf(1, 4, 6)
-                    )
+                        intArrayOf(1, 4, 6),
+                    ),
                 ),
-            equalTo(getLists(arrayOf(intArrayOf(0, 1), intArrayOf(2, 3, 4, 5))))
+            equalTo(getLists(arrayOf(intArrayOf(0, 1), intArrayOf(2, 3, 4, 5)))),
         )
     }
 
@@ -31,9 +31,10 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .findCriticalAndPseudoCriticalEdges(
-                    4, arrayOf(intArrayOf(0, 1, 1), intArrayOf(1, 2, 1), intArrayOf(2, 3, 1), intArrayOf(0, 3, 1))
+                    4,
+                    arrayOf(intArrayOf(0, 1, 1), intArrayOf(1, 2, 1), intArrayOf(2, 3, 1), intArrayOf(0, 3, 1)),
                 ),
-            equalTo(getLists(arrayOf(intArrayOf(), intArrayOf(0, 1, 2, 3))))
+            equalTo(getLists(arrayOf(intArrayOf(), intArrayOf(0, 1, 2, 3)))),
         )
     }
 }
diff --git a/src/test/kotlin/g1401_1500/s1491_average_salary_excluding_the_minimum_and_maximum_salary/SolutionTest.kt b/src/test/kotlin/g1401_1500/s1491_average_salary_excluding_the_minimum_and_maximum_salary/SolutionTest.kt
index 377e0fe65..f45393a45 100644
--- a/src/test/kotlin/g1401_1500/s1491_average_salary_excluding_the_minimum_and_maximum_salary/SolutionTest.kt
+++ b/src/test/kotlin/g1401_1500/s1491_average_salary_excluding_the_minimum_and_maximum_salary/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun average() {
         assertThat(
             Solution().average(intArrayOf(4000, 3000, 1000, 2000)),
-            equalTo(2500.00000)
+            equalTo(2500.00000),
         )
     }
 
diff --git a/src/test/kotlin/g1401_1500/s1493_longest_subarray_of_1s_after_deleting_one_element/SolutionTest.kt b/src/test/kotlin/g1401_1500/s1493_longest_subarray_of_1s_after_deleting_one_element/SolutionTest.kt
index a78efb540..15b1fccbf 100644
--- a/src/test/kotlin/g1401_1500/s1493_longest_subarray_of_1s_after_deleting_one_element/SolutionTest.kt
+++ b/src/test/kotlin/g1401_1500/s1493_longest_subarray_of_1s_after_deleting_one_element/SolutionTest.kt
@@ -13,7 +13,8 @@ internal class SolutionTest {
     @Test
     fun longestSubarray2() {
         assertThat(
-            Solution().longestSubarray(intArrayOf(0, 1, 1, 1, 0, 1, 1, 0, 1)), equalTo(5)
+            Solution().longestSubarray(intArrayOf(0, 1, 1, 1, 0, 1, 1, 0, 1)),
+            equalTo(5),
         )
     }
 
diff --git a/src/test/kotlin/g1401_1500/s1494_parallel_courses_ii/SolutionTest.kt b/src/test/kotlin/g1401_1500/s1494_parallel_courses_ii/SolutionTest.kt
index fec3c9f11..43c3de26f 100644
--- a/src/test/kotlin/g1401_1500/s1494_parallel_courses_ii/SolutionTest.kt
+++ b/src/test/kotlin/g1401_1500/s1494_parallel_courses_ii/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun minNumberOfSemesters() {
         assertThat(
             Solution().minNumberOfSemesters(4, arrayOf(intArrayOf(2, 1), intArrayOf(3, 1), intArrayOf(1, 4)), 2),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
@@ -20,9 +20,9 @@ internal class SolutionTest {
                 .minNumberOfSemesters(
                     5,
                     arrayOf(intArrayOf(2, 1), intArrayOf(3, 1), intArrayOf(4, 1), intArrayOf(1, 5)),
-                    2
+                    2,
                 ),
-            equalTo(4)
+            equalTo(4),
         )
     }
 
diff --git a/src/test/kotlin/g1401_1500/s1497_check_if_array_pairs_are_divisible_by_k/SolutionTest.kt b/src/test/kotlin/g1401_1500/s1497_check_if_array_pairs_are_divisible_by_k/SolutionTest.kt
index 17533e13f..da5fa7dcf 100644
--- a/src/test/kotlin/g1401_1500/s1497_check_if_array_pairs_are_divisible_by_k/SolutionTest.kt
+++ b/src/test/kotlin/g1401_1500/s1497_check_if_array_pairs_are_divisible_by_k/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun canArrange() {
         assertThat(
             Solution().canArrange(intArrayOf(1, 2, 3, 4, 5, 10, 6, 7, 8, 9), 5),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
diff --git a/src/test/kotlin/g1401_1500/s1499_max_value_of_equation/SolutionTest.kt b/src/test/kotlin/g1401_1500/s1499_max_value_of_equation/SolutionTest.kt
index d2e315065..f9b818d1d 100644
--- a/src/test/kotlin/g1401_1500/s1499_max_value_of_equation/SolutionTest.kt
+++ b/src/test/kotlin/g1401_1500/s1499_max_value_of_equation/SolutionTest.kt
@@ -14,11 +14,11 @@ internal class SolutionTest {
                         intArrayOf(1, 3),
                         intArrayOf(2, 0),
                         intArrayOf(5, 10),
-                        intArrayOf(6, -10)
+                        intArrayOf(6, -10),
                     ),
-                    1
+                    1,
                 ),
-            equalTo(4)
+            equalTo(4),
         )
     }
 
@@ -26,7 +26,7 @@ internal class SolutionTest {
     fun findMaxValueOfEquation2() {
         assertThat(
             Solution().findMaxValueOfEquation(arrayOf(intArrayOf(0, 0), intArrayOf(3, 0), intArrayOf(9, 2)), 3),
-            equalTo(3)
+            equalTo(3),
         )
     }
 }
diff --git a/src/test/kotlin/g1501_1600/s1502_can_make_arithmetic_progression_from_sequence/SolutionTest.kt b/src/test/kotlin/g1501_1600/s1502_can_make_arithmetic_progression_from_sequence/SolutionTest.kt
index 55c16c53f..48c270055 100644
--- a/src/test/kotlin/g1501_1600/s1502_can_make_arithmetic_progression_from_sequence/SolutionTest.kt
+++ b/src/test/kotlin/g1501_1600/s1502_can_make_arithmetic_progression_from_sequence/SolutionTest.kt
@@ -9,14 +9,15 @@ internal class SolutionTest {
     fun canMakeArithmeticProgression() {
         assertThat(
             Solution().canMakeArithmeticProgression(intArrayOf(3, 5, 1)),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
     @Test
     fun canMakeArithmeticProgression2() {
         assertThat(
-            Solution().canMakeArithmeticProgression(intArrayOf(1, 2, 4)), equalTo(false)
+            Solution().canMakeArithmeticProgression(intArrayOf(1, 2, 4)),
+            equalTo(false),
         )
     }
 }
diff --git a/src/test/kotlin/g1501_1600/s1503_last_moment_before_all_ants_fall_out_of_a_plank/SolutionTest.kt b/src/test/kotlin/g1501_1600/s1503_last_moment_before_all_ants_fall_out_of_a_plank/SolutionTest.kt
index c549be4ef..b31fde93d 100644
--- a/src/test/kotlin/g1501_1600/s1503_last_moment_before_all_ants_fall_out_of_a_plank/SolutionTest.kt
+++ b/src/test/kotlin/g1501_1600/s1503_last_moment_before_all_ants_fall_out_of_a_plank/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun lastMoment() {
         assertThat(
             Solution().getLastMoment(4, intArrayOf(4, 3), intArrayOf(0, 1)),
-            equalTo(4)
+            equalTo(4),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun lastMoment2() {
         assertThat(
             Solution().getLastMoment(7, intArrayOf(), intArrayOf(0, 1, 2, 3, 4, 5, 6, 7)),
-            equalTo(7)
+            equalTo(7),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun lastMoment3() {
         assertThat(
             Solution().getLastMoment(7, intArrayOf(0, 1, 2, 3, 4, 5, 6, 7), intArrayOf()),
-            equalTo(7)
+            equalTo(7),
         )
     }
 }
diff --git a/src/test/kotlin/g1501_1600/s1504_count_submatrices_with_all_ones/SolutionTest.kt b/src/test/kotlin/g1501_1600/s1504_count_submatrices_with_all_ones/SolutionTest.kt
index 6e6999fbf..a94100fbf 100644
--- a/src/test/kotlin/g1501_1600/s1504_count_submatrices_with_all_ones/SolutionTest.kt
+++ b/src/test/kotlin/g1501_1600/s1504_count_submatrices_with_all_ones/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun numSubmat() {
         assertThat(
             Solution().numSubmat(arrayOf(intArrayOf(1, 0, 1), intArrayOf(1, 1, 0), intArrayOf(1, 1, 0))),
-            equalTo(13)
+            equalTo(13),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun numSubmat2() {
         assertThat(
             Solution().numSubmat(arrayOf(intArrayOf(0, 1, 1, 0), intArrayOf(0, 1, 1, 1), intArrayOf(1, 1, 1, 0))),
-            equalTo(24)
+            equalTo(24),
         )
     }
 }
diff --git a/src/test/kotlin/g1501_1600/s1514_path_with_maximum_probability/SolutionTest.kt b/src/test/kotlin/g1501_1600/s1514_path_with_maximum_probability/SolutionTest.kt
index 26be24761..8e5ee1c14 100644
--- a/src/test/kotlin/g1501_1600/s1514_path_with_maximum_probability/SolutionTest.kt
+++ b/src/test/kotlin/g1501_1600/s1514_path_with_maximum_probability/SolutionTest.kt
@@ -10,11 +10,13 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .maxProbability(
-                    3, arrayOf(intArrayOf(0, 1), intArrayOf(1, 2), intArrayOf(0, 2)), doubleArrayOf(0.5, 0.5, 0.2),
+                    3,
+                    arrayOf(intArrayOf(0, 1), intArrayOf(1, 2), intArrayOf(0, 2)),
+                    doubleArrayOf(0.5, 0.5, 0.2),
                     0,
-                    2
+                    2,
                 ),
-            equalTo(0.2500)
+            equalTo(0.2500),
         )
     }
 
@@ -23,11 +25,13 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .maxProbability(
-                    3, arrayOf(intArrayOf(0, 1), intArrayOf(1, 2), intArrayOf(0, 2)), doubleArrayOf(0.5, 0.5, 0.3),
+                    3,
+                    arrayOf(intArrayOf(0, 1), intArrayOf(1, 2), intArrayOf(0, 2)),
+                    doubleArrayOf(0.5, 0.5, 0.3),
                     0,
-                    2
+                    2,
                 ),
-            equalTo(0.3)
+            equalTo(0.3),
         )
     }
 
@@ -35,7 +39,7 @@ internal class SolutionTest {
     fun maxProbability3() {
         assertThat(
             Solution().maxProbability(3, arrayOf(intArrayOf(0, 1)), doubleArrayOf(0.5), 0, 2),
-            equalTo(0.0)
+            equalTo(0.0),
         )
     }
 }
diff --git a/src/test/kotlin/g1501_1600/s1515_best_position_for_a_service_centre/SolutionTest.kt b/src/test/kotlin/g1501_1600/s1515_best_position_for_a_service_centre/SolutionTest.kt
index 0217c5ff9..0078141df 100644
--- a/src/test/kotlin/g1501_1600/s1515_best_position_for_a_service_centre/SolutionTest.kt
+++ b/src/test/kotlin/g1501_1600/s1515_best_position_for_a_service_centre/SolutionTest.kt
@@ -13,10 +13,10 @@ internal class SolutionTest {
                     intArrayOf(0, 1),
                     intArrayOf(1, 0),
                     intArrayOf(1, 2),
-                    intArrayOf(2, 1)
-                )
+                    intArrayOf(2, 1),
+                ),
             ),
-            equalTo(4.00)
+            equalTo(4.00),
         )
     }
 
@@ -24,7 +24,7 @@ internal class SolutionTest {
     fun minDistSum2() {
         assertThat(
             Solution().getMinDistSum(arrayOf(intArrayOf(1, 1), intArrayOf(3, 3))),
-            equalTo(2.82842712474619)
+            equalTo(2.82842712474619),
         )
     }
 }
diff --git a/src/test/kotlin/g1501_1600/s1517_find_users_with_valid_e_mails/MysqlTest.kt b/src/test/kotlin/g1501_1600/s1517_find_users_with_valid_e_mails/MysqlTest.kt
index 62824eaf1..355a7c23a 100644
--- a/src/test/kotlin/g1501_1600/s1517_find_users_with_valid_e_mails/MysqlTest.kt
+++ b/src/test/kotlin/g1501_1600/s1517_find_users_with_valid_e_mails/MysqlTest.kt
@@ -31,8 +31,8 @@ import javax.sql.DataSource
             "INSERT INTO Users(user_id, name, mail)" +
             " VALUES (6, 'David', 'david69@gmail.com'); " +
             "INSERT INTO Users(user_id, name, mail)" +
-            " VALUES (7, 'Shapiro', '.shapo@leetcode.com'); "
-    ]
+            " VALUES (7, 'Shapiro', '.shapo@leetcode.com'); ",
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -44,12 +44,12 @@ internal class MysqlTest {
                     BufferedReader(
                         FileReader(
                             "src/main/kotlin/g1501_1600/s1517_find_users_with_valid_e_mails" +
-                                "/script.sql"
-                        )
+                                "/script.sql",
+                        ),
                     )
                         .lines()
                         .collect(Collectors.joining("\n"))
-                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace("#.*?\\r?\\n".toRegex(), ""),
                 ).use { resultSet ->
                     assertThat(resultSet.next(), equalTo(true))
                     assertThat(resultSet.getInt(1), equalTo(1))
diff --git a/src/test/kotlin/g1501_1600/s1519_number_of_nodes_in_the_sub_tree_with_the_same_label/SolutionTest.kt b/src/test/kotlin/g1501_1600/s1519_number_of_nodes_in_the_sub_tree_with_the_same_label/SolutionTest.kt
index aca618890..00572efbd 100644
--- a/src/test/kotlin/g1501_1600/s1519_number_of_nodes_in_the_sub_tree_with_the_same_label/SolutionTest.kt
+++ b/src/test/kotlin/g1501_1600/s1519_number_of_nodes_in_the_sub_tree_with_the_same_label/SolutionTest.kt
@@ -17,11 +17,11 @@ internal class SolutionTest {
                         intArrayOf(1, 4),
                         intArrayOf(1, 5),
                         intArrayOf(2, 3),
-                        intArrayOf(2, 6)
+                        intArrayOf(2, 6),
                     ),
-                    "abaedcd"
+                    "abaedcd",
                 ),
-            equalTo(intArrayOf(2, 1, 1, 1, 1, 1, 1))
+            equalTo(intArrayOf(2, 1, 1, 1, 1, 1, 1)),
         )
     }
 
@@ -29,7 +29,7 @@ internal class SolutionTest {
     fun countSubTrees2() {
         assertThat(
             Solution().countSubTrees(4, arrayOf(intArrayOf(0, 1), intArrayOf(1, 2), intArrayOf(0, 3)), "bbbb"),
-            equalTo(intArrayOf(4, 2, 1, 1))
+            equalTo(intArrayOf(4, 2, 1, 1)),
         )
     }
 
@@ -40,9 +40,9 @@ internal class SolutionTest {
                 .countSubTrees(
                     5,
                     arrayOf(intArrayOf(0, 1), intArrayOf(0, 2), intArrayOf(1, 3), intArrayOf(0, 4)),
-                    "aabab"
+                    "aabab",
                 ),
-            equalTo(intArrayOf(3, 2, 1, 1, 1))
+            equalTo(intArrayOf(3, 2, 1, 1, 1)),
         )
     }
 }
diff --git a/src/test/kotlin/g1501_1600/s1520_maximum_number_of_non_overlapping_substrings/SolutionTest.kt b/src/test/kotlin/g1501_1600/s1520_maximum_number_of_non_overlapping_substrings/SolutionTest.kt
index f1645b288..4fb5a064c 100644
--- a/src/test/kotlin/g1501_1600/s1520_maximum_number_of_non_overlapping_substrings/SolutionTest.kt
+++ b/src/test/kotlin/g1501_1600/s1520_maximum_number_of_non_overlapping_substrings/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun maxNumOfSubstrings() {
         assertThat(
             Solution().maxNumOfSubstrings("adefaddaccc"),
-            equalTo(mutableListOf("e", "f", "ccc"))
+            equalTo(mutableListOf("e", "f", "ccc")),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun maxNumOfSubstrings2() {
         assertThat(
             Solution().maxNumOfSubstrings("abbaccd"),
-            equalTo(mutableListOf("bb", "cc", "d"))
+            equalTo(mutableListOf("bb", "cc", "d")),
         )
     }
 }
diff --git a/src/test/kotlin/g1501_1600/s1521_find_a_value_of_a_mysterious_function_closest_to_target/SolutionTest.kt b/src/test/kotlin/g1501_1600/s1521_find_a_value_of_a_mysterious_function_closest_to_target/SolutionTest.kt
index fcd6154d5..1c042ec9c 100644
--- a/src/test/kotlin/g1501_1600/s1521_find_a_value_of_a_mysterious_function_closest_to_target/SolutionTest.kt
+++ b/src/test/kotlin/g1501_1600/s1521_find_a_value_of_a_mysterious_function_closest_to_target/SolutionTest.kt
@@ -14,7 +14,7 @@ internal class SolutionTest {
     fun closestToTarget2() {
         assertThat(
             Solution().closestToTarget(intArrayOf(1000000, 1000000, 1000000), 1),
-            equalTo(999999)
+            equalTo(999999),
         )
     }
 
diff --git a/src/test/kotlin/g1501_1600/s1527_patients_with_a_condition/MysqlTest.kt b/src/test/kotlin/g1501_1600/s1527_patients_with_a_condition/MysqlTest.kt
index 2b6070eec..6cf8144e5 100644
--- a/src/test/kotlin/g1501_1600/s1527_patients_with_a_condition/MysqlTest.kt
+++ b/src/test/kotlin/g1501_1600/s1527_patients_with_a_condition/MysqlTest.kt
@@ -27,8 +27,8 @@ import javax.sql.DataSource
             "INSERT INTO Patients(patient_id, patient_name, conditions)" +
             " VALUES (4, 'George', 'ACNE DIAB100'); " +
             "INSERT INTO Patients(patient_id, patient_name, conditions)" +
-            " VALUES (5, 'Alain', 'DIAB201'); "
-    ]
+            " VALUES (5, 'Alain', 'DIAB201'); ",
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -40,12 +40,12 @@ internal class MysqlTest {
                     BufferedReader(
                         FileReader(
                             "src/main/kotlin/g1501_1600/s1527_patien" +
-                                "ts_with_a_condition/script.sql"
-                        )
+                                "ts_with_a_condition/script.sql",
+                        ),
                     )
                         .lines()
                         .collect(Collectors.joining("\n"))
-                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace("#.*?\\r?\\n".toRegex(), ""),
                 ).use { resultSet ->
                     assertThat(resultSet.next(), equalTo(true))
                     assertThat(resultSet.getInt(1), equalTo(3))
diff --git a/src/test/kotlin/g1501_1600/s1528_shuffle_string/SolutionTest.kt b/src/test/kotlin/g1501_1600/s1528_shuffle_string/SolutionTest.kt
index 9154eebba..74bf992e1 100644
--- a/src/test/kotlin/g1501_1600/s1528_shuffle_string/SolutionTest.kt
+++ b/src/test/kotlin/g1501_1600/s1528_shuffle_string/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun restoreString() {
         assertThat(
             Solution().restoreString("codeleet", intArrayOf(4, 5, 6, 7, 0, 2, 1, 3)),
-            equalTo("leetcode")
+            equalTo("leetcode"),
         )
     }
 
diff --git a/src/test/kotlin/g1501_1600/s1531_string_compression_ii/SolutionTest.kt b/src/test/kotlin/g1501_1600/s1531_string_compression_ii/SolutionTest.kt
index bcd48bd5e..2757ccb90 100644
--- a/src/test/kotlin/g1501_1600/s1531_string_compression_ii/SolutionTest.kt
+++ b/src/test/kotlin/g1501_1600/s1531_string_compression_ii/SolutionTest.kt
@@ -19,7 +19,7 @@ internal class SolutionTest {
     fun lengthOfOptimalCompression3() {
         assertThat(
             Solution().getLengthOfOptimalCompression("aaaaaaaaaaa", 0),
-            equalTo(3)
+            equalTo(3),
         )
     }
 }
diff --git a/src/test/kotlin/g1501_1600/s1534_count_good_triplets/SolutionTest.kt b/src/test/kotlin/g1501_1600/s1534_count_good_triplets/SolutionTest.kt
index bd9290d77..28e286f7c 100644
--- a/src/test/kotlin/g1501_1600/s1534_count_good_triplets/SolutionTest.kt
+++ b/src/test/kotlin/g1501_1600/s1534_count_good_triplets/SolutionTest.kt
@@ -9,14 +9,15 @@ internal class SolutionTest {
     fun countGoodTriplets() {
         assertThat(
             Solution().countGoodTriplets(intArrayOf(3, 0, 1, 1, 9, 7), 7, 2, 3),
-            equalTo(4)
+            equalTo(4),
         )
     }
 
     @Test
     fun countGoodTriplets2() {
         assertThat(
-            Solution().countGoodTriplets(intArrayOf(1, 1, 2, 2, 3), 0, 0, 1), equalTo(0)
+            Solution().countGoodTriplets(intArrayOf(1, 1, 2, 2, 3), 0, 0, 1),
+            equalTo(0),
         )
     }
 }
diff --git a/src/test/kotlin/g1501_1600/s1536_minimum_swaps_to_arrange_a_binary_grid/SolutionTest.kt b/src/test/kotlin/g1501_1600/s1536_minimum_swaps_to_arrange_a_binary_grid/SolutionTest.kt
index 8d74fa4ba..fd76c8542 100644
--- a/src/test/kotlin/g1501_1600/s1536_minimum_swaps_to_arrange_a_binary_grid/SolutionTest.kt
+++ b/src/test/kotlin/g1501_1600/s1536_minimum_swaps_to_arrange_a_binary_grid/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun minSwaps() {
         assertThat(
             Solution().minSwaps(arrayOf(intArrayOf(0, 0, 1), intArrayOf(1, 1, 0), intArrayOf(1, 0, 0))),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
@@ -22,10 +22,10 @@ internal class SolutionTest {
                         intArrayOf(0, 1, 1, 0),
                         intArrayOf(0, 1, 1, 0),
                         intArrayOf(0, 1, 1, 0),
-                        intArrayOf(0, 1, 1, 0)
-                    )
+                        intArrayOf(0, 1, 1, 0),
+                    ),
                 ),
-            equalTo(-1)
+            equalTo(-1),
         )
     }
 
@@ -33,7 +33,7 @@ internal class SolutionTest {
     fun minSwaps3() {
         assertThat(
             Solution().minSwaps(arrayOf(intArrayOf(1, 0, 0), intArrayOf(1, 1, 0), intArrayOf(1, 1, 1))),
-            equalTo(0)
+            equalTo(0),
         )
     }
 }
diff --git a/src/test/kotlin/g1501_1600/s1537_get_the_maximum_score/SolutionTest.kt b/src/test/kotlin/g1501_1600/s1537_get_the_maximum_score/SolutionTest.kt
index d995e187a..be75f8a1a 100644
--- a/src/test/kotlin/g1501_1600/s1537_get_the_maximum_score/SolutionTest.kt
+++ b/src/test/kotlin/g1501_1600/s1537_get_the_maximum_score/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun maxSum() {
         assertThat(
             Solution().maxSum(intArrayOf(2, 4, 5, 8, 10), intArrayOf(4, 6, 8, 9)),
-            equalTo(30)
+            equalTo(30),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun maxSum2() {
         assertThat(
             Solution().maxSum(intArrayOf(1, 3, 5, 7, 9), intArrayOf(3, 5, 100)),
-            equalTo(109)
+            equalTo(109),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun maxSum3() {
         assertThat(
             Solution().maxSum(intArrayOf(1, 2, 3, 4, 5), intArrayOf(6, 7, 8, 9, 10)),
-            equalTo(40)
+            equalTo(40),
         )
     }
 }
diff --git a/src/test/kotlin/g1501_1600/s1546_maximum_number_of_non_overlapping_subarrays_with_sum_equals_target/SolutionTest.kt b/src/test/kotlin/g1501_1600/s1546_maximum_number_of_non_overlapping_subarrays_with_sum_equals_target/SolutionTest.kt
index 71e5a8c54..010d8f43d 100644
--- a/src/test/kotlin/g1501_1600/s1546_maximum_number_of_non_overlapping_subarrays_with_sum_equals_target/SolutionTest.kt
+++ b/src/test/kotlin/g1501_1600/s1546_maximum_number_of_non_overlapping_subarrays_with_sum_equals_target/SolutionTest.kt
@@ -13,7 +13,8 @@ internal class SolutionTest {
     @Test
     fun maxNonOverlapping2() {
         assertThat(
-            Solution().maxNonOverlapping(intArrayOf(-1, 3, 5, 1, 4, 2, -9), 6), equalTo(2)
+            Solution().maxNonOverlapping(intArrayOf(-1, 3, 5, 1, 4, 2, -9), 6),
+            equalTo(2),
         )
     }
 }
diff --git a/src/test/kotlin/g1501_1600/s1550_three_consecutive_odds/SolutionTest.kt b/src/test/kotlin/g1501_1600/s1550_three_consecutive_odds/SolutionTest.kt
index a60549106..4f42ed8f0 100644
--- a/src/test/kotlin/g1501_1600/s1550_three_consecutive_odds/SolutionTest.kt
+++ b/src/test/kotlin/g1501_1600/s1550_three_consecutive_odds/SolutionTest.kt
@@ -14,7 +14,7 @@ internal class SolutionTest {
     fun threeConsecutiveOdds2() {
         assertThat(
             Solution().threeConsecutiveOdds(intArrayOf(1, 2, 34, 3, 4, 5, 7, 23, 12)),
-            equalTo(true)
+            equalTo(true),
         )
     }
 }
diff --git a/src/test/kotlin/g1501_1600/s1552_magnetic_force_between_two_balls/SolutionTest.kt b/src/test/kotlin/g1501_1600/s1552_magnetic_force_between_two_balls/SolutionTest.kt
index 05939aac4..2a4c45d9c 100644
--- a/src/test/kotlin/g1501_1600/s1552_magnetic_force_between_two_balls/SolutionTest.kt
+++ b/src/test/kotlin/g1501_1600/s1552_magnetic_force_between_two_balls/SolutionTest.kt
@@ -14,7 +14,7 @@ internal class SolutionTest {
     fun maxDistance2() {
         assertThat(
             Solution().maxDistance(intArrayOf(5, 4, 3, 2, 1, 1000000000), 2),
-            equalTo(999999999)
+            equalTo(999999999),
         )
     }
 }
diff --git a/src/test/kotlin/g1501_1600/s1557_minimum_number_of_vertices_to_reach_all_nodes/SolutionTest.kt b/src/test/kotlin/g1501_1600/s1557_minimum_number_of_vertices_to_reach_all_nodes/SolutionTest.kt
index 89f917a2b..fbf9c3736 100644
--- a/src/test/kotlin/g1501_1600/s1557_minimum_number_of_vertices_to_reach_all_nodes/SolutionTest.kt
+++ b/src/test/kotlin/g1501_1600/s1557_minimum_number_of_vertices_to_reach_all_nodes/SolutionTest.kt
@@ -16,10 +16,10 @@ internal class SolutionTest {
                         mutableListOf<Int>(0, 2),
                         mutableListOf<Int>(2, 5),
                         mutableListOf<Int>(3, 4),
-                        mutableListOf<Int>(4, 2)
-                    )
+                        mutableListOf<Int>(4, 2),
+                    ),
                 ),
-            equalTo(mutableListOf(0, 3))
+            equalTo(mutableListOf(0, 3)),
         )
     }
 
@@ -34,10 +34,10 @@ internal class SolutionTest {
                         mutableListOf<Int>(2, 1),
                         mutableListOf<Int>(3, 1),
                         mutableListOf<Int>(1, 4),
-                        mutableListOf<Int>(2, 4)
-                    )
+                        mutableListOf<Int>(2, 4),
+                    ),
                 ),
-            equalTo(mutableListOf(0, 2, 3))
+            equalTo(mutableListOf(0, 2, 3)),
         )
     }
 }
diff --git a/src/test/kotlin/g1501_1600/s1559_detect_cycles_in_2d_grid/SolutionTest.kt b/src/test/kotlin/g1501_1600/s1559_detect_cycles_in_2d_grid/SolutionTest.kt
index a8a578cde..998ceceb2 100644
--- a/src/test/kotlin/g1501_1600/s1559_detect_cycles_in_2d_grid/SolutionTest.kt
+++ b/src/test/kotlin/g1501_1600/s1559_detect_cycles_in_2d_grid/SolutionTest.kt
@@ -14,10 +14,10 @@ internal class SolutionTest {
                         charArrayOf('a', 'a', 'a', 'a'),
                         charArrayOf('a', 'b', 'b', 'a'),
                         charArrayOf('a', 'b', 'b', 'a'),
-                        charArrayOf('a', 'a', 'a', 'a')
-                    )
+                        charArrayOf('a', 'a', 'a', 'a'),
+                    ),
                 ),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
@@ -30,10 +30,10 @@ internal class SolutionTest {
                         charArrayOf('c', 'c', 'c', 'a'),
                         charArrayOf('c', 'd', 'c', 'c'),
                         charArrayOf('c', 'c', 'e', 'c'),
-                        charArrayOf('f', 'c', 'c', 'c')
-                    )
+                        charArrayOf('f', 'c', 'c', 'c'),
+                    ),
                 ),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
@@ -45,10 +45,10 @@ internal class SolutionTest {
                     arrayOf(
                         charArrayOf('a', 'b', 'b'),
                         charArrayOf('b', 'z', 'b'),
-                        charArrayOf('b', 'b', 'a')
-                    )
+                        charArrayOf('b', 'b', 'a'),
+                    ),
                 ),
-            equalTo(false)
+            equalTo(false),
         )
     }
 }
diff --git a/src/test/kotlin/g1501_1600/s1560_most_visited_sector_in_a_circular_track/SolutionTest.kt b/src/test/kotlin/g1501_1600/s1560_most_visited_sector_in_a_circular_track/SolutionTest.kt
index c44368a89..4b7df987c 100644
--- a/src/test/kotlin/g1501_1600/s1560_most_visited_sector_in_a_circular_track/SolutionTest.kt
+++ b/src/test/kotlin/g1501_1600/s1560_most_visited_sector_in_a_circular_track/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun mostVisited() {
         assertThat(
             Solution().mostVisited(4, intArrayOf(1, 3, 1, 2)),
-            equalTo(mutableListOf(1, 2))
+            equalTo(mutableListOf(1, 2)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun mostVisited2() {
         assertThat(
             Solution().mostVisited(2, intArrayOf(2, 1, 2, 1, 2, 1, 2, 1, 2)),
-            equalTo(listOf(2))
+            equalTo(listOf(2)),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun mostVisited3() {
         assertThat(
             Solution().mostVisited(7, intArrayOf(1, 3, 5, 7)),
-            equalTo(mutableListOf(1, 2, 3, 4, 5, 6, 7))
+            equalTo(mutableListOf(1, 2, 3, 4, 5, 6, 7)),
         )
     }
 }
diff --git a/src/test/kotlin/g1501_1600/s1566_detect_pattern_of_length_m_repeated_k_or_more_times/SolutionTest.kt b/src/test/kotlin/g1501_1600/s1566_detect_pattern_of_length_m_repeated_k_or_more_times/SolutionTest.kt
index f3024326b..241accd01 100644
--- a/src/test/kotlin/g1501_1600/s1566_detect_pattern_of_length_m_repeated_k_or_more_times/SolutionTest.kt
+++ b/src/test/kotlin/g1501_1600/s1566_detect_pattern_of_length_m_repeated_k_or_more_times/SolutionTest.kt
@@ -8,7 +8,8 @@ internal class SolutionTest {
     @Test
     fun containsPattern() {
         assertThat(
-            Solution().containsPattern(intArrayOf(1, 2, 4, 4, 4, 4), 1, 3), equalTo(true)
+            Solution().containsPattern(intArrayOf(1, 2, 4, 4, 4, 4), 1, 3),
+            equalTo(true),
         )
     }
 
@@ -16,14 +17,15 @@ internal class SolutionTest {
     fun containsPattern2() {
         assertThat(
             Solution().containsPattern(intArrayOf(1, 2, 1, 2, 1, 1, 1, 3), 2, 2),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
     @Test
     fun containsPattern3() {
         assertThat(
-            Solution().containsPattern(intArrayOf(1, 2, 1, 2, 1, 3), 2, 3), equalTo(false)
+            Solution().containsPattern(intArrayOf(1, 2, 1, 2, 1, 3), 2, 3),
+            equalTo(false),
         )
     }
 }
diff --git a/src/test/kotlin/g1501_1600/s1568_minimum_number_of_days_to_disconnect_island/SolutionTest.kt b/src/test/kotlin/g1501_1600/s1568_minimum_number_of_days_to_disconnect_island/SolutionTest.kt
index 7cdf2cacc..f769596fd 100644
--- a/src/test/kotlin/g1501_1600/s1568_minimum_number_of_days_to_disconnect_island/SolutionTest.kt
+++ b/src/test/kotlin/g1501_1600/s1568_minimum_number_of_days_to_disconnect_island/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun minDays() {
         assertThat(
             Solution().minDays(arrayOf(intArrayOf(0, 1, 1, 0), intArrayOf(0, 1, 1, 0), intArrayOf(0, 0, 0, 0))),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
diff --git a/src/test/kotlin/g1501_1600/s1572_matrix_diagonal_sum/SolutionTest.kt b/src/test/kotlin/g1501_1600/s1572_matrix_diagonal_sum/SolutionTest.kt
index c35fb0f0c..15be6709d 100644
--- a/src/test/kotlin/g1501_1600/s1572_matrix_diagonal_sum/SolutionTest.kt
+++ b/src/test/kotlin/g1501_1600/s1572_matrix_diagonal_sum/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun diagonalSum() {
         assertThat(
             Solution().diagonalSum(arrayOf(intArrayOf(1, 2, 3), intArrayOf(4, 5, 6), intArrayOf(7, 8, 9))),
-            equalTo(25)
+            equalTo(25),
         )
     }
 
@@ -22,10 +22,10 @@ internal class SolutionTest {
                         intArrayOf(1, 1, 1, 1),
                         intArrayOf(1, 1, 1, 1),
                         intArrayOf(1, 1, 1, 1),
-                        intArrayOf(1, 1, 1, 1)
-                    )
+                        intArrayOf(1, 1, 1, 1),
+                    ),
                 ),
-            equalTo(8)
+            equalTo(8),
         )
     }
 
diff --git a/src/test/kotlin/g1501_1600/s1574_shortest_subarray_to_be_removed_to_make_array_sorted/SolutionTest.kt b/src/test/kotlin/g1501_1600/s1574_shortest_subarray_to_be_removed_to_make_array_sorted/SolutionTest.kt
index 961937a1a..8a184214f 100644
--- a/src/test/kotlin/g1501_1600/s1574_shortest_subarray_to_be_removed_to_make_array_sorted/SolutionTest.kt
+++ b/src/test/kotlin/g1501_1600/s1574_shortest_subarray_to_be_removed_to_make_array_sorted/SolutionTest.kt
@@ -9,14 +9,15 @@ internal class SolutionTest {
     fun findLengthOfShortestSubarray() {
         assertThat(
             Solution().findLengthOfShortestSubarray(intArrayOf(1, 2, 3, 10, 4, 2, 3, 5)),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
     @Test
     fun findLengthOfShortestSubarray2() {
         assertThat(
-            Solution().findLengthOfShortestSubarray(intArrayOf(5, 4, 3, 2, 1)), equalTo(4)
+            Solution().findLengthOfShortestSubarray(intArrayOf(5, 4, 3, 2, 1)),
+            equalTo(4),
         )
     }
 
diff --git a/src/test/kotlin/g1501_1600/s1577_number_of_ways_where_square_of_number_is_equal_to_product_of_two_numbers/SolutionTest.kt b/src/test/kotlin/g1501_1600/s1577_number_of_ways_where_square_of_number_is_equal_to_product_of_two_numbers/SolutionTest.kt
index 13c4a4afd..85f9d5ea1 100644
--- a/src/test/kotlin/g1501_1600/s1577_number_of_ways_where_square_of_number_is_equal_to_product_of_two_numbers/SolutionTest.kt
+++ b/src/test/kotlin/g1501_1600/s1577_number_of_ways_where_square_of_number_is_equal_to_product_of_two_numbers/SolutionTest.kt
@@ -8,7 +8,8 @@ internal class SolutionTest {
     @Test
     fun numTriplets() {
         assertThat(
-            Solution().numTriplets(intArrayOf(7, 4), intArrayOf(5, 2, 8, 9)), equalTo(1)
+            Solution().numTriplets(intArrayOf(7, 4), intArrayOf(5, 2, 8, 9)),
+            equalTo(1),
         )
     }
 
@@ -21,7 +22,7 @@ internal class SolutionTest {
     fun numTriplets3() {
         assertThat(
             Solution().numTriplets(intArrayOf(7, 7, 8, 3), intArrayOf(1, 2, 9, 7)),
-            equalTo(2)
+            equalTo(2),
         )
     }
 }
diff --git a/src/test/kotlin/g1501_1600/s1579_remove_max_number_of_edges_to_keep_graph_fully_traversable/SolutionTest.kt b/src/test/kotlin/g1501_1600/s1579_remove_max_number_of_edges_to_keep_graph_fully_traversable/SolutionTest.kt
index 84cd94498..90cd0b878 100644
--- a/src/test/kotlin/g1501_1600/s1579_remove_max_number_of_edges_to_keep_graph_fully_traversable/SolutionTest.kt
+++ b/src/test/kotlin/g1501_1600/s1579_remove_max_number_of_edges_to_keep_graph_fully_traversable/SolutionTest.kt
@@ -17,10 +17,10 @@ internal class SolutionTest {
                         intArrayOf(1, 1, 3),
                         intArrayOf(1, 2, 4),
                         intArrayOf(1, 1, 2),
-                        intArrayOf(2, 3, 4)
-                    )
+                        intArrayOf(2, 3, 4),
+                    ),
                 ),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -29,9 +29,10 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .maxNumEdgesToRemove(
-                    4, arrayOf(intArrayOf(3, 1, 2), intArrayOf(3, 2, 3), intArrayOf(1, 1, 4), intArrayOf(2, 1, 4))
+                    4,
+                    arrayOf(intArrayOf(3, 1, 2), intArrayOf(3, 2, 3), intArrayOf(1, 1, 4), intArrayOf(2, 1, 4)),
                 ),
-            equalTo(0)
+            equalTo(0),
         )
     }
 
@@ -40,7 +41,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .maxNumEdgesToRemove(4, arrayOf(intArrayOf(3, 2, 3), intArrayOf(1, 1, 2), intArrayOf(2, 3, 4))),
-            equalTo(-1)
+            equalTo(-1),
         )
     }
 }
diff --git a/src/test/kotlin/g1501_1600/s1581_customer_who_visited_but_did_not_make_any_transactions/MysqlTest.kt b/src/test/kotlin/g1501_1600/s1581_customer_who_visited_but_did_not_make_any_transactions/MysqlTest.kt
index 5628d5570..beb9c6058 100644
--- a/src/test/kotlin/g1501_1600/s1581_customer_who_visited_but_did_not_make_any_transactions/MysqlTest.kt
+++ b/src/test/kotlin/g1501_1600/s1581_customer_who_visited_but_did_not_make_any_transactions/MysqlTest.kt
@@ -35,8 +35,8 @@ import javax.sql.DataSource
             "INSERT INTO Transactions(transaction_id, visit_id, amount)" +
             " VALUES (12, 1, 910); " +
             "INSERT INTO Transactions(transaction_id, visit_id, amount)" +
-            " VALUES (13, 2, 970); "
-    ]
+            " VALUES (13, 2, 970); ",
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -49,12 +49,12 @@ internal class MysqlTest {
                         FileReader(
                             "src/main/kotlin/g1501_1600/s1581_customer_who_visi" +
                                 "ted_but_did_not_make_any_transactions/scr" +
-                                "ipt.sql"
-                        )
+                                "ipt.sql",
+                        ),
                     )
                         .lines()
                         .collect(Collectors.joining("\n"))
-                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace("#.*?\\r?\\n".toRegex(), ""),
                 ).use { resultSet ->
                     assertThat(resultSet.next(), equalTo(true))
                     assertThat(resultSet.getInt(1), equalTo(30))
diff --git a/src/test/kotlin/g1501_1600/s1582_special_positions_in_a_binary_matrix/SolutionTest.kt b/src/test/kotlin/g1501_1600/s1582_special_positions_in_a_binary_matrix/SolutionTest.kt
index 6b8a63621..2a1bf3652 100644
--- a/src/test/kotlin/g1501_1600/s1582_special_positions_in_a_binary_matrix/SolutionTest.kt
+++ b/src/test/kotlin/g1501_1600/s1582_special_positions_in_a_binary_matrix/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun numSpecial() {
         assertThat(
             Solution().numSpecial(arrayOf(intArrayOf(1, 0, 0), intArrayOf(0, 0, 1), intArrayOf(1, 0, 0))),
-            equalTo(1)
+            equalTo(1),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun numSpecial2() {
         assertThat(
             Solution().numSpecial(arrayOf(intArrayOf(1, 0, 0), intArrayOf(0, 1, 0), intArrayOf(0, 0, 1))),
-            equalTo(3)
+            equalTo(3),
         )
     }
 }
diff --git a/src/test/kotlin/g1501_1600/s1583_count_unhappy_friends/SolutionTest.kt b/src/test/kotlin/g1501_1600/s1583_count_unhappy_friends/SolutionTest.kt
index c2e09b6e1..1318617b0 100644
--- a/src/test/kotlin/g1501_1600/s1583_count_unhappy_friends/SolutionTest.kt
+++ b/src/test/kotlin/g1501_1600/s1583_count_unhappy_friends/SolutionTest.kt
@@ -13,10 +13,11 @@ internal class SolutionTest {
                     4,
                     arrayOf(intArrayOf(1, 2, 3), intArrayOf(3, 2, 0), intArrayOf(3, 1, 0), intArrayOf(1, 2, 0)),
                     arrayOf(
-                        intArrayOf(0, 1), intArrayOf(2, 3)
-                    )
+                        intArrayOf(0, 1),
+                        intArrayOf(2, 3),
+                    ),
                 ),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -24,7 +25,7 @@ internal class SolutionTest {
     fun unhappyFriends2() {
         assertThat(
             Solution().unhappyFriends(2, arrayOf(intArrayOf(1), intArrayOf(0)), arrayOf(intArrayOf(1, 0))),
-            equalTo(0)
+            equalTo(0),
         )
     }
 
@@ -36,10 +37,11 @@ internal class SolutionTest {
                     4,
                     arrayOf(intArrayOf(1, 3, 2), intArrayOf(2, 3, 0), intArrayOf(1, 3, 0), intArrayOf(0, 2, 1)),
                     arrayOf(
-                        intArrayOf(1, 3), intArrayOf(0, 2)
-                    )
+                        intArrayOf(1, 3),
+                        intArrayOf(0, 2),
+                    ),
                 ),
-            equalTo(4)
+            equalTo(4),
         )
     }
 }
diff --git a/src/test/kotlin/g1501_1600/s1584_min_cost_to_connect_all_points/SolutionTest.kt b/src/test/kotlin/g1501_1600/s1584_min_cost_to_connect_all_points/SolutionTest.kt
index 6f91dfe85..a2eb3685e 100644
--- a/src/test/kotlin/g1501_1600/s1584_min_cost_to_connect_all_points/SolutionTest.kt
+++ b/src/test/kotlin/g1501_1600/s1584_min_cost_to_connect_all_points/SolutionTest.kt
@@ -15,10 +15,10 @@ internal class SolutionTest {
                         intArrayOf(2, 2),
                         intArrayOf(3, 10),
                         intArrayOf(5, 2),
-                        intArrayOf(7, 0)
-                    )
+                        intArrayOf(7, 0),
+                    ),
                 ),
-            equalTo(20)
+            equalTo(20),
         )
     }
 
@@ -26,7 +26,7 @@ internal class SolutionTest {
     fun minCostConnectPoints2() {
         assertThat(
             Solution().minCostConnectPoints(arrayOf(intArrayOf(3, 12), intArrayOf(-2, 5), intArrayOf(-4, 1))),
-            equalTo(18)
+            equalTo(18),
         )
     }
 }
diff --git a/src/test/kotlin/g1501_1600/s1587_bank_account_summary_ii/MysqlTest.kt b/src/test/kotlin/g1501_1600/s1587_bank_account_summary_ii/MysqlTest.kt
index e3887aa4d..8ca55de15 100644
--- a/src/test/kotlin/g1501_1600/s1587_bank_account_summary_ii/MysqlTest.kt
+++ b/src/test/kotlin/g1501_1600/s1587_bank_account_summary_ii/MysqlTest.kt
@@ -35,8 +35,8 @@ import javax.sql.DataSource
             "INSERT INTO Transactions(trans_id, account, amount, transacted_on)" +
             " VALUES (6, 900003, 6000, '2020-09-07'); " +
             "INSERT INTO Transactions(trans_id, account, amount, transacted_on)" +
-            " VALUES (7, 900003, -4000, '2020-09-11'); "
-    ]
+            " VALUES (7, 900003, -4000, '2020-09-11'); ",
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -48,12 +48,12 @@ internal class MysqlTest {
                     BufferedReader(
                         FileReader(
                             "src/main/kotlin/g1501_1600/s1587_bank_" +
-                                "account_summary_ii/script.sql"
-                        )
+                                "account_summary_ii/script.sql",
+                        ),
                     )
                         .lines()
                         .collect(Collectors.joining("\n"))
-                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace("#.*?\\r?\\n".toRegex(), ""),
                 ).use { resultSet ->
                     assertThat(resultSet.next(), equalTo(true))
                     assertThat(resultSet.getNString(1), equalTo("Alice"))
diff --git a/src/test/kotlin/g1501_1600/s1589_maximum_sum_obtained_of_any_permutation/SolutionTest.kt b/src/test/kotlin/g1501_1600/s1589_maximum_sum_obtained_of_any_permutation/SolutionTest.kt
index 05f4eee12..92a34cece 100644
--- a/src/test/kotlin/g1501_1600/s1589_maximum_sum_obtained_of_any_permutation/SolutionTest.kt
+++ b/src/test/kotlin/g1501_1600/s1589_maximum_sum_obtained_of_any_permutation/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .maxSumRangeQuery(intArrayOf(1, 2, 3, 4, 5), arrayOf(intArrayOf(1, 3), intArrayOf(0, 1))),
-            equalTo(19)
+            equalTo(19),
         )
     }
 
@@ -18,7 +18,7 @@ internal class SolutionTest {
     fun maxSumRangeQuery2() {
         assertThat(
             Solution().maxSumRangeQuery(intArrayOf(1, 2, 3, 4, 5, 6), arrayOf(intArrayOf(0, 1))),
-            equalTo(11)
+            equalTo(11),
         )
     }
 }
diff --git a/src/test/kotlin/g1501_1600/s1591_strange_printer_ii/SolutionTest.kt b/src/test/kotlin/g1501_1600/s1591_strange_printer_ii/SolutionTest.kt
index b4badf7f2..467475271 100644
--- a/src/test/kotlin/g1501_1600/s1591_strange_printer_ii/SolutionTest.kt
+++ b/src/test/kotlin/g1501_1600/s1591_strange_printer_ii/SolutionTest.kt
@@ -14,10 +14,10 @@ internal class SolutionTest {
                         intArrayOf(1, 1, 1, 1),
                         intArrayOf(1, 2, 2, 1),
                         intArrayOf(1, 2, 2, 1),
-                        intArrayOf(1, 1, 1, 1)
-                    )
+                        intArrayOf(1, 1, 1, 1),
+                    ),
                 ),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
@@ -30,10 +30,10 @@ internal class SolutionTest {
                         intArrayOf(1, 1, 1, 1),
                         intArrayOf(1, 1, 3, 3),
                         intArrayOf(1, 1, 3, 4),
-                        intArrayOf(5, 5, 1, 4)
-                    )
+                        intArrayOf(5, 5, 1, 4),
+                    ),
                 ),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
@@ -41,7 +41,7 @@ internal class SolutionTest {
     fun isPrintable3() {
         assertThat(
             Solution().isPrintable(arrayOf(intArrayOf(1, 2, 1), intArrayOf(2, 1, 2), intArrayOf(1, 2, 1))),
-            equalTo(false)
+            equalTo(false),
         )
     }
 }
diff --git a/src/test/kotlin/g1501_1600/s1592_rearrange_spaces_between_words/SolutionTest.kt b/src/test/kotlin/g1501_1600/s1592_rearrange_spaces_between_words/SolutionTest.kt
index 1dcb179eb..575a444bd 100644
--- a/src/test/kotlin/g1501_1600/s1592_rearrange_spaces_between_words/SolutionTest.kt
+++ b/src/test/kotlin/g1501_1600/s1592_rearrange_spaces_between_words/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun reorderSpaces() {
         assertThat(
             Solution().reorderSpaces("  this   is  a sentence "),
-            equalTo("this   is   a   sentence")
+            equalTo("this   is   a   sentence"),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun reorderSpaces2() {
         assertThat(
             Solution().reorderSpaces(" practice   makes   perfect"),
-            equalTo("practice   makes   perfect ")
+            equalTo("practice   makes   perfect "),
         )
     }
 }
diff --git a/src/test/kotlin/g1501_1600/s1594_maximum_non_negative_product_in_a_matrix/SolutionTest.kt b/src/test/kotlin/g1501_1600/s1594_maximum_non_negative_product_in_a_matrix/SolutionTest.kt
index 488d59908..d556aa93d 100644
--- a/src/test/kotlin/g1501_1600/s1594_maximum_non_negative_product_in_a_matrix/SolutionTest.kt
+++ b/src/test/kotlin/g1501_1600/s1594_maximum_non_negative_product_in_a_matrix/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .maxProductPath(arrayOf(intArrayOf(-1, -2, -3), intArrayOf(-2, -3, -3), intArrayOf(-3, -3, -2))),
-            equalTo(-1)
+            equalTo(-1),
         )
     }
 
@@ -18,7 +18,7 @@ internal class SolutionTest {
     fun maxProductPath2() {
         assertThat(
             Solution().maxProductPath(arrayOf(intArrayOf(1, -2, 1), intArrayOf(1, -2, 1), intArrayOf(3, -4, 1))),
-            equalTo(8)
+            equalTo(8),
         )
     }
 
@@ -26,7 +26,7 @@ internal class SolutionTest {
     fun maxProductPath3() {
         assertThat(
             Solution().maxProductPath(arrayOf(intArrayOf(1, 3), intArrayOf(0, -4))),
-            equalTo(0)
+            equalTo(0),
         )
     }
 }
diff --git a/src/test/kotlin/g1501_1600/s1595_minimum_cost_to_connect_two_groups_of_points/SolutionTest.kt b/src/test/kotlin/g1501_1600/s1595_minimum_cost_to_connect_two_groups_of_points/SolutionTest.kt
index cfad09184..642fc0fb6 100644
--- a/src/test/kotlin/g1501_1600/s1595_minimum_cost_to_connect_two_groups_of_points/SolutionTest.kt
+++ b/src/test/kotlin/g1501_1600/s1595_minimum_cost_to_connect_two_groups_of_points/SolutionTest.kt
@@ -11,7 +11,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .connectTwoGroups(getLists(arrayOf(intArrayOf(15, 96), intArrayOf(36, 2)))),
-            equalTo(17)
+            equalTo(17),
         )
     }
 
@@ -20,9 +20,9 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .connectTwoGroups(
-                    getLists(arrayOf(intArrayOf(1, 3, 5), intArrayOf(4, 1, 1), intArrayOf(1, 5, 3)))
+                    getLists(arrayOf(intArrayOf(1, 3, 5), intArrayOf(4, 1, 1), intArrayOf(1, 5, 3))),
                 ),
-            equalTo(4)
+            equalTo(4),
         )
     }
 
@@ -37,11 +37,11 @@ internal class SolutionTest {
                             intArrayOf(3, 4, 7),
                             intArrayOf(8, 1, 2),
                             intArrayOf(6, 2, 4),
-                            intArrayOf(3, 8, 8)
-                        )
-                    )
+                            intArrayOf(3, 8, 8),
+                        ),
+                    ),
                 ),
-            equalTo(10)
+            equalTo(10),
         )
     }
 }
diff --git a/src/test/kotlin/g1501_1600/s1598_crawler_log_folder/SolutionTest.kt b/src/test/kotlin/g1501_1600/s1598_crawler_log_folder/SolutionTest.kt
index 4a4938577..ec96e6605 100644
--- a/src/test/kotlin/g1501_1600/s1598_crawler_log_folder/SolutionTest.kt
+++ b/src/test/kotlin/g1501_1600/s1598_crawler_log_folder/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun minOperations() {
         assertThat(
             Solution().minOperations(arrayOf("d1/", "d2/", "../", "d21/", "./")),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -18,7 +18,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .minOperations(arrayOf("d1/", "d2/", "./", "d3/", "../", "d31/")),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
@@ -26,7 +26,7 @@ internal class SolutionTest {
     fun minOperations3() {
         assertThat(
             Solution().minOperations(arrayOf("d1/", "../", "../", "../")),
-            equalTo(0)
+            equalTo(0),
         )
     }
 }
diff --git a/src/test/kotlin/g1501_1600/s1599_maximum_profit_of_operating_a_centennial_wheel/SolutionTest.kt b/src/test/kotlin/g1501_1600/s1599_maximum_profit_of_operating_a_centennial_wheel/SolutionTest.kt
index 95fd4ddce..d5b2a4ae4 100644
--- a/src/test/kotlin/g1501_1600/s1599_maximum_profit_of_operating_a_centennial_wheel/SolutionTest.kt
+++ b/src/test/kotlin/g1501_1600/s1599_maximum_profit_of_operating_a_centennial_wheel/SolutionTest.kt
@@ -19,7 +19,7 @@ internal class SolutionTest {
     fun minOperationsMaxProfit3() {
         assertThat(
             Solution().minOperationsMaxProfit(intArrayOf(3, 4, 0, 5, 1), 1, 92),
-            equalTo(-1)
+            equalTo(-1),
         )
     }
 }
diff --git a/src/test/kotlin/g1501_1600/s1600_throne_inheritance/ThroneInheritanceTest.kt b/src/test/kotlin/g1501_1600/s1600_throne_inheritance/ThroneInheritanceTest.kt
index 788f86c87..c3b58b266 100644
--- a/src/test/kotlin/g1501_1600/s1600_throne_inheritance/ThroneInheritanceTest.kt
+++ b/src/test/kotlin/g1501_1600/s1600_throne_inheritance/ThroneInheritanceTest.kt
@@ -26,9 +26,15 @@ internal class ThroneInheritanceTest {
             t.getInheritanceOrder(),
             equalTo(
                 mutableListOf(
-                    "king", "andy", "matthew", "bob", "alex", "asha", "catherine"
-                )
-            )
+                    "king",
+                    "andy",
+                    "matthew",
+                    "bob",
+                    "alex",
+                    "asha",
+                    "catherine",
+                ),
+            ),
         )
         // order: king > andy > matthew > bob > alex > asha > catherine
         t.death("bob")
@@ -36,7 +42,7 @@ internal class ThroneInheritanceTest {
         t.getInheritanceOrder()
         assertThat(
             t.getInheritanceOrder(),
-            equalTo(mutableListOf("king", "andy", "matthew", "alex", "asha", "catherine"))
+            equalTo(mutableListOf("king", "andy", "matthew", "alex", "asha", "catherine")),
         )
     }
 }
diff --git a/src/test/kotlin/g1601_1700/s1601_maximum_number_of_achievable_transfer_requests/SolutionTest.kt b/src/test/kotlin/g1601_1700/s1601_maximum_number_of_achievable_transfer_requests/SolutionTest.kt
index 9eddbf3f9..6a7235be0 100644
--- a/src/test/kotlin/g1601_1700/s1601_maximum_number_of_achievable_transfer_requests/SolutionTest.kt
+++ b/src/test/kotlin/g1601_1700/s1601_maximum_number_of_achievable_transfer_requests/SolutionTest.kt
@@ -17,10 +17,10 @@ internal class SolutionTest {
                         intArrayOf(0, 1),
                         intArrayOf(1, 2),
                         intArrayOf(2, 0),
-                        intArrayOf(3, 4)
-                    )
+                        intArrayOf(3, 4),
+                    ),
                 ),
-            equalTo(5)
+            equalTo(5),
         )
     }
 
@@ -28,7 +28,7 @@ internal class SolutionTest {
     fun maximumRequests2() {
         assertThat(
             Solution().maximumRequests(3, arrayOf(intArrayOf(0, 0), intArrayOf(1, 2), intArrayOf(2, 1))),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
@@ -37,9 +37,9 @@ internal class SolutionTest {
         assertThat(
             Solution().maximumRequests(
                 4,
-                arrayOf(intArrayOf(0, 3), intArrayOf(3, 1), intArrayOf(1, 2), intArrayOf(2, 0))
+                arrayOf(intArrayOf(0, 3), intArrayOf(3, 1), intArrayOf(1, 2), intArrayOf(2, 0)),
             ),
-            equalTo(4)
+            equalTo(4),
         )
     }
 }
diff --git a/src/test/kotlin/g1601_1700/s1604_alert_using_same_key_card_three_or_more_times_in_a_one_hour_period/SolutionTest.kt b/src/test/kotlin/g1601_1700/s1604_alert_using_same_key_card_three_or_more_times_in_a_one_hour_period/SolutionTest.kt
index 14dd65b0d..0cce323bf 100644
--- a/src/test/kotlin/g1601_1700/s1604_alert_using_same_key_card_three_or_more_times_in_a_one_hour_period/SolutionTest.kt
+++ b/src/test/kotlin/g1601_1700/s1604_alert_using_same_key_card_three_or_more_times_in_a_one_hour_period/SolutionTest.kt
@@ -11,13 +11,25 @@ internal class SolutionTest {
             Solution()
                 .alertNames(
                     arrayOf(
-                        "daniel", "daniel", "daniel", "luis", "luis", "luis", "luis"
+                        "daniel",
+                        "daniel",
+                        "daniel",
+                        "luis",
+                        "luis",
+                        "luis",
+                        "luis",
                     ),
                     arrayOf(
-                        "10:00", "10:40", "11:00", "09:00", "11:00", "13:00", "15:00"
-                    )
+                        "10:00",
+                        "10:40",
+                        "11:00",
+                        "09:00",
+                        "11:00",
+                        "13:00",
+                        "15:00",
+                    ),
                 ),
-            equalTo(listOf("daniel"))
+            equalTo(listOf("daniel")),
         )
     }
 
@@ -27,13 +39,25 @@ internal class SolutionTest {
             Solution()
                 .alertNames(
                     arrayOf(
-                        "alice", "alice", "alice", "bob", "bob", "bob", "bob"
+                        "alice",
+                        "alice",
+                        "alice",
+                        "bob",
+                        "bob",
+                        "bob",
+                        "bob",
                     ),
                     arrayOf(
-                        "12:01", "12:00", "18:00", "21:00", "21:20", "21:30", "23:00"
-                    )
+                        "12:01",
+                        "12:00",
+                        "18:00",
+                        "21:00",
+                        "21:20",
+                        "21:30",
+                        "23:00",
+                    ),
                 ),
-            equalTo(listOf("bob"))
+            equalTo(listOf("bob")),
         )
     }
 }
diff --git a/src/test/kotlin/g1601_1700/s1605_find_valid_matrix_given_row_and_column_sums/SolutionTest.kt b/src/test/kotlin/g1601_1700/s1605_find_valid_matrix_given_row_and_column_sums/SolutionTest.kt
index 6d21ebc29..76ab32ef6 100644
--- a/src/test/kotlin/g1601_1700/s1605_find_valid_matrix_given_row_and_column_sums/SolutionTest.kt
+++ b/src/test/kotlin/g1601_1700/s1605_find_valid_matrix_given_row_and_column_sums/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun restoreMatrix() {
         assertThat(
             Solution().restoreMatrix(intArrayOf(3, 8), intArrayOf(4, 7)),
-            equalTo(arrayOf(intArrayOf(3, 0), intArrayOf(1, 7)))
+            equalTo(arrayOf(intArrayOf(3, 0), intArrayOf(1, 7))),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun restoreMatrix2() {
         assertThat(
             Solution().restoreMatrix(intArrayOf(5, 7, 10), intArrayOf(8, 6, 8)),
-            equalTo(arrayOf(intArrayOf(5, 0, 0), intArrayOf(3, 4, 0), intArrayOf(0, 2, 8)))
+            equalTo(arrayOf(intArrayOf(5, 0, 0), intArrayOf(3, 4, 0), intArrayOf(0, 2, 8))),
         )
     }
 }
diff --git a/src/test/kotlin/g1601_1700/s1606_find_servers_that_handled_most_number_of_requests/SolutionTest.kt b/src/test/kotlin/g1601_1700/s1606_find_servers_that_handled_most_number_of_requests/SolutionTest.kt
index d6b1314fe..ae5cdac35 100644
--- a/src/test/kotlin/g1601_1700/s1606_find_servers_that_handled_most_number_of_requests/SolutionTest.kt
+++ b/src/test/kotlin/g1601_1700/s1606_find_servers_that_handled_most_number_of_requests/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .busiestServers(3, intArrayOf(1, 2, 3, 4, 5), intArrayOf(5, 2, 3, 3, 3)),
-            equalTo(listOf(1))
+            equalTo(listOf(1)),
         )
     }
 
@@ -18,7 +18,7 @@ internal class SolutionTest {
     fun busiestServers2() {
         assertThat(
             Solution().busiestServers(3, intArrayOf(1, 2, 3, 4), intArrayOf(1, 2, 1, 2)),
-            equalTo(listOf(0))
+            equalTo(listOf(0)),
         )
     }
 
@@ -26,7 +26,7 @@ internal class SolutionTest {
     fun busiestServers3() {
         assertThat(
             Solution().busiestServers(3, intArrayOf(1, 2, 3), intArrayOf(10, 12, 11)),
-            equalTo(mutableListOf(0, 1, 2))
+            equalTo(mutableListOf(0, 1, 2)),
         )
     }
 }
diff --git a/src/test/kotlin/g1601_1700/s1610_maximum_number_of_visible_points/SolutionTest.kt b/src/test/kotlin/g1601_1700/s1610_maximum_number_of_visible_points/SolutionTest.kt
index 2a1505e0c..c48d3ce64 100644
--- a/src/test/kotlin/g1601_1700/s1610_maximum_number_of_visible_points/SolutionTest.kt
+++ b/src/test/kotlin/g1601_1700/s1610_maximum_number_of_visible_points/SolutionTest.kt
@@ -13,12 +13,12 @@ internal class SolutionTest {
                     listOf(
                         listOf(2, 1),
                         listOf(2, 2),
-                        listOf(2, 3)
+                        listOf(2, 3),
                     ),
                     90,
-                    listOf(1, 1)
+                    listOf(1, 1),
                 ),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
@@ -31,12 +31,12 @@ internal class SolutionTest {
                         listOf(2, 1),
                         listOf(2, 2),
                         listOf(3, 4),
-                        listOf(1, 1)
+                        listOf(1, 1),
                     ),
                     90,
-                    listOf(1, 1)
+                    listOf(1, 1),
                 ),
-            equalTo(4)
+            equalTo(4),
         )
     }
 
@@ -47,9 +47,9 @@ internal class SolutionTest {
                 .visiblePoints(
                     listOf(listOf(1, 0), listOf(2, 1)),
                     13,
-                    listOf(1, 1)
+                    listOf(1, 1),
                 ),
-            equalTo(1)
+            equalTo(1),
         )
     }
 }
diff --git a/src/test/kotlin/g1601_1700/s1615_maximal_network_rank/SolutionTest.kt b/src/test/kotlin/g1601_1700/s1615_maximal_network_rank/SolutionTest.kt
index 6443e4838..42e2dc48e 100644
--- a/src/test/kotlin/g1601_1700/s1615_maximal_network_rank/SolutionTest.kt
+++ b/src/test/kotlin/g1601_1700/s1615_maximal_network_rank/SolutionTest.kt
@@ -10,9 +10,9 @@ internal class SolutionTest {
         assertThat(
             Solution().maximalNetworkRank(
                 4,
-                arrayOf(intArrayOf(2, 1), intArrayOf(0, 3), intArrayOf(1, 2), intArrayOf(1, 3))
+                arrayOf(intArrayOf(2, 1), intArrayOf(0, 3), intArrayOf(1, 2), intArrayOf(1, 3)),
             ),
-            equalTo(4)
+            equalTo(4),
         )
     }
 
@@ -28,10 +28,10 @@ internal class SolutionTest {
                         intArrayOf(2, 3),
                         intArrayOf(2, 4),
                         intArrayOf(5, 6),
-                        intArrayOf(5, 7)
-                    )
+                        intArrayOf(5, 7),
+                    ),
                 ),
-            equalTo(5)
+            equalTo(5),
         )
     }
 
@@ -47,10 +47,10 @@ internal class SolutionTest {
                         intArrayOf(1, 2),
                         intArrayOf(1, 3),
                         intArrayOf(2, 3),
-                        intArrayOf(2, 4)
-                    )
+                        intArrayOf(2, 4),
+                    ),
                 ),
-            equalTo(5)
+            equalTo(5),
         )
     }
 }
diff --git a/src/test/kotlin/g1601_1700/s1617_count_subtrees_with_max_distance_between_cities/SolutionTest.kt b/src/test/kotlin/g1601_1700/s1617_count_subtrees_with_max_distance_between_cities/SolutionTest.kt
index 74f70bb7f..c9f81c14b 100644
--- a/src/test/kotlin/g1601_1700/s1617_count_subtrees_with_max_distance_between_cities/SolutionTest.kt
+++ b/src/test/kotlin/g1601_1700/s1617_count_subtrees_with_max_distance_between_cities/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .countSubgraphsForEachDiameter(4, arrayOf(intArrayOf(1, 2), intArrayOf(2, 3), intArrayOf(2, 4))),
-            equalTo(intArrayOf(3, 4, 0))
+            equalTo(intArrayOf(3, 4, 0)),
         )
     }
 
@@ -18,7 +18,7 @@ internal class SolutionTest {
     fun countSubgraphsForEachDiameter2() {
         assertThat(
             Solution().countSubgraphsForEachDiameter(2, arrayOf(intArrayOf(1, 2))),
-            equalTo(intArrayOf(1))
+            equalTo(intArrayOf(1)),
         )
     }
 
@@ -26,7 +26,7 @@ internal class SolutionTest {
     fun countSubgraphsForEachDiameter3() {
         assertThat(
             Solution().countSubgraphsForEachDiameter(3, arrayOf(intArrayOf(1, 2), intArrayOf(2, 3))),
-            equalTo(intArrayOf(2, 1))
+            equalTo(intArrayOf(2, 1)),
         )
     }
 }
diff --git a/src/test/kotlin/g1601_1700/s1619_mean_of_array_after_removing_some_elements/SolutionTest.kt b/src/test/kotlin/g1601_1700/s1619_mean_of_array_after_removing_some_elements/SolutionTest.kt
index a9cedae84..706eba4d9 100644
--- a/src/test/kotlin/g1601_1700/s1619_mean_of_array_after_removing_some_elements/SolutionTest.kt
+++ b/src/test/kotlin/g1601_1700/s1619_mean_of_array_after_removing_some_elements/SolutionTest.kt
@@ -11,10 +11,10 @@ internal class SolutionTest {
             Solution()
                 .trimMean(
                     intArrayOf(
-                        1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3
-                    )
+                        1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3,
+                    ),
                 ),
-            equalTo(2.00)
+            equalTo(2.00),
         )
     }
 
@@ -24,10 +24,10 @@ internal class SolutionTest {
             Solution()
                 .trimMean(
                     intArrayOf(
-                        6, 2, 7, 5, 1, 2, 0, 3, 10, 2, 5, 0, 5, 5, 0, 8, 7, 6, 8, 0
-                    )
+                        6, 2, 7, 5, 1, 2, 0, 3, 10, 2, 5, 0, 5, 5, 0, 8, 7, 6, 8, 0,
+                    ),
                 ),
-            equalTo(4.00)
+            equalTo(4.00),
         )
     }
 
@@ -38,10 +38,10 @@ internal class SolutionTest {
                 .trimMean(
                     intArrayOf(
                         6, 0, 7, 0, 7, 5, 7, 8, 3, 4, 0, 7, 8, 1, 6, 8, 1, 1, 2, 4, 8,
-                        1, 9, 5, 4, 3, 8, 5, 10, 8, 6, 6, 1, 0, 6, 10, 8, 2, 3, 4
-                    )
+                        1, 9, 5, 4, 3, 8, 5, 10, 8, 6, 6, 1, 0, 6, 10, 8, 2, 3, 4,
+                    ),
                 ),
-            equalTo(4.777777777777778)
+            equalTo(4.777777777777778),
         )
     }
 }
diff --git a/src/test/kotlin/g1601_1700/s1620_coordinate_with_maximum_network_quality/SolutionTest.kt b/src/test/kotlin/g1601_1700/s1620_coordinate_with_maximum_network_quality/SolutionTest.kt
index 8e64d99f5..e2b718000 100644
--- a/src/test/kotlin/g1601_1700/s1620_coordinate_with_maximum_network_quality/SolutionTest.kt
+++ b/src/test/kotlin/g1601_1700/s1620_coordinate_with_maximum_network_quality/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun bestCoordinate() {
         assertThat(
             Solution().bestCoordinate(arrayOf(intArrayOf(1, 2, 5), intArrayOf(2, 1, 7), intArrayOf(3, 1, 9)), 2),
-            equalTo(intArrayOf(2, 1))
+            equalTo(intArrayOf(2, 1)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun bestCoordinate2() {
         assertThat(
             Solution().bestCoordinate(arrayOf(intArrayOf(23, 11, 21)), 9),
-            equalTo(intArrayOf(23, 11))
+            equalTo(intArrayOf(23, 11)),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun bestCoordinate3() {
         assertThat(
             Solution().bestCoordinate(arrayOf(intArrayOf(1, 2, 13), intArrayOf(2, 1, 7), intArrayOf(0, 1, 9)), 2),
-            equalTo(intArrayOf(1, 2))
+            equalTo(intArrayOf(1, 2)),
         )
     }
 }
diff --git a/src/test/kotlin/g1601_1700/s1626_best_team_with_no_conflicts/SolutionTest.kt b/src/test/kotlin/g1601_1700/s1626_best_team_with_no_conflicts/SolutionTest.kt
index 1a177b180..436cec154 100644
--- a/src/test/kotlin/g1601_1700/s1626_best_team_with_no_conflicts/SolutionTest.kt
+++ b/src/test/kotlin/g1601_1700/s1626_best_team_with_no_conflicts/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .bestTeamScore(intArrayOf(1, 3, 5, 10, 15), intArrayOf(1, 2, 3, 4, 5)),
-            equalTo(34)
+            equalTo(34),
         )
     }
 
@@ -18,7 +18,7 @@ internal class SolutionTest {
     fun bestTeamScore2() {
         assertThat(
             Solution().bestTeamScore(intArrayOf(4, 5, 6, 5), intArrayOf(2, 1, 2, 1)),
-            equalTo(16)
+            equalTo(16),
         )
     }
 
@@ -26,7 +26,7 @@ internal class SolutionTest {
     fun bestTeamScore3() {
         assertThat(
             Solution().bestTeamScore(intArrayOf(1, 2, 3, 5), intArrayOf(8, 9, 10, 1)),
-            equalTo(6)
+            equalTo(6),
         )
     }
 }
diff --git a/src/test/kotlin/g1601_1700/s1627_graph_connectivity_with_threshold/SolutionTest.kt b/src/test/kotlin/g1601_1700/s1627_graph_connectivity_with_threshold/SolutionTest.kt
index d27f34318..482c40ac3 100644
--- a/src/test/kotlin/g1601_1700/s1627_graph_connectivity_with_threshold/SolutionTest.kt
+++ b/src/test/kotlin/g1601_1700/s1627_graph_connectivity_with_threshold/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun areConnected() {
         assertThat(
             Solution().areConnected(6, 2, arrayOf(intArrayOf(1, 4), intArrayOf(2, 5), intArrayOf(3, 6))),
-            equalTo(listOf(false, false, true))
+            equalTo(listOf(false, false, true)),
         )
     }
 
@@ -20,9 +20,9 @@ internal class SolutionTest {
                 .areConnected(
                     6,
                     0,
-                    arrayOf(intArrayOf(4, 5), intArrayOf(3, 4), intArrayOf(3, 2), intArrayOf(2, 6), intArrayOf(1, 3))
+                    arrayOf(intArrayOf(4, 5), intArrayOf(3, 4), intArrayOf(3, 2), intArrayOf(2, 6), intArrayOf(1, 3)),
                 ),
-            equalTo(listOf(true, true, true, true, true))
+            equalTo(listOf(true, true, true, true, true)),
         )
     }
 
@@ -33,9 +33,9 @@ internal class SolutionTest {
                 .areConnected(
                     5,
                     1,
-                    arrayOf(intArrayOf(4, 5), intArrayOf(4, 5), intArrayOf(3, 2), intArrayOf(2, 3), intArrayOf(3, 4))
+                    arrayOf(intArrayOf(4, 5), intArrayOf(4, 5), intArrayOf(3, 2), intArrayOf(2, 3), intArrayOf(3, 4)),
                 ),
-            equalTo(listOf(false, false, false, false, false))
+            equalTo(listOf(false, false, false, false, false)),
         )
     }
 }
diff --git a/src/test/kotlin/g1601_1700/s1629_slowest_key/SolutionTest.kt b/src/test/kotlin/g1601_1700/s1629_slowest_key/SolutionTest.kt
index f7d3d454f..715185ec8 100644
--- a/src/test/kotlin/g1601_1700/s1629_slowest_key/SolutionTest.kt
+++ b/src/test/kotlin/g1601_1700/s1629_slowest_key/SolutionTest.kt
@@ -13,7 +13,8 @@ internal class SolutionTest {
     @Test
     fun slowestKey2() {
         assertThat(
-            Solution().slowestKey(intArrayOf(12, 23, 36, 46, 62), "spuda"), equalTo('a')
+            Solution().slowestKey(intArrayOf(12, 23, 36, 46, 62), "spuda"),
+            equalTo('a'),
         )
     }
 }
diff --git a/src/test/kotlin/g1601_1700/s1630_arithmetic_subarrays/SolutionTest.kt b/src/test/kotlin/g1601_1700/s1630_arithmetic_subarrays/SolutionTest.kt
index c3186b6cc..618aaabad 100644
--- a/src/test/kotlin/g1601_1700/s1630_arithmetic_subarrays/SolutionTest.kt
+++ b/src/test/kotlin/g1601_1700/s1630_arithmetic_subarrays/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .checkArithmeticSubarrays(intArrayOf(4, 6, 5, 9, 3, 7), intArrayOf(0, 0, 2), intArrayOf(2, 3, 5)),
-            equalTo(listOf(true, false, true))
+            equalTo(listOf(true, false, true)),
         )
     }
 
@@ -21,9 +21,9 @@ internal class SolutionTest {
                 .checkArithmeticSubarrays(
                     intArrayOf(-12, -9, -3, -12, -6, 15, 20, -25, -20, -15, -10),
                     intArrayOf(0, 1, 6, 4, 8, 7),
-                    intArrayOf(4, 4, 9, 7, 9, 10)
+                    intArrayOf(4, 4, 9, 7, 9, 10),
                 ),
-            equalTo(listOf(false, true, false, false, true, true))
+            equalTo(listOf(false, true, false, false, true, true)),
         )
     }
 }
diff --git a/src/test/kotlin/g1601_1700/s1631_path_with_minimum_effort/SolutionTest.kt b/src/test/kotlin/g1601_1700/s1631_path_with_minimum_effort/SolutionTest.kt
index b20a7b4a9..f9fd3a2f3 100644
--- a/src/test/kotlin/g1601_1700/s1631_path_with_minimum_effort/SolutionTest.kt
+++ b/src/test/kotlin/g1601_1700/s1631_path_with_minimum_effort/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun minimumEffortPath() {
         assertThat(
             Solution().minimumEffortPath(arrayOf(intArrayOf(1, 2, 2), intArrayOf(3, 8, 2), intArrayOf(5, 3, 5))),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun minimumEffortPath2() {
         assertThat(
             Solution().minimumEffortPath(arrayOf(intArrayOf(1, 2, 3), intArrayOf(3, 8, 4), intArrayOf(5, 3, 5))),
-            equalTo(1)
+            equalTo(1),
         )
     }
 
@@ -31,10 +31,10 @@ internal class SolutionTest {
                         intArrayOf(1, 2, 1, 2, 1),
                         intArrayOf(1, 2, 1, 2, 1),
                         intArrayOf(1, 2, 1, 2, 1),
-                        intArrayOf(1, 1, 1, 2, 1)
-                    )
+                        intArrayOf(1, 1, 1, 2, 1),
+                    ),
                 ),
-            equalTo(0)
+            equalTo(0),
         )
     }
 }
diff --git a/src/test/kotlin/g1601_1700/s1632_rank_transform_of_a_matrix/SolutionTest.kt b/src/test/kotlin/g1601_1700/s1632_rank_transform_of_a_matrix/SolutionTest.kt
index 085559d7d..782e4e040 100644
--- a/src/test/kotlin/g1601_1700/s1632_rank_transform_of_a_matrix/SolutionTest.kt
+++ b/src/test/kotlin/g1601_1700/s1632_rank_transform_of_a_matrix/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun matrixRankTransform() {
         assertThat(
             Solution().matrixRankTransform(arrayOf(intArrayOf(1, 2), intArrayOf(3, 4))),
-            equalTo(arrayOf(intArrayOf(1, 2), intArrayOf(2, 3)))
+            equalTo(arrayOf(intArrayOf(1, 2), intArrayOf(2, 3))),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun matrixRankTransform2() {
         assertThat(
             Solution().matrixRankTransform(arrayOf(intArrayOf(7, 7), intArrayOf(7, 7))),
-            equalTo(arrayOf(intArrayOf(1, 1), intArrayOf(1, 1)))
+            equalTo(arrayOf(intArrayOf(1, 1), intArrayOf(1, 1))),
         )
     }
 
@@ -30,17 +30,17 @@ internal class SolutionTest {
                         intArrayOf(20, -21, 14),
                         intArrayOf(-19, 4, 19),
                         intArrayOf(22, -47, 24),
-                        intArrayOf(-19, 4, 19)
-                    )
+                        intArrayOf(-19, 4, 19),
+                    ),
                 ),
             equalTo(
                 arrayOf(
                     intArrayOf(4, 2, 3),
                     intArrayOf(1, 3, 4),
                     intArrayOf(5, 1, 6),
-                    intArrayOf(1, 3, 4)
-                )
-            )
+                    intArrayOf(1, 3, 4),
+                ),
+            ),
         )
     }
 }
diff --git a/src/test/kotlin/g1601_1700/s1633_percentage_of_users_attended_a_contest/MysqlTest.kt b/src/test/kotlin/g1601_1700/s1633_percentage_of_users_attended_a_contest/MysqlTest.kt
index 0bd6bd9b0..3ca3c96a2 100644
--- a/src/test/kotlin/g1601_1700/s1633_percentage_of_users_attended_a_contest/MysqlTest.kt
+++ b/src/test/kotlin/g1601_1700/s1633_percentage_of_users_attended_a_contest/MysqlTest.kt
@@ -32,8 +32,8 @@ import javax.sql.DataSource
             "INSERT INTO Register (contest_id, user_id) VALUES (208, 7); " +
             "INSERT INTO Register (contest_id, user_id) VALUES (210, 2); " +
             "INSERT INTO Register (contest_id, user_id) VALUES (207, 2); " +
-            "INSERT INTO Register (contest_id, user_id) VALUES (210, 7); "
-    ]
+            "INSERT INTO Register (contest_id, user_id) VALUES (210, 7); ",
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -44,12 +44,12 @@ internal class MysqlTest {
                 statement.executeQuery(
                     BufferedReader(
                         FileReader(
-                            "src/main/kotlin/g1601_1700/s1633_percentage_of_users_attended_a_contest/script.sql"
-                        )
+                            "src/main/kotlin/g1601_1700/s1633_percentage_of_users_attended_a_contest/script.sql",
+                        ),
                     )
                         .lines()
                         .collect(Collectors.joining("\n"))
-                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace("#.*?\\r?\\n".toRegex(), ""),
                 ).use { resultSet ->
                     assertThat(resultSet.next(), equalTo(true))
                     assertThat(resultSet.getInt(1), equalTo(208))
diff --git a/src/test/kotlin/g1601_1700/s1636_sort_array_by_increasing_frequency/SolutionTest.kt b/src/test/kotlin/g1601_1700/s1636_sort_array_by_increasing_frequency/SolutionTest.kt
index f402502ff..4711e75db 100644
--- a/src/test/kotlin/g1601_1700/s1636_sort_array_by_increasing_frequency/SolutionTest.kt
+++ b/src/test/kotlin/g1601_1700/s1636_sort_array_by_increasing_frequency/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun frequencySort() {
         assertThat(
             Solution().frequencySort(intArrayOf(1, 1, 2, 2, 2, 3)),
-            equalTo(intArrayOf(3, 1, 1, 2, 2, 2))
+            equalTo(intArrayOf(3, 1, 1, 2, 2, 2)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun frequencySort2() {
         assertThat(
             Solution().frequencySort(intArrayOf(2, 3, 1, 3, 2)),
-            equalTo(intArrayOf(1, 3, 3, 2, 2))
+            equalTo(intArrayOf(1, 3, 3, 2, 2)),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun frequencySort3() {
         assertThat(
             Solution().frequencySort(intArrayOf(-1, 1, -6, 4, 5, -6, 1, 4, 1)),
-            equalTo(intArrayOf(5, -1, 4, 4, -6, -6, 1, 1, 1))
+            equalTo(intArrayOf(5, -1, 4, 4, -6, -6, 1, 1, 1)),
         )
     }
 }
diff --git a/src/test/kotlin/g1601_1700/s1637_widest_vertical_area_between_two_points_containing_no_points/SolutionTest.kt b/src/test/kotlin/g1601_1700/s1637_widest_vertical_area_between_two_points_containing_no_points/SolutionTest.kt
index eb4e37e8d..5556ec09c 100644
--- a/src/test/kotlin/g1601_1700/s1637_widest_vertical_area_between_two_points_containing_no_points/SolutionTest.kt
+++ b/src/test/kotlin/g1601_1700/s1637_widest_vertical_area_between_two_points_containing_no_points/SolutionTest.kt
@@ -13,10 +13,10 @@ internal class SolutionTest {
                     intArrayOf(8, 7),
                     intArrayOf(9, 9),
                     intArrayOf(7, 4),
-                    intArrayOf(9, 7)
-                )
+                    intArrayOf(9, 7),
+                ),
             ),
-            equalTo(1)
+            equalTo(1),
         )
     }
 
@@ -31,10 +31,10 @@ internal class SolutionTest {
                         intArrayOf(1, 0),
                         intArrayOf(1, 4),
                         intArrayOf(5, 3),
-                        intArrayOf(8, 8)
-                    )
+                        intArrayOf(8, 8),
+                    ),
                 ),
-            equalTo(3)
+            equalTo(3),
         )
     }
 }
diff --git a/src/test/kotlin/g1601_1700/s1639_number_of_ways_to_form_a_target_string_given_a_dictionary/SolutionTest.kt b/src/test/kotlin/g1601_1700/s1639_number_of_ways_to_form_a_target_string_given_a_dictionary/SolutionTest.kt
index b70f27895..10627db97 100644
--- a/src/test/kotlin/g1601_1700/s1639_number_of_ways_to_form_a_target_string_given_a_dictionary/SolutionTest.kt
+++ b/src/test/kotlin/g1601_1700/s1639_number_of_ways_to_form_a_target_string_given_a_dictionary/SolutionTest.kt
@@ -8,7 +8,8 @@ internal class SolutionTest {
     @Test
     fun numWays() {
         assertThat(
-            Solution().numWays(arrayOf("acca", "bbbb", "caca"), "aba"), equalTo(6)
+            Solution().numWays(arrayOf("acca", "bbbb", "caca"), "aba"),
+            equalTo(6),
         )
     }
 
diff --git a/src/test/kotlin/g1601_1700/s1640_check_array_formation_through_concatenation/SolutionTest.kt b/src/test/kotlin/g1601_1700/s1640_check_array_formation_through_concatenation/SolutionTest.kt
index f096e2a42..2b893a0de 100644
--- a/src/test/kotlin/g1601_1700/s1640_check_array_formation_through_concatenation/SolutionTest.kt
+++ b/src/test/kotlin/g1601_1700/s1640_check_array_formation_through_concatenation/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun canFormArray() {
         assertThat(
             Solution().canFormArray(intArrayOf(15, 88), arrayOf(intArrayOf(88), intArrayOf(15))),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun canFormArray2() {
         assertThat(
             Solution().canFormArray(intArrayOf(49, 18, 16), arrayOf(intArrayOf(16, 18, 49))),
-            equalTo(false)
+            equalTo(false),
         )
     }
 
@@ -26,7 +26,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .canFormArray(intArrayOf(91, 4, 64, 78), arrayOf(intArrayOf(78), intArrayOf(4, 64), intArrayOf(91))),
-            equalTo(true)
+            equalTo(true),
         )
     }
 }
diff --git a/src/test/kotlin/g1601_1700/s1642_furthest_building_you_can_reach/SolutionTest.kt b/src/test/kotlin/g1601_1700/s1642_furthest_building_you_can_reach/SolutionTest.kt
index 68b0e825d..de1bc1947 100644
--- a/src/test/kotlin/g1601_1700/s1642_furthest_building_you_can_reach/SolutionTest.kt
+++ b/src/test/kotlin/g1601_1700/s1642_furthest_building_you_can_reach/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun furthestBuilding() {
         assertThat(
             Solution().furthestBuilding(intArrayOf(4, 2, 7, 6, 9, 14, 12), 5, 1),
-            equalTo(4)
+            equalTo(4),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun furthestBuilding2() {
         assertThat(
             Solution().furthestBuilding(intArrayOf(4, 12, 2, 7, 3, 18, 20, 3, 19), 10, 2),
-            equalTo(7)
+            equalTo(7),
         )
     }
 
diff --git a/src/test/kotlin/g1601_1700/s1649_create_sorted_array_through_instructions/SolutionTest.kt b/src/test/kotlin/g1601_1700/s1649_create_sorted_array_through_instructions/SolutionTest.kt
index 33937b437..ef933ac91 100644
--- a/src/test/kotlin/g1601_1700/s1649_create_sorted_array_through_instructions/SolutionTest.kt
+++ b/src/test/kotlin/g1601_1700/s1649_create_sorted_array_through_instructions/SolutionTest.kt
@@ -19,7 +19,7 @@ internal class SolutionTest {
     fun createSortedArray3() {
         assertThat(
             Solution().createSortedArray(intArrayOf(1, 3, 3, 3, 2, 4, 2, 1, 2)),
-            equalTo(4)
+            equalTo(4),
         )
     }
 }
diff --git a/src/test/kotlin/g1601_1700/s1652_defuse_the_bomb/SolutionTest.kt b/src/test/kotlin/g1601_1700/s1652_defuse_the_bomb/SolutionTest.kt
index 92f7d7a5b..901bd90dc 100644
--- a/src/test/kotlin/g1601_1700/s1652_defuse_the_bomb/SolutionTest.kt
+++ b/src/test/kotlin/g1601_1700/s1652_defuse_the_bomb/SolutionTest.kt
@@ -9,14 +9,15 @@ internal class SolutionTest {
     fun decrypt() {
         assertThat(
             Solution().decrypt(intArrayOf(5, 7, 1, 4), 3),
-            equalTo(intArrayOf(12, 10, 16, 13))
+            equalTo(intArrayOf(12, 10, 16, 13)),
         )
     }
 
     @Test
     fun decrypt2() {
         assertThat(
-            Solution().decrypt(intArrayOf(1, 2, 3, 4), 0), equalTo(intArrayOf(0, 0, 0, 0))
+            Solution().decrypt(intArrayOf(1, 2, 3, 4), 0),
+            equalTo(intArrayOf(0, 0, 0, 0)),
         )
     }
 
@@ -24,7 +25,7 @@ internal class SolutionTest {
     fun decrypt3() {
         assertThat(
             Solution().decrypt(intArrayOf(2, 4, 9, 3), -2),
-            equalTo(intArrayOf(12, 5, 6, 13))
+            equalTo(intArrayOf(12, 5, 6, 13)),
         )
     }
 }
diff --git a/src/test/kotlin/g1601_1700/s1654_minimum_jumps_to_reach_home/SolutionTest.kt b/src/test/kotlin/g1601_1700/s1654_minimum_jumps_to_reach_home/SolutionTest.kt
index 7e40cdf65..4a473ee25 100644
--- a/src/test/kotlin/g1601_1700/s1654_minimum_jumps_to_reach_home/SolutionTest.kt
+++ b/src/test/kotlin/g1601_1700/s1654_minimum_jumps_to_reach_home/SolutionTest.kt
@@ -14,7 +14,7 @@ internal class SolutionTest {
     fun minimumJumps2() {
         assertThat(
             Solution().minimumJumps(intArrayOf(8, 3, 16, 6, 12, 20), 15, 13, 11),
-            equalTo(-1)
+            equalTo(-1),
         )
     }
 
@@ -22,7 +22,7 @@ internal class SolutionTest {
     fun minimumJumps3() {
         assertThat(
             Solution().minimumJumps(intArrayOf(1, 6, 2, 14, 5, 17, 4), 16, 9, 7),
-            equalTo(2)
+            equalTo(2),
         )
     }
 }
diff --git a/src/test/kotlin/g1601_1700/s1655_distribute_repeating_integers/SolutionTest.kt b/src/test/kotlin/g1601_1700/s1655_distribute_repeating_integers/SolutionTest.kt
index dc3fffb03..9ee9579c5 100644
--- a/src/test/kotlin/g1601_1700/s1655_distribute_repeating_integers/SolutionTest.kt
+++ b/src/test/kotlin/g1601_1700/s1655_distribute_repeating_integers/SolutionTest.kt
@@ -9,14 +9,15 @@ internal class SolutionTest {
     fun canDistribute() {
         assertThat(
             Solution().canDistribute(intArrayOf(1, 2, 3, 4), intArrayOf(2)),
-            equalTo(false)
+            equalTo(false),
         )
     }
 
     @Test
     fun canDistribute2() {
         assertThat(
-            Solution().canDistribute(intArrayOf(1, 2, 3, 3), intArrayOf(2)), equalTo(true)
+            Solution().canDistribute(intArrayOf(1, 2, 3, 3), intArrayOf(2)),
+            equalTo(true),
         )
     }
 
@@ -24,7 +25,7 @@ internal class SolutionTest {
     fun canDistribute3() {
         assertThat(
             Solution().canDistribute(intArrayOf(1, 1, 2, 2), intArrayOf(2, 2)),
-            equalTo(true)
+            equalTo(true),
         )
     }
 }
diff --git a/src/test/kotlin/g1601_1700/s1661_average_time_of_process_per_machine/MysqlTest.kt b/src/test/kotlin/g1601_1700/s1661_average_time_of_process_per_machine/MysqlTest.kt
index cd7f82d03..9bbebea65 100644
--- a/src/test/kotlin/g1601_1700/s1661_average_time_of_process_per_machine/MysqlTest.kt
+++ b/src/test/kotlin/g1601_1700/s1661_average_time_of_process_per_machine/MysqlTest.kt
@@ -41,8 +41,8 @@ import javax.sql.DataSource
             "INSERT INTO Activity(machine_id, process_id, activity_type, timestamp) " +
             "VALUES (2, 1, 'start', 2.500); " +
             "INSERT INTO Activity(machine_id, process_id, activity_type, timestamp) " +
-            "VALUES (2, 1, 'end', 5.000); "
-    ]
+            "VALUES (2, 1, 'end', 5.000); ",
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -53,12 +53,12 @@ internal class MysqlTest {
                 statement.executeQuery(
                     BufferedReader(
                         FileReader(
-                            "src/main/kotlin/g1601_1700/s1661_average_time_of_process_per_machine/script.sql"
-                        )
+                            "src/main/kotlin/g1601_1700/s1661_average_time_of_process_per_machine/script.sql",
+                        ),
                     )
                         .lines()
                         .collect(Collectors.joining("\n"))
-                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace("#.*?\\r?\\n".toRegex(), ""),
                 ).use { resultSet ->
                     assertThat(resultSet.next(), equalTo(true))
                     assertThat(resultSet.getInt(1), equalTo(0))
diff --git a/src/test/kotlin/g1601_1700/s1662_check_if_two_string_arrays_are_equivalent/SolutionTest.kt b/src/test/kotlin/g1601_1700/s1662_check_if_two_string_arrays_are_equivalent/SolutionTest.kt
index 7ecde9931..2e61a7a3d 100644
--- a/src/test/kotlin/g1601_1700/s1662_check_if_two_string_arrays_are_equivalent/SolutionTest.kt
+++ b/src/test/kotlin/g1601_1700/s1662_check_if_two_string_arrays_are_equivalent/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .arrayStringsAreEqual(arrayOf("ab", "c"), arrayOf("a", "bc")),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
@@ -19,7 +19,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .arrayStringsAreEqual(arrayOf("a", "cb"), arrayOf("ab", "c")),
-            equalTo(false)
+            equalTo(false),
         )
     }
 
@@ -28,7 +28,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .arrayStringsAreEqual(arrayOf("abc", "d", "defg"), arrayOf("abcddefg")),
-            equalTo(true)
+            equalTo(true),
         )
     }
 }
diff --git a/src/test/kotlin/g1601_1700/s1665_minimum_initial_energy_to_finish_tasks/SolutionTest.kt b/src/test/kotlin/g1601_1700/s1665_minimum_initial_energy_to_finish_tasks/SolutionTest.kt
index 9071910a9..d95a2747d 100644
--- a/src/test/kotlin/g1601_1700/s1665_minimum_initial_energy_to_finish_tasks/SolutionTest.kt
+++ b/src/test/kotlin/g1601_1700/s1665_minimum_initial_energy_to_finish_tasks/SolutionTest.kt
@@ -16,11 +16,14 @@ internal class SolutionTest {
             Solution()
                 .minimumEffort(
                     arrayOf(
-                        intArrayOf(1, 3), intArrayOf(2, 4),
-                        intArrayOf(10, 11), intArrayOf(10, 12), intArrayOf(8, 9)
-                    )
+                        intArrayOf(1, 3),
+                        intArrayOf(2, 4),
+                        intArrayOf(10, 11),
+                        intArrayOf(10, 12),
+                        intArrayOf(8, 9),
+                    ),
                 ),
-            equalTo(32)
+            equalTo(32),
         )
     }
 
@@ -30,11 +33,15 @@ internal class SolutionTest {
             Solution()
                 .minimumEffort(
                     arrayOf(
-                        intArrayOf(1, 7), intArrayOf(2, 8),
-                        intArrayOf(3, 9), intArrayOf(4, 10), intArrayOf(5, 11), intArrayOf(6, 12)
-                    )
+                        intArrayOf(1, 7),
+                        intArrayOf(2, 8),
+                        intArrayOf(3, 9),
+                        intArrayOf(4, 10),
+                        intArrayOf(5, 11),
+                        intArrayOf(6, 12),
+                    ),
                 ),
-            equalTo(27)
+            equalTo(27),
         )
     }
 }
diff --git a/src/test/kotlin/g1601_1700/s1667_fix_names_in_a_table/MysqlTest.kt b/src/test/kotlin/g1601_1700/s1667_fix_names_in_a_table/MysqlTest.kt
index be66a66b5..e5f62a40e 100644
--- a/src/test/kotlin/g1601_1700/s1667_fix_names_in_a_table/MysqlTest.kt
+++ b/src/test/kotlin/g1601_1700/s1667_fix_names_in_a_table/MysqlTest.kt
@@ -18,8 +18,8 @@ import javax.sql.DataSource
     initialSqls = [
         "CREATE TABLE Users(user_id INTEGER PRIMARY KEY, name VARCHAR); " +
             "INSERT INTO Users(user_id, name) VALUES (1, 'aLice'); " +
-            "INSERT INTO Users(user_id, name) VALUES (2, 'bOB'); "
-    ]
+            "INSERT INTO Users(user_id, name) VALUES (2, 'bOB'); ",
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -31,12 +31,12 @@ internal class MysqlTest {
                     BufferedReader(
                         FileReader(
                             "src/main/kotlin/g1601_1700/s1667_fix_" +
-                                "names_in_a_table/script.sql"
-                        )
+                                "names_in_a_table/script.sql",
+                        ),
                     )
                         .lines()
                         .collect(Collectors.joining("\n"))
-                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace("#.*?\\r?\\n".toRegex(), ""),
                 ).use { resultSet ->
                     assertThat(resultSet.next(), equalTo(true))
                     assertThat(resultSet.getNString(2), equalTo("Alice"))
diff --git a/src/test/kotlin/g1601_1700/s1671_minimum_number_of_removals_to_make_mountain_array/SolutionTest.kt b/src/test/kotlin/g1601_1700/s1671_minimum_number_of_removals_to_make_mountain_array/SolutionTest.kt
index 17fa2e97b..47ddc02cb 100644
--- a/src/test/kotlin/g1601_1700/s1671_minimum_number_of_removals_to_make_mountain_array/SolutionTest.kt
+++ b/src/test/kotlin/g1601_1700/s1671_minimum_number_of_removals_to_make_mountain_array/SolutionTest.kt
@@ -14,7 +14,7 @@ internal class SolutionTest {
     fun minimumMountainRemovals2() {
         assertThat(
             Solution().minimumMountainRemovals(intArrayOf(2, 1, 1, 5, 6, 2, 3, 1)),
-            equalTo(3)
+            equalTo(3),
         )
     }
 }
diff --git a/src/test/kotlin/g1601_1700/s1673_find_the_most_competitive_subsequence/SolutionTest.kt b/src/test/kotlin/g1601_1700/s1673_find_the_most_competitive_subsequence/SolutionTest.kt
index 47fd41ff5..8cbe5ca63 100644
--- a/src/test/kotlin/g1601_1700/s1673_find_the_most_competitive_subsequence/SolutionTest.kt
+++ b/src/test/kotlin/g1601_1700/s1673_find_the_most_competitive_subsequence/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun mostCompetitive() {
         assertThat(
             Solution().mostCompetitive(intArrayOf(3, 5, 2, 6), 2),
-            equalTo(intArrayOf(2, 6))
+            equalTo(intArrayOf(2, 6)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun mostCompetitive2() {
         assertThat(
             Solution().mostCompetitive(intArrayOf(2, 4, 3, 3, 5, 4, 9, 6), 4),
-            equalTo(intArrayOf(2, 3, 3, 4))
+            equalTo(intArrayOf(2, 3, 3, 4)),
         )
     }
 }
diff --git a/src/test/kotlin/g1601_1700/s1681_minimum_incompatibility/SolutionTest.kt b/src/test/kotlin/g1601_1700/s1681_minimum_incompatibility/SolutionTest.kt
index 653c500c8..797d3ad49 100644
--- a/src/test/kotlin/g1601_1700/s1681_minimum_incompatibility/SolutionTest.kt
+++ b/src/test/kotlin/g1601_1700/s1681_minimum_incompatibility/SolutionTest.kt
@@ -14,7 +14,7 @@ internal class SolutionTest {
     fun minimumIncompatibility2() {
         assertThat(
             Solution().minimumIncompatibility(intArrayOf(6, 3, 8, 1, 3, 1, 2, 2), 4),
-            equalTo(6)
+            equalTo(6),
         )
     }
 
@@ -22,7 +22,7 @@ internal class SolutionTest {
     fun minimumIncompatibility3() {
         assertThat(
             Solution().minimumIncompatibility(intArrayOf(5, 3, 3, 6, 3, 3), 3),
-            equalTo(-1)
+            equalTo(-1),
         )
     }
 }
diff --git a/src/test/kotlin/g1601_1700/s1683_invalid_tweets/MysqlTest.kt b/src/test/kotlin/g1601_1700/s1683_invalid_tweets/MysqlTest.kt
index ca6703b18..0e7a92cdc 100644
--- a/src/test/kotlin/g1601_1700/s1683_invalid_tweets/MysqlTest.kt
+++ b/src/test/kotlin/g1601_1700/s1683_invalid_tweets/MysqlTest.kt
@@ -18,8 +18,8 @@ import javax.sql.DataSource
     initialSqls = [
         "CREATE TABLE Tweets(tweet_id INTEGER, content VARCHAR); " +
             "INSERT INTO Tweets(tweet_id, content) VALUES (1, 'Vote for Biden'); " +
-            "INSERT INTO Tweets(tweet_id, content) VALUES (2, 'Let us make America great again!'); "
-    ]
+            "INSERT INTO Tweets(tweet_id, content) VALUES (2, 'Let us make America great again!'); ",
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -30,12 +30,12 @@ internal class MysqlTest {
                 statement.executeQuery(
                     BufferedReader(
                         FileReader(
-                            "src/main/kotlin/g1601_1700/s1683_invalid_tweets/script.sql"
-                        )
+                            "src/main/kotlin/g1601_1700/s1683_invalid_tweets/script.sql",
+                        ),
                     )
                         .lines()
                         .collect(Collectors.joining("\n"))
-                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace("#.*?\\r?\\n".toRegex(), ""),
                 ).use { resultSet ->
                     assertThat(resultSet.next(), equalTo(true))
                     assertThat(resultSet.getInt(1), equalTo(2))
diff --git a/src/test/kotlin/g1601_1700/s1684_count_the_number_of_consistent_strings/SolutionTest.kt b/src/test/kotlin/g1601_1700/s1684_count_the_number_of_consistent_strings/SolutionTest.kt
index 99e5d9306..c7891d904 100644
--- a/src/test/kotlin/g1601_1700/s1684_count_the_number_of_consistent_strings/SolutionTest.kt
+++ b/src/test/kotlin/g1601_1700/s1684_count_the_number_of_consistent_strings/SolutionTest.kt
@@ -10,9 +10,10 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .countConsistentStrings(
-                    "ab", arrayOf("ad", "bd", "aaab", "baa", "badab")
+                    "ab",
+                    arrayOf("ad", "bd", "aaab", "baa", "badab"),
                 ),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -21,9 +22,10 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .countConsistentStrings(
-                    "abc", arrayOf("a", "b", "c", "ab", "ac", "bc", "abc")
+                    "abc",
+                    arrayOf("a", "b", "c", "ab", "ac", "bc", "abc"),
                 ),
-            equalTo(7)
+            equalTo(7),
         )
     }
 
@@ -32,9 +34,10 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .countConsistentStrings(
-                    "cad", arrayOf("cc", "acd", "b", "ba", "bac", "bad", "ac", "d")
+                    "cad",
+                    arrayOf("cc", "acd", "b", "ba", "bac", "bad", "ac", "d"),
                 ),
-            equalTo(4)
+            equalTo(4),
         )
     }
 }
diff --git a/src/test/kotlin/g1601_1700/s1685_sum_of_absolute_differences_in_a_sorted_array/SolutionTest.kt b/src/test/kotlin/g1601_1700/s1685_sum_of_absolute_differences_in_a_sorted_array/SolutionTest.kt
index 699862f8a..1ac5f0e80 100644
--- a/src/test/kotlin/g1601_1700/s1685_sum_of_absolute_differences_in_a_sorted_array/SolutionTest.kt
+++ b/src/test/kotlin/g1601_1700/s1685_sum_of_absolute_differences_in_a_sorted_array/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun sumAbsoluteDifferences() {
         assertThat(
             Solution().getSumAbsoluteDifferences(intArrayOf(2, 3, 5)),
-            equalTo(intArrayOf(4, 3, 5))
+            equalTo(intArrayOf(4, 3, 5)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun sumAbsoluteDifferences2() {
         assertThat(
             Solution().getSumAbsoluteDifferences(intArrayOf(1, 4, 6, 8, 10)),
-            equalTo(intArrayOf(24, 15, 13, 15, 21))
+            equalTo(intArrayOf(24, 15, 13, 15, 21)),
         )
     }
 }
diff --git a/src/test/kotlin/g1601_1700/s1686_stone_game_vi/SolutionTest.kt b/src/test/kotlin/g1601_1700/s1686_stone_game_vi/SolutionTest.kt
index 32ac6801c..e397f1bd2 100644
--- a/src/test/kotlin/g1601_1700/s1686_stone_game_vi/SolutionTest.kt
+++ b/src/test/kotlin/g1601_1700/s1686_stone_game_vi/SolutionTest.kt
@@ -18,7 +18,8 @@ internal class SolutionTest {
     @Test
     fun stoneGameVI3() {
         assertThat(
-            Solution().stoneGameVI(intArrayOf(2, 4, 3), intArrayOf(1, 6, 7)), equalTo(-1)
+            Solution().stoneGameVI(intArrayOf(2, 4, 3), intArrayOf(1, 6, 7)),
+            equalTo(-1),
         )
     }
 }
diff --git a/src/test/kotlin/g1601_1700/s1687_delivering_boxes_from_storage_to_ports/SolutionTest.kt b/src/test/kotlin/g1601_1700/s1687_delivering_boxes_from_storage_to_ports/SolutionTest.kt
index 4fff06097..a817343b1 100644
--- a/src/test/kotlin/g1601_1700/s1687_delivering_boxes_from_storage_to_ports/SolutionTest.kt
+++ b/src/test/kotlin/g1601_1700/s1687_delivering_boxes_from_storage_to_ports/SolutionTest.kt
@@ -10,9 +10,11 @@ internal class SolutionTest {
         assertThat(
             Solution().boxDelivering(
                 arrayOf(intArrayOf(1, 1), intArrayOf(2, 1), intArrayOf(1, 1)),
-                2, 3, 3
+                2,
+                3,
+                3,
             ),
-            equalTo(4)
+            equalTo(4),
         )
     }
 
@@ -22,12 +24,17 @@ internal class SolutionTest {
             Solution()
                 .boxDelivering(
                     arrayOf(
-                        intArrayOf(1, 2), intArrayOf(3, 3), intArrayOf(3, 1),
-                        intArrayOf(3, 1), intArrayOf(2, 4)
+                        intArrayOf(1, 2),
+                        intArrayOf(3, 3),
+                        intArrayOf(3, 1),
+                        intArrayOf(3, 1),
+                        intArrayOf(2, 4),
                     ),
-                    3, 3, 6
+                    3,
+                    3,
+                    6,
                 ),
-            equalTo(6)
+            equalTo(6),
         )
     }
 
@@ -37,14 +44,18 @@ internal class SolutionTest {
             Solution()
                 .boxDelivering(
                     arrayOf(
-                        intArrayOf(1, 4), intArrayOf(1, 2), intArrayOf(2, 1),
-                        intArrayOf(2, 1), intArrayOf(3, 2), intArrayOf(3, 4)
+                        intArrayOf(1, 4),
+                        intArrayOf(1, 2),
+                        intArrayOf(2, 1),
+                        intArrayOf(2, 1),
+                        intArrayOf(3, 2),
+                        intArrayOf(3, 4),
                     ),
                     3,
                     6,
-                    7
+                    7,
                 ),
-            equalTo(6)
+            equalTo(6),
         )
     }
 }
diff --git a/src/test/kotlin/g1601_1700/s1690_stone_game_vii/SolutionTest.kt b/src/test/kotlin/g1601_1700/s1690_stone_game_vii/SolutionTest.kt
index 6ddd1fcf4..02bc55881 100644
--- a/src/test/kotlin/g1601_1700/s1690_stone_game_vii/SolutionTest.kt
+++ b/src/test/kotlin/g1601_1700/s1690_stone_game_vii/SolutionTest.kt
@@ -13,7 +13,8 @@ internal class SolutionTest {
     @Test
     fun stoneGameVII2() {
         assertThat(
-            Solution().stoneGameVII(intArrayOf(7, 90, 5, 1, 100, 10, 10, 2)), equalTo(122)
+            Solution().stoneGameVII(intArrayOf(7, 90, 5, 1, 100, 10, 10, 2)),
+            equalTo(122),
         )
     }
 }
diff --git a/src/test/kotlin/g1601_1700/s1691_maximum_height_by_stacking_cuboids/SolutionTest.kt b/src/test/kotlin/g1601_1700/s1691_maximum_height_by_stacking_cuboids/SolutionTest.kt
index 9554d5776..079b3555a 100644
--- a/src/test/kotlin/g1601_1700/s1691_maximum_height_by_stacking_cuboids/SolutionTest.kt
+++ b/src/test/kotlin/g1601_1700/s1691_maximum_height_by_stacking_cuboids/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun maxHeight() {
         assertThat(
             Solution().maxHeight(arrayOf(intArrayOf(50, 45, 20), intArrayOf(95, 37, 53), intArrayOf(45, 23, 12))),
-            equalTo(190)
+            equalTo(190),
         )
     }
 
@@ -24,12 +24,15 @@ internal class SolutionTest {
             Solution()
                 .maxHeight(
                     arrayOf(
-                        intArrayOf(7, 11, 17), intArrayOf(7, 17, 11),
-                        intArrayOf(11, 7, 17), intArrayOf(11, 17, 7),
-                        intArrayOf(17, 7, 11), intArrayOf(17, 11, 7)
-                    )
+                        intArrayOf(7, 11, 17),
+                        intArrayOf(7, 17, 11),
+                        intArrayOf(11, 7, 17),
+                        intArrayOf(11, 17, 7),
+                        intArrayOf(17, 7, 11),
+                        intArrayOf(17, 11, 7),
+                    ),
                 ),
-            equalTo(102)
+            equalTo(102),
         )
     }
 }
diff --git a/src/test/kotlin/g1601_1700/s1693_daily_leads_and_partners/MysqlTest.kt b/src/test/kotlin/g1601_1700/s1693_daily_leads_and_partners/MysqlTest.kt
index bf05b7f5e..67086b6c2 100644
--- a/src/test/kotlin/g1601_1700/s1693_daily_leads_and_partners/MysqlTest.kt
+++ b/src/test/kotlin/g1601_1700/s1693_daily_leads_and_partners/MysqlTest.kt
@@ -37,8 +37,8 @@ import javax.sql.DataSource
             "INSERT INTO DailySales(date_id, make_name, lead_id, partner_id) " +
             " VALUES ('2020-12-7', 'honda', 1, 2); " +
             "INSERT INTO DailySales(date_id, make_name, lead_id, partner_id) " +
-            " VALUES ('2020-12-7', 'honda', 2, 1); "
-    ]
+            " VALUES ('2020-12-7', 'honda', 2, 1); ",
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -50,12 +50,12 @@ internal class MysqlTest {
                     BufferedReader(
                         FileReader(
                             "src/main/kotlin/g1601_1700/s1693_daily_le" +
-                                "ads_and_partners/script.sql"
-                        )
+                                "ads_and_partners/script.sql",
+                        ),
                     )
                         .lines()
                         .collect(Collectors.joining("\n"))
-                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace("#.*?\\r?\\n".toRegex(), ""),
                 ).use { resultSet ->
                     assertThat(resultSet.next(), equalTo(true))
                     assertThat(resultSet.getNString(1), equalTo("2020-12-07"))
diff --git a/src/test/kotlin/g1601_1700/s1695_maximum_erasure_value/SolutionTest.kt b/src/test/kotlin/g1601_1700/s1695_maximum_erasure_value/SolutionTest.kt
index 82eec5be4..9908a4d58 100644
--- a/src/test/kotlin/g1601_1700/s1695_maximum_erasure_value/SolutionTest.kt
+++ b/src/test/kotlin/g1601_1700/s1695_maximum_erasure_value/SolutionTest.kt
@@ -14,7 +14,7 @@ internal class SolutionTest {
     fun maximumUniqueSubarray2() {
         assertThat(
             Solution().maximumUniqueSubarray(intArrayOf(5, 2, 1, 2, 5, 2, 1, 2, 5)),
-            equalTo(8)
+            equalTo(8),
         )
     }
 }
diff --git a/src/test/kotlin/g1601_1700/s1696_jump_game_vi/SolutionTest.kt b/src/test/kotlin/g1601_1700/s1696_jump_game_vi/SolutionTest.kt
index 42b22dadc..748c42d26 100644
--- a/src/test/kotlin/g1601_1700/s1696_jump_game_vi/SolutionTest.kt
+++ b/src/test/kotlin/g1601_1700/s1696_jump_game_vi/SolutionTest.kt
@@ -18,7 +18,8 @@ internal class SolutionTest {
     @Test
     fun maxResult3() {
         assertThat(
-            Solution().maxResult(intArrayOf(1, -5, -20, 4, -1, 3, -6, -3), 2), equalTo(0)
+            Solution().maxResult(intArrayOf(1, -5, -20, 4, -1, 3, -6, -3), 2),
+            equalTo(0),
         )
     }
 }
diff --git a/src/test/kotlin/g1601_1700/s1697_checking_existence_of_edge_length_limited_paths/SolutionTest.kt b/src/test/kotlin/g1601_1700/s1697_checking_existence_of_edge_length_limited_paths/SolutionTest.kt
index 1a259b01e..219ff469e 100644
--- a/src/test/kotlin/g1601_1700/s1697_checking_existence_of_edge_length_limited_paths/SolutionTest.kt
+++ b/src/test/kotlin/g1601_1700/s1697_checking_existence_of_edge_length_limited_paths/SolutionTest.kt
@@ -12,12 +12,14 @@ internal class SolutionTest {
                 .distanceLimitedPathsExist(
                     3,
                     arrayOf(
-                        intArrayOf(0, 1, 2), intArrayOf(1, 2, 4),
-                        intArrayOf(2, 0, 8), intArrayOf(1, 0, 16)
+                        intArrayOf(0, 1, 2),
+                        intArrayOf(1, 2, 4),
+                        intArrayOf(2, 0, 8),
+                        intArrayOf(1, 0, 16),
                     ),
-                    arrayOf(intArrayOf(0, 1, 2), intArrayOf(0, 2, 5))
+                    arrayOf(intArrayOf(0, 1, 2), intArrayOf(0, 2, 5)),
                 ),
-            equalTo(booleanArrayOf(false, true))
+            equalTo(booleanArrayOf(false, true)),
         )
     }
 
@@ -28,12 +30,14 @@ internal class SolutionTest {
                 .distanceLimitedPathsExist(
                     5,
                     arrayOf(
-                        intArrayOf(0, 1, 10), intArrayOf(1, 2, 5),
-                        intArrayOf(2, 3, 9), intArrayOf(3, 4, 13)
+                        intArrayOf(0, 1, 10),
+                        intArrayOf(1, 2, 5),
+                        intArrayOf(2, 3, 9),
+                        intArrayOf(3, 4, 13),
                     ),
-                    arrayOf(intArrayOf(0, 4, 14), intArrayOf(1, 4, 13))
+                    arrayOf(intArrayOf(0, 4, 14), intArrayOf(1, 4, 13)),
                 ),
-            equalTo(booleanArrayOf(true, false))
+            equalTo(booleanArrayOf(true, false)),
         )
     }
 }
diff --git a/src/test/kotlin/g1601_1700/s1700_number_of_students_unable_to_eat_lunch/SolutionTest.kt b/src/test/kotlin/g1601_1700/s1700_number_of_students_unable_to_eat_lunch/SolutionTest.kt
index 53efcfca5..4ae784313 100644
--- a/src/test/kotlin/g1601_1700/s1700_number_of_students_unable_to_eat_lunch/SolutionTest.kt
+++ b/src/test/kotlin/g1601_1700/s1700_number_of_students_unable_to_eat_lunch/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun countStudents() {
         assertThat(
             Solution().countStudents(intArrayOf(1, 1, 0, 0), intArrayOf(0, 1, 0, 1)),
-            equalTo(0)
+            equalTo(0),
         )
     }
 
@@ -18,7 +18,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .countStudents(intArrayOf(1, 1, 1, 0, 0, 1), intArrayOf(1, 0, 0, 0, 1, 1)),
-            equalTo(3)
+            equalTo(3),
         )
     }
 }
diff --git a/src/test/kotlin/g1701_1800/s1701_average_waiting_time/SolutionTest.kt b/src/test/kotlin/g1701_1800/s1701_average_waiting_time/SolutionTest.kt
index ce7bbf4db..7cc5886e1 100644
--- a/src/test/kotlin/g1701_1800/s1701_average_waiting_time/SolutionTest.kt
+++ b/src/test/kotlin/g1701_1800/s1701_average_waiting_time/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun averageWaitingTime() {
         assertThat(
             Solution().averageWaitingTime(arrayOf(intArrayOf(1, 2), intArrayOf(2, 5), intArrayOf(4, 3))),
-            equalTo(5.000)
+            equalTo(5.000),
         )
     }
 
@@ -18,11 +18,13 @@ internal class SolutionTest {
         assertThat(
             Solution().averageWaitingTime(
                 arrayOf(
-                    intArrayOf(5, 2), intArrayOf(5, 4),
-                    intArrayOf(10, 3), intArrayOf(20, 1)
-                )
+                    intArrayOf(5, 2),
+                    intArrayOf(5, 4),
+                    intArrayOf(10, 3),
+                    intArrayOf(20, 1),
+                ),
             ),
-            equalTo(3.25)
+            equalTo(3.25),
         )
     }
 }
diff --git a/src/test/kotlin/g1701_1800/s1705_maximum_number_of_eaten_apples/SolutionTest.kt b/src/test/kotlin/g1701_1800/s1705_maximum_number_of_eaten_apples/SolutionTest.kt
index 9afc6f90a..ea7a4167d 100644
--- a/src/test/kotlin/g1701_1800/s1705_maximum_number_of_eaten_apples/SolutionTest.kt
+++ b/src/test/kotlin/g1701_1800/s1705_maximum_number_of_eaten_apples/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun eatenApples() {
         assertThat(
             Solution().eatenApples(intArrayOf(1, 2, 3, 5, 2), intArrayOf(3, 2, 1, 4, 2)),
-            equalTo(7)
+            equalTo(7),
         )
     }
 
@@ -18,7 +18,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .eatenApples(intArrayOf(3, 0, 0, 0, 0, 2), intArrayOf(3, 0, 0, 0, 0, 2)),
-            equalTo(5)
+            equalTo(5),
         )
     }
 }
diff --git a/src/test/kotlin/g1701_1800/s1706_where_will_the_ball_fall/SolutionTest.kt b/src/test/kotlin/g1701_1800/s1706_where_will_the_ball_fall/SolutionTest.kt
index 7a2bf96f1..1f20cf619 100644
--- a/src/test/kotlin/g1701_1800/s1706_where_will_the_ball_fall/SolutionTest.kt
+++ b/src/test/kotlin/g1701_1800/s1706_where_will_the_ball_fall/SolutionTest.kt
@@ -11,12 +11,14 @@ internal class SolutionTest {
             Solution()
                 .findBall(
                     arrayOf(
-                        intArrayOf(1, 1, 1, -1, -1), intArrayOf(1, 1, 1, -1, -1),
-                        intArrayOf(-1, -1, -1, 1, 1), intArrayOf(1, 1, 1, 1, -1),
-                        intArrayOf(-1, -1, -1, -1, -1)
-                    )
+                        intArrayOf(1, 1, 1, -1, -1),
+                        intArrayOf(1, 1, 1, -1, -1),
+                        intArrayOf(-1, -1, -1, 1, 1),
+                        intArrayOf(1, 1, 1, 1, -1),
+                        intArrayOf(-1, -1, -1, -1, -1),
+                    ),
                 ),
-            equalTo(intArrayOf(1, -1, -1, -1, -1))
+            equalTo(intArrayOf(1, -1, -1, -1, -1)),
         )
     }
 
@@ -31,11 +33,13 @@ internal class SolutionTest {
             Solution()
                 .findBall(
                     arrayOf(
-                        intArrayOf(1, 1, 1, 1, 1, 1), intArrayOf(-1, -1, -1, -1, -1, -1),
-                        intArrayOf(1, 1, 1, 1, 1, 1), intArrayOf(-1, -1, -1, -1, -1, -1)
-                    )
+                        intArrayOf(1, 1, 1, 1, 1, 1),
+                        intArrayOf(-1, -1, -1, -1, -1, -1),
+                        intArrayOf(1, 1, 1, 1, 1, 1),
+                        intArrayOf(-1, -1, -1, -1, -1, -1),
+                    ),
                 ),
-            equalTo(intArrayOf(0, 1, 2, 3, 4, -1))
+            equalTo(intArrayOf(0, 1, 2, 3, 4, -1)),
         )
     }
 }
diff --git a/src/test/kotlin/g1701_1800/s1707_maximum_xor_with_an_element_from_array/SolutionTest.kt b/src/test/kotlin/g1701_1800/s1707_maximum_xor_with_an_element_from_array/SolutionTest.kt
index 122f4c9c1..7070f9bd6 100644
--- a/src/test/kotlin/g1701_1800/s1707_maximum_xor_with_an_element_from_array/SolutionTest.kt
+++ b/src/test/kotlin/g1701_1800/s1707_maximum_xor_with_an_element_from_array/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .maximizeXor(intArrayOf(0, 1, 2, 3, 4), arrayOf(intArrayOf(3, 1), intArrayOf(1, 3), intArrayOf(5, 6))),
-            equalTo(intArrayOf(3, 3, 7))
+            equalTo(intArrayOf(3, 3, 7)),
         )
     }
 
@@ -22,10 +22,11 @@ internal class SolutionTest {
                     intArrayOf(5, 2, 4, 6, 6, 3),
                     arrayOf(
                         intArrayOf(12, 4),
-                        intArrayOf(8, 1), intArrayOf(6, 3)
-                    )
+                        intArrayOf(8, 1),
+                        intArrayOf(6, 3),
+                    ),
                 ),
-            equalTo(intArrayOf(15, -1, 5))
+            equalTo(intArrayOf(15, -1, 5)),
         )
     }
 }
diff --git a/src/test/kotlin/g1701_1800/s1710_maximum_units_on_a_truck/SolutionTest.kt b/src/test/kotlin/g1701_1800/s1710_maximum_units_on_a_truck/SolutionTest.kt
index 7e447be99..457b3897a 100644
--- a/src/test/kotlin/g1701_1800/s1710_maximum_units_on_a_truck/SolutionTest.kt
+++ b/src/test/kotlin/g1701_1800/s1710_maximum_units_on_a_truck/SolutionTest.kt
@@ -10,12 +10,13 @@ internal class SolutionTest {
         assertThat(
             Solution().maximumUnits(
                 arrayOf(
-                    intArrayOf(1, 3), intArrayOf(2, 2),
-                    intArrayOf(3, 1)
+                    intArrayOf(1, 3),
+                    intArrayOf(2, 2),
+                    intArrayOf(3, 1),
                 ),
-                4
+                4,
             ),
-            equalTo(8)
+            equalTo(8),
         )
     }
 
@@ -24,12 +25,14 @@ internal class SolutionTest {
         assertThat(
             Solution().maximumUnits(
                 arrayOf(
-                    intArrayOf(5, 10), intArrayOf(2, 5),
-                    intArrayOf(4, 7), intArrayOf(3, 9)
+                    intArrayOf(5, 10),
+                    intArrayOf(2, 5),
+                    intArrayOf(4, 7),
+                    intArrayOf(3, 9),
                 ),
-                10
+                10,
             ),
-            equalTo(91)
+            equalTo(91),
         )
     }
 }
diff --git a/src/test/kotlin/g1701_1800/s1713_minimum_operations_to_make_a_subsequence/SolutionTest.kt b/src/test/kotlin/g1701_1800/s1713_minimum_operations_to_make_a_subsequence/SolutionTest.kt
index 18694c380..7f9cab269 100644
--- a/src/test/kotlin/g1701_1800/s1713_minimum_operations_to_make_a_subsequence/SolutionTest.kt
+++ b/src/test/kotlin/g1701_1800/s1713_minimum_operations_to_make_a_subsequence/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun minOperations() {
         assertThat(
             Solution().minOperations(intArrayOf(5, 1, 3), intArrayOf(9, 4, 2, 3, 4)),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -18,7 +18,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .minOperations(intArrayOf(6, 4, 8, 1, 3, 2), intArrayOf(4, 7, 6, 2, 3, 8, 6, 1)),
-            equalTo(3)
+            equalTo(3),
         )
     }
 }
diff --git a/src/test/kotlin/g1701_1800/s1718_construct_the_lexicographically_largest_valid_sequence/SolutionTest.kt b/src/test/kotlin/g1701_1800/s1718_construct_the_lexicographically_largest_valid_sequence/SolutionTest.kt
index ce75978e7..18a9b6e9b 100644
--- a/src/test/kotlin/g1701_1800/s1718_construct_the_lexicographically_largest_valid_sequence/SolutionTest.kt
+++ b/src/test/kotlin/g1701_1800/s1718_construct_the_lexicographically_largest_valid_sequence/SolutionTest.kt
@@ -8,7 +8,8 @@ internal class SolutionTest {
     @Test
     fun constructDistancedSequence() {
         assertThat(
-            Solution().constructDistancedSequence(3), equalTo(intArrayOf(3, 1, 2, 3, 2))
+            Solution().constructDistancedSequence(3),
+            equalTo(intArrayOf(3, 1, 2, 3, 2)),
         )
     }
 
@@ -16,7 +17,7 @@ internal class SolutionTest {
     fun constructDistancedSequence2() {
         assertThat(
             Solution().constructDistancedSequence(5),
-            equalTo(intArrayOf(5, 3, 1, 4, 3, 5, 2, 4, 2))
+            equalTo(intArrayOf(5, 3, 1, 4, 3, 5, 2, 4, 2)),
         )
     }
 }
diff --git a/src/test/kotlin/g1701_1800/s1719_number_of_ways_to_reconstruct_a_tree/SolutionTest.kt b/src/test/kotlin/g1701_1800/s1719_number_of_ways_to_reconstruct_a_tree/SolutionTest.kt
index 1fef98675..13c4b1040 100644
--- a/src/test/kotlin/g1701_1800/s1719_number_of_ways_to_reconstruct_a_tree/SolutionTest.kt
+++ b/src/test/kotlin/g1701_1800/s1719_number_of_ways_to_reconstruct_a_tree/SolutionTest.kt
@@ -16,10 +16,11 @@ internal class SolutionTest {
             Solution().checkWays(
                 arrayOf(
                     intArrayOf(1, 2),
-                    intArrayOf(2, 3), intArrayOf(1, 3)
-                )
+                    intArrayOf(2, 3),
+                    intArrayOf(1, 3),
+                ),
             ),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -28,11 +29,13 @@ internal class SolutionTest {
         assertThat(
             Solution().checkWays(
                 arrayOf(
-                    intArrayOf(1, 2), intArrayOf(2, 3),
-                    intArrayOf(2, 4), intArrayOf(1, 5)
-                )
+                    intArrayOf(1, 2),
+                    intArrayOf(2, 3),
+                    intArrayOf(2, 4),
+                    intArrayOf(1, 5),
+                ),
             ),
-            equalTo(0)
+            equalTo(0),
         )
     }
 }
diff --git a/src/test/kotlin/g1701_1800/s1720_decode_xored_array/SolutionTest.kt b/src/test/kotlin/g1701_1800/s1720_decode_xored_array/SolutionTest.kt
index 9b8bc70f4..e399a651a 100644
--- a/src/test/kotlin/g1701_1800/s1720_decode_xored_array/SolutionTest.kt
+++ b/src/test/kotlin/g1701_1800/s1720_decode_xored_array/SolutionTest.kt
@@ -14,7 +14,7 @@ internal class SolutionTest {
     fun decode2() {
         assertThat(
             Solution().decode(intArrayOf(6, 2, 7, 3), 4),
-            equalTo(intArrayOf(4, 2, 0, 7, 4))
+            equalTo(intArrayOf(4, 2, 0, 7, 4)),
         )
     }
 }
diff --git a/src/test/kotlin/g1701_1800/s1721_swapping_nodes_in_a_linked_list/SolutionTest.kt b/src/test/kotlin/g1701_1800/s1721_swapping_nodes_in_a_linked_list/SolutionTest.kt
index 05eb42b8f..c06580364 100644
--- a/src/test/kotlin/g1701_1800/s1721_swapping_nodes_in_a_linked_list/SolutionTest.kt
+++ b/src/test/kotlin/g1701_1800/s1721_swapping_nodes_in_a_linked_list/SolutionTest.kt
@@ -12,7 +12,7 @@ internal class SolutionTest {
             Solution()
                 .swapNodes(contructLinkedList(intArrayOf(1, 2, 3, 4, 5)), 2)
                 .toString(),
-            equalTo(contructLinkedList(intArrayOf(1, 4, 3, 2, 5)).toString())
+            equalTo(contructLinkedList(intArrayOf(1, 4, 3, 2, 5)).toString()),
         )
     }
 
@@ -22,13 +22,13 @@ internal class SolutionTest {
             Solution()
                 .swapNodes(
                     contructLinkedList(intArrayOf(7, 9, 6, 6, 7, 8, 3, 0, 9, 5)),
-                    5
+                    5,
                 )
                 .toString(),
             equalTo(
                 contructLinkedList(intArrayOf(7, 9, 6, 6, 8, 7, 3, 0, 9, 5))
-                    .toString()
-            )
+                    .toString(),
+            ),
         )
     }
 }
diff --git a/src/test/kotlin/g1701_1800/s1722_minimize_hamming_distance_after_swap_operations/SolutionTest.kt b/src/test/kotlin/g1701_1800/s1722_minimize_hamming_distance_after_swap_operations/SolutionTest.kt
index d61cf32aa..1e978913e 100644
--- a/src/test/kotlin/g1701_1800/s1722_minimize_hamming_distance_after_swap_operations/SolutionTest.kt
+++ b/src/test/kotlin/g1701_1800/s1722_minimize_hamming_distance_after_swap_operations/SolutionTest.kt
@@ -10,10 +10,11 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .minimumHammingDistance(
-                    intArrayOf(1, 2, 3, 4), intArrayOf(2, 1, 4, 5),
-                    arrayOf(intArrayOf(0, 1), intArrayOf(2, 3))
+                    intArrayOf(1, 2, 3, 4),
+                    intArrayOf(2, 1, 4, 5),
+                    arrayOf(intArrayOf(0, 1), intArrayOf(2, 3)),
                 ),
-            equalTo(1)
+            equalTo(1),
         )
     }
 
@@ -26,10 +27,12 @@ internal class SolutionTest {
                     intArrayOf(1, 5, 4, 2, 3),
                     arrayOf(
                         intArrayOf(0, 4),
-                        intArrayOf(4, 2), intArrayOf(1, 3), intArrayOf(1, 4)
-                    )
+                        intArrayOf(4, 2),
+                        intArrayOf(1, 3),
+                        intArrayOf(1, 4),
+                    ),
                 ),
-            equalTo(0)
+            equalTo(0),
         )
     }
 
@@ -38,7 +41,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .minimumHammingDistance(intArrayOf(1, 2, 3, 4), intArrayOf(1, 3, 2, 4), arrayOf()),
-            equalTo(2)
+            equalTo(2),
         )
     }
 }
diff --git a/src/test/kotlin/g1701_1800/s1725_number_of_rectangles_that_can_form_the_largest_square/SolutionTest.kt b/src/test/kotlin/g1701_1800/s1725_number_of_rectangles_that_can_form_the_largest_square/SolutionTest.kt
index 43c3014dc..87194d55e 100644
--- a/src/test/kotlin/g1701_1800/s1725_number_of_rectangles_that_can_form_the_largest_square/SolutionTest.kt
+++ b/src/test/kotlin/g1701_1800/s1725_number_of_rectangles_that_can_form_the_largest_square/SolutionTest.kt
@@ -11,10 +11,12 @@ internal class SolutionTest {
             Solution().countGoodRectangles(
                 arrayOf(
                     intArrayOf(5, 8),
-                    intArrayOf(3, 9), intArrayOf(5, 12), intArrayOf(16, 5)
-                )
+                    intArrayOf(3, 9),
+                    intArrayOf(5, 12),
+                    intArrayOf(16, 5),
+                ),
             ),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
@@ -24,10 +26,12 @@ internal class SolutionTest {
             Solution().countGoodRectangles(
                 arrayOf(
                     intArrayOf(2, 3),
-                    intArrayOf(3, 7), intArrayOf(4, 3), intArrayOf(3, 7)
-                )
+                    intArrayOf(3, 7),
+                    intArrayOf(4, 3),
+                    intArrayOf(3, 7),
+                ),
             ),
-            equalTo(3)
+            equalTo(3),
         )
     }
 }
diff --git a/src/test/kotlin/g1701_1800/s1727_largest_submatrix_with_rearrangements/SolutionTest.kt b/src/test/kotlin/g1701_1800/s1727_largest_submatrix_with_rearrangements/SolutionTest.kt
index 12aaac86f..225c754b3 100644
--- a/src/test/kotlin/g1701_1800/s1727_largest_submatrix_with_rearrangements/SolutionTest.kt
+++ b/src/test/kotlin/g1701_1800/s1727_largest_submatrix_with_rearrangements/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun largestSubmatrix() {
         assertThat(
             Solution().largestSubmatrix(arrayOf(intArrayOf(0, 0, 1), intArrayOf(1, 1, 1), intArrayOf(1, 0, 1))),
-            equalTo(4)
+            equalTo(4),
         )
     }
 
diff --git a/src/test/kotlin/g1701_1800/s1728_cat_and_mouse_ii/SolutionTest.kt b/src/test/kotlin/g1701_1800/s1728_cat_and_mouse_ii/SolutionTest.kt
index 7706c8ec6..5977e6d91 100644
--- a/src/test/kotlin/g1701_1800/s1728_cat_and_mouse_ii/SolutionTest.kt
+++ b/src/test/kotlin/g1701_1800/s1728_cat_and_mouse_ii/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun canMouseWin() {
         assertThat(
             Solution().canMouseWin(arrayOf("####F", "#C...", "M...."), 1, 2),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
diff --git a/src/test/kotlin/g1701_1800/s1729_find_followers_count/MysqlTest.kt b/src/test/kotlin/g1701_1800/s1729_find_followers_count/MysqlTest.kt
index d981df112..33d187ac6 100644
--- a/src/test/kotlin/g1701_1800/s1729_find_followers_count/MysqlTest.kt
+++ b/src/test/kotlin/g1701_1800/s1729_find_followers_count/MysqlTest.kt
@@ -24,8 +24,8 @@ import javax.sql.DataSource
             "INSERT INTO Followers(user_id, follower_id) " +
             " VALUES (2, 0); " +
             "INSERT INTO Followers(user_id, follower_id) " +
-            " VALUES (2, 1); "
-    ]
+            " VALUES (2, 1); ",
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -37,12 +37,12 @@ internal class MysqlTest {
                     BufferedReader(
                         FileReader(
                             "src/main/kotlin/g1701_1800/s1729_find_fol" +
-                                "lowers_count/script.sql"
-                        )
+                                "lowers_count/script.sql",
+                        ),
                     )
                         .lines()
                         .collect(Collectors.joining("\n"))
-                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace("#.*?\\r?\\n".toRegex(), ""),
                 ).use { resultSet ->
                     assertThat(resultSet.next(), equalTo(true))
                     assertThat(resultSet.getInt(1), equalTo(0))
diff --git a/src/test/kotlin/g1701_1800/s1731_the_number_of_employees_which_report_to_each_employee/MysqlTest.kt b/src/test/kotlin/g1701_1800/s1731_the_number_of_employees_which_report_to_each_employee/MysqlTest.kt
index c0e1c5528..e8eb00587 100644
--- a/src/test/kotlin/g1701_1800/s1731_the_number_of_employees_which_report_to_each_employee/MysqlTest.kt
+++ b/src/test/kotlin/g1701_1800/s1731_the_number_of_employees_which_report_to_each_employee/MysqlTest.kt
@@ -25,8 +25,8 @@ import javax.sql.DataSource
             "INSERT INTO Employees(employee_id, name, reports_to, age) " +
             "VALUES (4, 'Bob', 9, 36); " +
             "INSERT INTO Employees(employee_id, name, reports_to, age) " +
-            "VALUES (2, 'Winston', null, 37); "
-    ]
+            "VALUES (2, 'Winston', null, 37); ",
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -38,12 +38,12 @@ internal class MysqlTest {
                     BufferedReader(
                         FileReader(
                             "src/main/kotlin/g1701_1800/" +
-                                "s1731_the_number_of_employees_which_report_to_each_employee/script.sql"
-                        )
+                                "s1731_the_number_of_employees_which_report_to_each_employee/script.sql",
+                        ),
                     )
                         .lines()
                         .collect(Collectors.joining("\n"))
-                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace("#.*?\\r?\\n".toRegex(), ""),
                 ).use { resultSet ->
                     assertThat(resultSet.next(), equalTo(true))
                     assertThat(resultSet.getInt(1), equalTo(9))
diff --git a/src/test/kotlin/g1701_1800/s1733_minimum_number_of_people_to_teach/SolutionTest.kt b/src/test/kotlin/g1701_1800/s1733_minimum_number_of_people_to_teach/SolutionTest.kt
index 633f03856..284f28ce9 100644
--- a/src/test/kotlin/g1701_1800/s1733_minimum_number_of_people_to_teach/SolutionTest.kt
+++ b/src/test/kotlin/g1701_1800/s1733_minimum_number_of_people_to_teach/SolutionTest.kt
@@ -10,10 +10,11 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .minimumTeachings(
-                    2, arrayOf(intArrayOf(1), intArrayOf(2), intArrayOf(1, 2)),
-                    arrayOf(intArrayOf(1, 2), intArrayOf(1, 3), intArrayOf(2, 3))
+                    2,
+                    arrayOf(intArrayOf(1), intArrayOf(2), intArrayOf(1, 2)),
+                    arrayOf(intArrayOf(1, 2), intArrayOf(1, 3), intArrayOf(2, 3)),
                 ),
-            equalTo(1)
+            equalTo(1),
         )
     }
 
@@ -24,15 +25,20 @@ internal class SolutionTest {
                 .minimumTeachings(
                     3,
                     arrayOf(
-                        intArrayOf(2), intArrayOf(1, 3), intArrayOf(1, 2),
-                        intArrayOf(3)
+                        intArrayOf(2),
+                        intArrayOf(1, 3),
+                        intArrayOf(1, 2),
+                        intArrayOf(3),
                     ),
                     arrayOf(
-                        intArrayOf(1, 4), intArrayOf(1, 2),
-                        intArrayOf(1, 3), intArrayOf(3, 4), intArrayOf(2, 3)
-                    )
+                        intArrayOf(1, 4),
+                        intArrayOf(1, 2),
+                        intArrayOf(1, 3),
+                        intArrayOf(3, 4),
+                        intArrayOf(2, 3),
+                    ),
                 ),
-            equalTo(2)
+            equalTo(2),
         )
     }
 }
diff --git a/src/test/kotlin/g1701_1800/s1734_decode_xored_permutation/SolutionTest.kt b/src/test/kotlin/g1701_1800/s1734_decode_xored_permutation/SolutionTest.kt
index aa076cdc6..95a0f22fb 100644
--- a/src/test/kotlin/g1701_1800/s1734_decode_xored_permutation/SolutionTest.kt
+++ b/src/test/kotlin/g1701_1800/s1734_decode_xored_permutation/SolutionTest.kt
@@ -13,7 +13,8 @@ internal class SolutionTest {
     @Test
     fun decode2() {
         assertThat(
-            Solution().decode(intArrayOf(6, 5, 4, 6)), equalTo(intArrayOf(2, 4, 1, 5, 3))
+            Solution().decode(intArrayOf(6, 5, 4, 6)),
+            equalTo(intArrayOf(2, 4, 1, 5, 3)),
         )
     }
 }
diff --git a/src/test/kotlin/g1701_1800/s1735_count_ways_to_make_array_with_product/SolutionTest.kt b/src/test/kotlin/g1701_1800/s1735_count_ways_to_make_array_with_product/SolutionTest.kt
index 3627631b2..45b0d0770 100644
--- a/src/test/kotlin/g1701_1800/s1735_count_ways_to_make_array_with_product/SolutionTest.kt
+++ b/src/test/kotlin/g1701_1800/s1735_count_ways_to_make_array_with_product/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun waysToFillArray() {
         assertThat(
             Solution().waysToFillArray(arrayOf(intArrayOf(2, 6), intArrayOf(5, 1), intArrayOf(73, 660))),
-            equalTo(intArrayOf(4, 1, 50734910))
+            equalTo(intArrayOf(4, 1, 50734910)),
         )
     }
 
@@ -19,11 +19,14 @@ internal class SolutionTest {
             Solution()
                 .waysToFillArray(
                     arrayOf(
-                        intArrayOf(1, 1), intArrayOf(2, 2), intArrayOf(3, 3),
-                        intArrayOf(4, 4), intArrayOf(5, 5)
-                    )
+                        intArrayOf(1, 1),
+                        intArrayOf(2, 2),
+                        intArrayOf(3, 3),
+                        intArrayOf(4, 4),
+                        intArrayOf(5, 5),
+                    ),
                 ),
-            equalTo(intArrayOf(1, 2, 3, 10, 5))
+            equalTo(intArrayOf(1, 2, 3, 10, 5)),
         )
     }
 }
diff --git a/src/test/kotlin/g1701_1800/s1741_find_total_time_spent_by_each_employee/MysqlTest.kt b/src/test/kotlin/g1701_1800/s1741_find_total_time_spent_by_each_employee/MysqlTest.kt
index d9ad60bed..460dcaac6 100644
--- a/src/test/kotlin/g1701_1800/s1741_find_total_time_spent_by_each_employee/MysqlTest.kt
+++ b/src/test/kotlin/g1701_1800/s1741_find_total_time_spent_by_each_employee/MysqlTest.kt
@@ -26,8 +26,8 @@ import javax.sql.DataSource
             "INSERT INTO Employees(emp_id, event_day, in_time, out_time) " +
             " VALUES (2, '2020-11-28', 3, 33); " +
             "INSERT INTO Employees(emp_id, event_day, in_time, out_time) " +
-            " VALUES (2, '2020-12-09', 47, 74); "
-    ]
+            " VALUES (2, '2020-12-09', 47, 74); ",
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -39,12 +39,12 @@ internal class MysqlTest {
                     BufferedReader(
                         FileReader(
                             "src/main/kotlin/g1701_1800/s1741_find_total_time_" +
-                                "spent_by_each_employee/script.sql"
-                        )
+                                "spent_by_each_employee/script.sql",
+                        ),
                     )
                         .lines()
                         .collect(Collectors.joining("\n"))
-                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace("#.*?\\r?\\n".toRegex(), ""),
                 ).use { resultSet ->
                     assertThat(resultSet.next(), equalTo(true))
                     assertThat(resultSet.getNString(1), equalTo("2020-11-28"))
diff --git a/src/test/kotlin/g1701_1800/s1743_restore_the_array_from_adjacent_pairs/SolutionTest.kt b/src/test/kotlin/g1701_1800/s1743_restore_the_array_from_adjacent_pairs/SolutionTest.kt
index b465bda92..552f28c28 100644
--- a/src/test/kotlin/g1701_1800/s1743_restore_the_array_from_adjacent_pairs/SolutionTest.kt
+++ b/src/test/kotlin/g1701_1800/s1743_restore_the_array_from_adjacent_pairs/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun restoreArray() {
         assertThat(
             Solution().restoreArray(arrayOf(intArrayOf(2, 1), intArrayOf(3, 4), intArrayOf(3, 2))),
-            equalTo(intArrayOf(1, 2, 3, 4))
+            equalTo(intArrayOf(1, 2, 3, 4)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun restoreArray2() {
         assertThat(
             Solution().restoreArray(arrayOf(intArrayOf(4, -2), intArrayOf(1, 4), intArrayOf(-3, 1))),
-            equalTo(intArrayOf(-2, 4, 1, -3))
+            equalTo(intArrayOf(-2, 4, 1, -3)),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun restoreArray3() {
         assertThat(
             Solution().restoreArray(arrayOf(intArrayOf(100000, -100000))),
-            equalTo(intArrayOf(100000, -100000))
+            equalTo(intArrayOf(100000, -100000)),
         )
     }
 }
diff --git a/src/test/kotlin/g1701_1800/s1744_can_you_eat_your_favorite_candy_on_your_favorite_day/SolutionTest.kt b/src/test/kotlin/g1701_1800/s1744_can_you_eat_your_favorite_candy_on_your_favorite_day/SolutionTest.kt
index 58d981be4..81b22576a 100644
--- a/src/test/kotlin/g1701_1800/s1744_can_you_eat_your_favorite_candy_on_your_favorite_day/SolutionTest.kt
+++ b/src/test/kotlin/g1701_1800/s1744_can_you_eat_your_favorite_candy_on_your_favorite_day/SolutionTest.kt
@@ -12,11 +12,12 @@ internal class SolutionTest {
                 .canEat(
                     intArrayOf(7, 4, 5, 3, 8),
                     arrayOf(
-                        intArrayOf(0, 2, 2), intArrayOf(4, 2, 4),
-                        intArrayOf(2, 13, 1000000000)
-                    )
+                        intArrayOf(0, 2, 2),
+                        intArrayOf(4, 2, 4),
+                        intArrayOf(2, 13, 1000000000),
+                    ),
                 ),
-            equalTo(booleanArrayOf(true, false, true))
+            equalTo(booleanArrayOf(true, false, true)),
         )
     }
 
@@ -28,11 +29,13 @@ internal class SolutionTest {
                     intArrayOf(5, 2, 6, 4, 1),
                     arrayOf(
                         intArrayOf(3, 1, 2),
-                        intArrayOf(4, 10, 3), intArrayOf(3, 10, 100),
-                        intArrayOf(4, 100, 30), intArrayOf(1, 3, 1)
-                    )
+                        intArrayOf(4, 10, 3),
+                        intArrayOf(3, 10, 100),
+                        intArrayOf(4, 100, 30),
+                        intArrayOf(1, 3, 1),
+                    ),
                 ),
-            equalTo(booleanArrayOf(false, true, true, false, false))
+            equalTo(booleanArrayOf(false, true, true, false, false)),
         )
     }
 }
diff --git a/src/test/kotlin/g1701_1800/s1751_maximum_number_of_events_that_can_be_attended_ii/SolutionTest.kt b/src/test/kotlin/g1701_1800/s1751_maximum_number_of_events_that_can_be_attended_ii/SolutionTest.kt
index 2f110501a..c0f4ada00 100644
--- a/src/test/kotlin/g1701_1800/s1751_maximum_number_of_events_that_can_be_attended_ii/SolutionTest.kt
+++ b/src/test/kotlin/g1701_1800/s1751_maximum_number_of_events_that_can_be_attended_ii/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun maxValue() {
         assertThat(
             Solution().maxValue(arrayOf(intArrayOf(1, 2, 4), intArrayOf(3, 4, 3), intArrayOf(2, 3, 1)), 2),
-            equalTo(7)
+            equalTo(7),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun maxValue2() {
         assertThat(
             Solution().maxValue(arrayOf(intArrayOf(1, 2, 4), intArrayOf(3, 4, 3), intArrayOf(2, 3, 10)), 2),
-            equalTo(10)
+            equalTo(10),
         )
     }
 
@@ -27,12 +27,14 @@ internal class SolutionTest {
             Solution()
                 .maxValue(
                     arrayOf(
-                        intArrayOf(1, 1, 1), intArrayOf(2, 2, 2), intArrayOf(3, 3, 3),
-                        intArrayOf(4, 4, 4)
+                        intArrayOf(1, 1, 1),
+                        intArrayOf(2, 2, 2),
+                        intArrayOf(3, 3, 3),
+                        intArrayOf(4, 4, 4),
                     ),
-                    3
+                    3,
                 ),
-            equalTo(9)
+            equalTo(9),
         )
     }
 
@@ -40,7 +42,7 @@ internal class SolutionTest {
     fun maxValue4() {
         assertThat(
             Solution().maxValue(arrayOf(intArrayOf(1, 2, 4), intArrayOf(3, 4, 3), intArrayOf(2, 3, 10)), 1),
-            equalTo(10)
+            equalTo(10),
         )
     }
 }
diff --git a/src/test/kotlin/g1701_1800/s1757_recyclable_and_low_fat_products/MysqlTest.kt b/src/test/kotlin/g1701_1800/s1757_recyclable_and_low_fat_products/MysqlTest.kt
index e2239956e..7ac5a894d 100644
--- a/src/test/kotlin/g1701_1800/s1757_recyclable_and_low_fat_products/MysqlTest.kt
+++ b/src/test/kotlin/g1701_1800/s1757_recyclable_and_low_fat_products/MysqlTest.kt
@@ -26,8 +26,8 @@ import javax.sql.DataSource
             "INSERT INTO Products(product_id, low_fats, recyclable)" +
             " VALUES (3, 'Y', 'Y'); " +
             "INSERT INTO Products(product_id, low_fats, recyclable)" +
-            " VALUES (4, 'N', 'N'); "
-    ]
+            " VALUES (4, 'N', 'N'); ",
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -39,12 +39,12 @@ internal class MysqlTest {
                     BufferedReader(
                         FileReader(
                             "src/main/kotlin/g1701_1800/s1757_recyclable_and" +
-                                "_low_fat_products/script.sql"
-                        )
+                                "_low_fat_products/script.sql",
+                        ),
                     )
                         .lines()
                         .collect(Collectors.joining("\n"))
-                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace("#.*?\\r?\\n".toRegex(), ""),
                 ).use { resultSet ->
                     assertThat(resultSet.next(), equalTo(true))
                     assertThat(resultSet.getInt(1), equalTo(1))
diff --git a/src/test/kotlin/g1701_1800/s1761_minimum_degree_of_a_connected_trio_in_a_graph/SolutionTest.kt b/src/test/kotlin/g1701_1800/s1761_minimum_degree_of_a_connected_trio_in_a_graph/SolutionTest.kt
index 844e9f9fa..65dd31892 100644
--- a/src/test/kotlin/g1701_1800/s1761_minimum_degree_of_a_connected_trio_in_a_graph/SolutionTest.kt
+++ b/src/test/kotlin/g1701_1800/s1761_minimum_degree_of_a_connected_trio_in_a_graph/SolutionTest.kt
@@ -12,11 +12,15 @@ internal class SolutionTest {
                 .minTrioDegree(
                     6,
                     arrayOf(
-                        intArrayOf(1, 2), intArrayOf(1, 3), intArrayOf(3, 2),
-                        intArrayOf(4, 1), intArrayOf(5, 2), intArrayOf(3, 6)
-                    )
+                        intArrayOf(1, 2),
+                        intArrayOf(1, 3),
+                        intArrayOf(3, 2),
+                        intArrayOf(4, 1),
+                        intArrayOf(5, 2),
+                        intArrayOf(3, 6),
+                    ),
                 ),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
@@ -27,12 +31,17 @@ internal class SolutionTest {
                 .minTrioDegree(
                     7,
                     arrayOf(
-                        intArrayOf(1, 3), intArrayOf(4, 1), intArrayOf(4, 3),
-                        intArrayOf(2, 5), intArrayOf(5, 6), intArrayOf(6, 7), intArrayOf(7, 5),
-                        intArrayOf(2, 6)
-                    )
+                        intArrayOf(1, 3),
+                        intArrayOf(4, 1),
+                        intArrayOf(4, 3),
+                        intArrayOf(2, 5),
+                        intArrayOf(5, 6),
+                        intArrayOf(6, 7),
+                        intArrayOf(7, 5),
+                        intArrayOf(2, 6),
+                    ),
                 ),
-            equalTo(0)
+            equalTo(0),
         )
     }
 }
diff --git a/src/test/kotlin/g1701_1800/s1764_form_array_by_concatenating_subarrays_of_another_array/SolutionTest.kt b/src/test/kotlin/g1701_1800/s1764_form_array_by_concatenating_subarrays_of_another_array/SolutionTest.kt
index 190e1581b..f6b6810c2 100644
--- a/src/test/kotlin/g1701_1800/s1764_form_array_by_concatenating_subarrays_of_another_array/SolutionTest.kt
+++ b/src/test/kotlin/g1701_1800/s1764_form_array_by_concatenating_subarrays_of_another_array/SolutionTest.kt
@@ -11,9 +11,9 @@ internal class SolutionTest {
             Solution()
                 .canChoose(
                     arrayOf(intArrayOf(1, -1, -1), intArrayOf(3, -2, 0)),
-                    intArrayOf(1, -1, 0, 1, -1, -1, 3, -2, 0)
+                    intArrayOf(1, -1, 0, 1, -1, -1, 3, -2, 0),
                 ),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
@@ -23,9 +23,9 @@ internal class SolutionTest {
             Solution()
                 .canChoose(
                     arrayOf(intArrayOf(10, -2), intArrayOf(1, 2, 3, 4)),
-                    intArrayOf(1, 2, 3, 4, 10, -2)
+                    intArrayOf(1, 2, 3, 4, 10, -2),
                 ),
-            equalTo(false)
+            equalTo(false),
         )
     }
 
@@ -34,7 +34,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .canChoose(arrayOf(intArrayOf(1, 2, 3), intArrayOf(3, 4)), intArrayOf(7, 7, 1, 2, 3, 4, 7, 7)),
-            equalTo(false)
+            equalTo(false),
         )
     }
 }
diff --git a/src/test/kotlin/g1701_1800/s1765_map_of_highest_peak/SolutionTest.kt b/src/test/kotlin/g1701_1800/s1765_map_of_highest_peak/SolutionTest.kt
index c9e198f56..59be39216 100644
--- a/src/test/kotlin/g1701_1800/s1765_map_of_highest_peak/SolutionTest.kt
+++ b/src/test/kotlin/g1701_1800/s1765_map_of_highest_peak/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun highestPeak() {
         assertThat(
             Solution().highestPeak(arrayOf(intArrayOf(0, 1), intArrayOf(0, 0))),
-            equalTo(arrayOf(intArrayOf(1, 0), intArrayOf(2, 1)))
+            equalTo(arrayOf(intArrayOf(1, 0), intArrayOf(2, 1))),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun highestPeak2() {
         assertThat(
             Solution().highestPeak(arrayOf(intArrayOf(0, 0, 1), intArrayOf(1, 0, 0), intArrayOf(0, 0, 0))),
-            equalTo(arrayOf(intArrayOf(1, 1, 0), intArrayOf(0, 1, 1), intArrayOf(1, 2, 2)))
+            equalTo(arrayOf(intArrayOf(1, 1, 0), intArrayOf(0, 1, 1), intArrayOf(1, 2, 2))),
         )
     }
 }
diff --git a/src/test/kotlin/g1701_1800/s1766_tree_of_coprimes/SolutionTest.kt b/src/test/kotlin/g1701_1800/s1766_tree_of_coprimes/SolutionTest.kt
index 0eb568de3..b1c563c09 100644
--- a/src/test/kotlin/g1701_1800/s1766_tree_of_coprimes/SolutionTest.kt
+++ b/src/test/kotlin/g1701_1800/s1766_tree_of_coprimes/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .getCoprimes(intArrayOf(2, 3, 3, 2), arrayOf(intArrayOf(0, 1), intArrayOf(1, 2), intArrayOf(1, 3))),
-            equalTo(intArrayOf(-1, 0, 0, 1))
+            equalTo(intArrayOf(-1, 0, 0, 1)),
         )
     }
 
@@ -22,11 +22,14 @@ internal class SolutionTest {
                     intArrayOf(5, 6, 10, 2, 3, 6, 15),
                     arrayOf(
                         intArrayOf(0, 1),
-                        intArrayOf(0, 2), intArrayOf(1, 3), intArrayOf(1, 4), intArrayOf(2, 5),
-                        intArrayOf(2, 6)
-                    )
+                        intArrayOf(0, 2),
+                        intArrayOf(1, 3),
+                        intArrayOf(1, 4),
+                        intArrayOf(2, 5),
+                        intArrayOf(2, 6),
+                    ),
                 ),
-            equalTo(intArrayOf(-1, 0, -1, 0, 0, 0, -1))
+            equalTo(intArrayOf(-1, 0, -1, 0, 0, 0, -1)),
         )
     }
 }
diff --git a/src/test/kotlin/g1701_1800/s1770_maximum_score_from_performing_multiplication_operations/SolutionTest.kt b/src/test/kotlin/g1701_1800/s1770_maximum_score_from_performing_multiplication_operations/SolutionTest.kt
index c6dc9d983..51c1af0df 100644
--- a/src/test/kotlin/g1701_1800/s1770_maximum_score_from_performing_multiplication_operations/SolutionTest.kt
+++ b/src/test/kotlin/g1701_1800/s1770_maximum_score_from_performing_multiplication_operations/SolutionTest.kt
@@ -8,7 +8,8 @@ internal class SolutionTest {
     @Test
     fun maximumScore() {
         assertThat(
-            Solution().maximumScore(intArrayOf(1, 2, 3), intArrayOf(3, 2, 1)), equalTo(14)
+            Solution().maximumScore(intArrayOf(1, 2, 3), intArrayOf(3, 2, 1)),
+            equalTo(14),
         )
     }
 
@@ -17,7 +18,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .maximumScore(intArrayOf(-5, -3, -3, -2, 7, 1), intArrayOf(-10, -5, 3, 4, 6)),
-            equalTo(102)
+            equalTo(102),
         )
     }
 }
diff --git a/src/test/kotlin/g1701_1800/s1773_count_items_matching_a_rule/SolutionTest.kt b/src/test/kotlin/g1701_1800/s1773_count_items_matching_a_rule/SolutionTest.kt
index 883dc6603..f6c4e92dc 100644
--- a/src/test/kotlin/g1701_1800/s1773_count_items_matching_a_rule/SolutionTest.kt
+++ b/src/test/kotlin/g1701_1800/s1773_count_items_matching_a_rule/SolutionTest.kt
@@ -12,12 +12,13 @@ internal class SolutionTest {
                 .countMatches(
                     listOf(
                         mutableListOf("phone", "blue", "pixel"),
-                        mutableListOf("computer", "silver", "lenovo"), mutableListOf("phone", "gold", "iphone")
+                        mutableListOf("computer", "silver", "lenovo"),
+                        mutableListOf("phone", "gold", "iphone"),
                     ),
                     "color",
-                    "silver"
+                    "silver",
                 ),
-            equalTo(1)
+            equalTo(1),
         )
     }
 
@@ -29,12 +30,12 @@ internal class SolutionTest {
                     listOf(
                         mutableListOf("phone", "blue", "pixel"),
                         mutableListOf("computer", "silver", "phone"),
-                        mutableListOf("phone", "gold", "iphone")
+                        mutableListOf("phone", "gold", "iphone"),
                     ),
                     "type",
-                    "phone"
+                    "phone",
                 ),
-            equalTo(2)
+            equalTo(2),
         )
     }
 }
diff --git a/src/test/kotlin/g1701_1800/s1774_closest_dessert_cost/SolutionTest.kt b/src/test/kotlin/g1701_1800/s1774_closest_dessert_cost/SolutionTest.kt
index ac8a42f7a..8c13ee3e0 100644
--- a/src/test/kotlin/g1701_1800/s1774_closest_dessert_cost/SolutionTest.kt
+++ b/src/test/kotlin/g1701_1800/s1774_closest_dessert_cost/SolutionTest.kt
@@ -14,7 +14,7 @@ internal class SolutionTest {
     fun closestCost2() {
         assertThat(
             Solution().closestCost(intArrayOf(2, 3), intArrayOf(4, 5, 100), 18),
-            equalTo(17)
+            equalTo(17),
         )
     }
 
diff --git a/src/test/kotlin/g1701_1800/s1775_equal_sum_arrays_with_minimum_number_of_operations/SolutionTest.kt b/src/test/kotlin/g1701_1800/s1775_equal_sum_arrays_with_minimum_number_of_operations/SolutionTest.kt
index 5a2f6092e..a3fa5e02d 100644
--- a/src/test/kotlin/g1701_1800/s1775_equal_sum_arrays_with_minimum_number_of_operations/SolutionTest.kt
+++ b/src/test/kotlin/g1701_1800/s1775_equal_sum_arrays_with_minimum_number_of_operations/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .minOperations(intArrayOf(1, 2, 3, 4, 5, 6), intArrayOf(1, 1, 2, 2, 2, 2)),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
@@ -18,7 +18,7 @@ internal class SolutionTest {
     fun minOperations2() {
         assertThat(
             Solution().minOperations(intArrayOf(1, 1, 1, 1, 1, 1, 1), intArrayOf(6)),
-            equalTo(-1)
+            equalTo(-1),
         )
     }
 
diff --git a/src/test/kotlin/g1701_1800/s1776_car_fleet_ii/SolutionTest.kt b/src/test/kotlin/g1701_1800/s1776_car_fleet_ii/SolutionTest.kt
index 72bebcb12..b1be92821 100644
--- a/src/test/kotlin/g1701_1800/s1776_car_fleet_ii/SolutionTest.kt
+++ b/src/test/kotlin/g1701_1800/s1776_car_fleet_ii/SolutionTest.kt
@@ -11,10 +11,12 @@ internal class SolutionTest {
             Solution().getCollisionTimes(
                 arrayOf(
                     intArrayOf(1, 2),
-                    intArrayOf(2, 1), intArrayOf(4, 3), intArrayOf(7, 2)
-                )
+                    intArrayOf(2, 1),
+                    intArrayOf(4, 3),
+                    intArrayOf(7, 2),
+                ),
             ),
-            equalTo(doubleArrayOf(1.00000, -1.00000, 3.00000, -1.00000))
+            equalTo(doubleArrayOf(1.00000, -1.00000, 3.00000, -1.00000)),
         )
     }
 
@@ -23,11 +25,13 @@ internal class SolutionTest {
         assertThat(
             Solution().getCollisionTimes(
                 arrayOf(
-                    intArrayOf(3, 4), intArrayOf(5, 4),
-                    intArrayOf(6, 3), intArrayOf(9, 1)
-                )
+                    intArrayOf(3, 4),
+                    intArrayOf(5, 4),
+                    intArrayOf(6, 3),
+                    intArrayOf(9, 1),
+                ),
             ),
-            equalTo(doubleArrayOf(2.00000, 1.00000, 1.50000, -1.00000))
+            equalTo(doubleArrayOf(2.00000, 1.00000, 1.50000, -1.00000)),
         )
     }
 }
diff --git a/src/test/kotlin/g1701_1800/s1779_find_nearest_point_that_has_the_same_x_or_y_coordinate/SolutionTest.kt b/src/test/kotlin/g1701_1800/s1779_find_nearest_point_that_has_the_same_x_or_y_coordinate/SolutionTest.kt
index a1bb88a18..0161c567e 100644
--- a/src/test/kotlin/g1701_1800/s1779_find_nearest_point_that_has_the_same_x_or_y_coordinate/SolutionTest.kt
+++ b/src/test/kotlin/g1701_1800/s1779_find_nearest_point_that_has_the_same_x_or_y_coordinate/SolutionTest.kt
@@ -10,13 +10,17 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .nearestValidPoint(
-                    3, 4,
+                    3,
+                    4,
                     arrayOf(
-                        intArrayOf(1, 2), intArrayOf(3, 1),
-                        intArrayOf(2, 4), intArrayOf(2, 3), intArrayOf(4, 4)
-                    )
+                        intArrayOf(1, 2),
+                        intArrayOf(3, 1),
+                        intArrayOf(2, 4),
+                        intArrayOf(2, 3),
+                        intArrayOf(4, 4),
+                    ),
                 ),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
diff --git a/src/test/kotlin/g1701_1800/s1782_count_pairs_of_nodes/SolutionTest.kt b/src/test/kotlin/g1701_1800/s1782_count_pairs_of_nodes/SolutionTest.kt
index 3fabdb940..092254da8 100644
--- a/src/test/kotlin/g1701_1800/s1782_count_pairs_of_nodes/SolutionTest.kt
+++ b/src/test/kotlin/g1701_1800/s1782_count_pairs_of_nodes/SolutionTest.kt
@@ -12,12 +12,15 @@ internal class SolutionTest {
                 .countPairs(
                     4,
                     arrayOf(
-                        intArrayOf(1, 2), intArrayOf(2, 4), intArrayOf(1, 3),
-                        intArrayOf(2, 3), intArrayOf(2, 1)
+                        intArrayOf(1, 2),
+                        intArrayOf(2, 4),
+                        intArrayOf(1, 3),
+                        intArrayOf(2, 3),
+                        intArrayOf(2, 1),
                     ),
-                    intArrayOf(2, 3)
+                    intArrayOf(2, 3),
                 ),
-            equalTo(intArrayOf(6, 5))
+            equalTo(intArrayOf(6, 5)),
         )
     }
 
@@ -28,13 +31,18 @@ internal class SolutionTest {
                 .countPairs(
                     5,
                     arrayOf(
-                        intArrayOf(1, 5), intArrayOf(1, 5), intArrayOf(3, 4),
-                        intArrayOf(2, 5), intArrayOf(1, 3), intArrayOf(5, 1),
-                        intArrayOf(2, 3), intArrayOf(2, 5)
+                        intArrayOf(1, 5),
+                        intArrayOf(1, 5),
+                        intArrayOf(3, 4),
+                        intArrayOf(2, 5),
+                        intArrayOf(1, 3),
+                        intArrayOf(5, 1),
+                        intArrayOf(2, 3),
+                        intArrayOf(2, 5),
                     ),
-                    intArrayOf(1, 2, 3, 4, 5)
+                    intArrayOf(1, 2, 3, 4, 5),
                 ),
-            equalTo(intArrayOf(10, 10, 9, 8, 6))
+            equalTo(intArrayOf(10, 10, 9, 8, 6)),
         )
     }
 }
diff --git a/src/test/kotlin/g1701_1800/s1786_number_of_restricted_paths_from_first_to_last_node/SolutionTest.kt b/src/test/kotlin/g1701_1800/s1786_number_of_restricted_paths_from_first_to_last_node/SolutionTest.kt
index 3589bcbae..c995d3d59 100644
--- a/src/test/kotlin/g1701_1800/s1786_number_of_restricted_paths_from_first_to_last_node/SolutionTest.kt
+++ b/src/test/kotlin/g1701_1800/s1786_number_of_restricted_paths_from_first_to_last_node/SolutionTest.kt
@@ -12,12 +12,16 @@ internal class SolutionTest {
                 .countRestrictedPaths(
                     5,
                     arrayOf(
-                        intArrayOf(1, 2, 3), intArrayOf(1, 3, 3),
-                        intArrayOf(2, 3, 1), intArrayOf(1, 4, 2), intArrayOf(5, 2, 2),
-                        intArrayOf(3, 5, 1), intArrayOf(5, 4, 10)
-                    )
+                        intArrayOf(1, 2, 3),
+                        intArrayOf(1, 3, 3),
+                        intArrayOf(2, 3, 1),
+                        intArrayOf(1, 4, 2),
+                        intArrayOf(5, 2, 2),
+                        intArrayOf(3, 5, 1),
+                        intArrayOf(5, 4, 10),
+                    ),
                 ),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
@@ -28,12 +32,17 @@ internal class SolutionTest {
                 .countRestrictedPaths(
                     7,
                     arrayOf(
-                        intArrayOf(1, 3, 1), intArrayOf(4, 1, 2), intArrayOf(7, 3, 4),
-                        intArrayOf(2, 5, 3), intArrayOf(5, 6, 1), intArrayOf(6, 7, 2), intArrayOf(7, 5, 3),
-                        intArrayOf(2, 6, 4)
-                    )
+                        intArrayOf(1, 3, 1),
+                        intArrayOf(4, 1, 2),
+                        intArrayOf(7, 3, 4),
+                        intArrayOf(2, 5, 3),
+                        intArrayOf(5, 6, 1),
+                        intArrayOf(6, 7, 2),
+                        intArrayOf(7, 5, 3),
+                        intArrayOf(2, 6, 4),
+                    ),
                 ),
-            equalTo(1)
+            equalTo(1),
         )
     }
 }
diff --git a/src/test/kotlin/g1701_1800/s1789_primary_department_for_each_employee/MysqlTest.kt b/src/test/kotlin/g1701_1800/s1789_primary_department_for_each_employee/MysqlTest.kt
index b939133c4..eaf228049 100644
--- a/src/test/kotlin/g1701_1800/s1789_primary_department_for_each_employee/MysqlTest.kt
+++ b/src/test/kotlin/g1701_1800/s1789_primary_department_for_each_employee/MysqlTest.kt
@@ -31,8 +31,8 @@ import javax.sql.DataSource
             "INSERT INTO Employee(employee_id, department_id, primary_flag) " +
             "VALUES (4, 3, 'Y'); " +
             "INSERT INTO Employee(employee_id, department_id, primary_flag) " +
-            "VALUES (4, 4, 'N'); "
-    ]
+            "VALUES (4, 4, 'N'); ",
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -44,12 +44,12 @@ internal class MysqlTest {
                     BufferedReader(
                         FileReader(
                             "src/main/kotlin/g1701_1800/" +
-                                "s1789_primary_department_for_each_employee/script.sql"
-                        )
+                                "s1789_primary_department_for_each_employee/script.sql",
+                        ),
                     )
                         .lines()
                         .collect(Collectors.joining("\n"))
-                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace("#.*?\\r?\\n".toRegex(), ""),
                 ).use { resultSet ->
                     assertThat(resultSet.next(), equalTo(true))
                     assertThat(resultSet.getInt(1), equalTo(1))
diff --git a/src/test/kotlin/g1701_1800/s1791_find_center_of_star_graph/SolutionTest.kt b/src/test/kotlin/g1701_1800/s1791_find_center_of_star_graph/SolutionTest.kt
index 83594ee3f..3112d1b37 100644
--- a/src/test/kotlin/g1701_1800/s1791_find_center_of_star_graph/SolutionTest.kt
+++ b/src/test/kotlin/g1701_1800/s1791_find_center_of_star_graph/SolutionTest.kt
@@ -14,7 +14,7 @@ internal class SolutionTest {
     fun findCenter2() {
         assertThat(
             Solution().findCenter(arrayOf(intArrayOf(1, 2), intArrayOf(5, 1), intArrayOf(1, 3), intArrayOf(1, 4))),
-            equalTo(1)
+            equalTo(1),
         )
     }
 }
diff --git a/src/test/kotlin/g1701_1800/s1792_maximum_average_pass_ratio/SolutionTest.kt b/src/test/kotlin/g1701_1800/s1792_maximum_average_pass_ratio/SolutionTest.kt
index e4e24ec1f..9fdcb5271 100644
--- a/src/test/kotlin/g1701_1800/s1792_maximum_average_pass_ratio/SolutionTest.kt
+++ b/src/test/kotlin/g1701_1800/s1792_maximum_average_pass_ratio/SolutionTest.kt
@@ -11,11 +11,12 @@ internal class SolutionTest {
             Solution().maxAverageRatio(
                 arrayOf(
                     intArrayOf(1, 2),
-                    intArrayOf(3, 5), intArrayOf(2, 2)
+                    intArrayOf(3, 5),
+                    intArrayOf(2, 2),
                 ),
-                2
+                2,
             ),
-            equalTo(0.7833333333333333)
+            equalTo(0.7833333333333333),
         )
     }
 
@@ -24,12 +25,14 @@ internal class SolutionTest {
         assertThat(
             Solution().maxAverageRatio(
                 arrayOf(
-                    intArrayOf(2, 4), intArrayOf(3, 9),
-                    intArrayOf(4, 5), intArrayOf(2, 10)
+                    intArrayOf(2, 4),
+                    intArrayOf(3, 9),
+                    intArrayOf(4, 5),
+                    intArrayOf(2, 10),
                 ),
-                4
+                4,
             ),
-            equalTo(0.5348484848484849)
+            equalTo(0.5348484848484849),
         )
     }
 }
diff --git a/src/test/kotlin/g1701_1800/s1795_rearrange_products_table/MysqlTest.kt b/src/test/kotlin/g1701_1800/s1795_rearrange_products_table/MysqlTest.kt
index c15ecbe43..4219fec5f 100644
--- a/src/test/kotlin/g1701_1800/s1795_rearrange_products_table/MysqlTest.kt
+++ b/src/test/kotlin/g1701_1800/s1795_rearrange_products_table/MysqlTest.kt
@@ -21,8 +21,8 @@ import javax.sql.DataSource
             "INSERT INTO Products(product_id, store1, store2, store3)" +
             " VALUES (0, 95, 100, 105); " +
             "INSERT INTO Products(product_id, store1, store2, store3)" +
-            " VALUES (1, 70, null, 80); "
-    ]
+            " VALUES (1, 70, null, 80); ",
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -34,12 +34,12 @@ internal class MysqlTest {
                     BufferedReader(
                         FileReader(
                             "src/main/kotlin/g1701_1800/s1795_rearrange" +
-                                "_products_table/script.sql"
-                        )
+                                "_products_table/script.sql",
+                        ),
                     )
                         .lines()
                         .collect(Collectors.joining("\n"))
-                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace("#.*?\\r?\\n".toRegex(), ""),
                 ).use { resultSet ->
                     assertThat(resultSet.next(), equalTo(true))
                     assertThat(resultSet.getInt(1), equalTo(0))
diff --git a/src/test/kotlin/g1701_1800/s1800_maximum_ascending_subarray_sum/SolutionTest.kt b/src/test/kotlin/g1701_1800/s1800_maximum_ascending_subarray_sum/SolutionTest.kt
index eee8df4fc..e559d8f5d 100644
--- a/src/test/kotlin/g1701_1800/s1800_maximum_ascending_subarray_sum/SolutionTest.kt
+++ b/src/test/kotlin/g1701_1800/s1800_maximum_ascending_subarray_sum/SolutionTest.kt
@@ -19,7 +19,7 @@ internal class SolutionTest {
     fun maxAscendingSum3() {
         assertThat(
             Solution().maxAscendingSum(intArrayOf(12, 17, 15, 13, 10, 11, 12)),
-            equalTo(33)
+            equalTo(33),
         )
     }
 }
diff --git a/src/test/kotlin/g1801_1900/s1801_number_of_orders_in_the_backlog/SolutionTest.kt b/src/test/kotlin/g1801_1900/s1801_number_of_orders_in_the_backlog/SolutionTest.kt
index 7a6a9122f..e52d6fa7f 100644
--- a/src/test/kotlin/g1801_1900/s1801_number_of_orders_in_the_backlog/SolutionTest.kt
+++ b/src/test/kotlin/g1801_1900/s1801_number_of_orders_in_the_backlog/SolutionTest.kt
@@ -14,10 +14,10 @@ internal class SolutionTest {
                         intArrayOf(10, 5, 0),
                         intArrayOf(15, 2, 1),
                         intArrayOf(25, 1, 1),
-                        intArrayOf(30, 4, 0)
-                    )
+                        intArrayOf(30, 4, 0),
+                    ),
                 ),
-            equalTo(6)
+            equalTo(6),
         )
     }
 
@@ -30,10 +30,10 @@ internal class SolutionTest {
                         intArrayOf(7, 1000000000, 1),
                         intArrayOf(15, 3, 0),
                         intArrayOf(5, 999999995, 0),
-                        intArrayOf(5, 1, 1)
-                    )
+                        intArrayOf(5, 1, 1),
+                    ),
                 ),
-            equalTo(999999984)
+            equalTo(999999984),
         )
     }
 }
diff --git a/src/test/kotlin/g1801_1900/s1807_evaluate_the_bracket_pairs_of_a_string/SolutionTest.kt b/src/test/kotlin/g1801_1900/s1807_evaluate_the_bracket_pairs_of_a_string/SolutionTest.kt
index 8278b39fb..83515759a 100644
--- a/src/test/kotlin/g1801_1900/s1807_evaluate_the_bracket_pairs_of_a_string/SolutionTest.kt
+++ b/src/test/kotlin/g1801_1900/s1807_evaluate_the_bracket_pairs_of_a_string/SolutionTest.kt
@@ -12,10 +12,11 @@ internal class SolutionTest {
                 .evaluate(
                     "(name)is(age)yearsold",
                     listOf(
-                        listOf("name", "bob"), listOf("age", "two")
-                    )
+                        listOf("name", "bob"),
+                        listOf("age", "two"),
+                    ),
                 ),
-            equalTo("bobistwoyearsold")
+            equalTo("bobistwoyearsold"),
         )
     }
 
@@ -24,7 +25,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .evaluate("hi(name)", listOf(listOf("a", "b"))),
-            equalTo("hi?")
+            equalTo("hi?"),
         )
     }
 
@@ -35,10 +36,11 @@ internal class SolutionTest {
                 .evaluate(
                     "(a)(a)(a)aaa",
                     listOf(
-                        listOf("a", "yes"), listOf("age", "two")
-                    )
+                        listOf("a", "yes"),
+                        listOf("age", "two"),
+                    ),
                 ),
-            equalTo("yesyesyesaaa")
+            equalTo("yesyesyesaaa"),
         )
     }
 }
diff --git a/src/test/kotlin/g1801_1900/s1813_sentence_similarity_iii/SolutionTest.kt b/src/test/kotlin/g1801_1900/s1813_sentence_similarity_iii/SolutionTest.kt
index ddfad6734..39fefed10 100644
--- a/src/test/kotlin/g1801_1900/s1813_sentence_similarity_iii/SolutionTest.kt
+++ b/src/test/kotlin/g1801_1900/s1813_sentence_similarity_iii/SolutionTest.kt
@@ -8,7 +8,8 @@ internal class SolutionTest {
     @Test
     fun areSentencesSimilar() {
         assertThat(
-            Solution().areSentencesSimilar("My name is Haley", "My Haley"), equalTo(true)
+            Solution().areSentencesSimilar("My name is Haley", "My Haley"),
+            equalTo(true),
         )
     }
 
@@ -21,7 +22,7 @@ internal class SolutionTest {
     fun areSentencesSimilar3() {
         assertThat(
             Solution().areSentencesSimilar("Eating right now", "Eating"),
-            equalTo(true)
+            equalTo(true),
         )
     }
 }
diff --git a/src/test/kotlin/g1801_1900/s1815_maximum_number_of_groups_getting_fresh_donuts/SolutionTest.kt b/src/test/kotlin/g1801_1900/s1815_maximum_number_of_groups_getting_fresh_donuts/SolutionTest.kt
index 260f2539a..517fd47a1 100644
--- a/src/test/kotlin/g1801_1900/s1815_maximum_number_of_groups_getting_fresh_donuts/SolutionTest.kt
+++ b/src/test/kotlin/g1801_1900/s1815_maximum_number_of_groups_getting_fresh_donuts/SolutionTest.kt
@@ -13,7 +13,8 @@ internal class SolutionTest {
     @Test
     fun maxHappyGroups2() {
         assertThat(
-            Solution().maxHappyGroups(4, intArrayOf(1, 3, 2, 5, 2, 2, 1, 6)), equalTo(4)
+            Solution().maxHappyGroups(4, intArrayOf(1, 3, 2, 5, 2, 2, 1, 6)),
+            equalTo(4),
         )
     }
 }
diff --git a/src/test/kotlin/g1801_1900/s1816_truncate_sentence/SolutionTest.kt b/src/test/kotlin/g1801_1900/s1816_truncate_sentence/SolutionTest.kt
index fa168930d..7305c62b2 100644
--- a/src/test/kotlin/g1801_1900/s1816_truncate_sentence/SolutionTest.kt
+++ b/src/test/kotlin/g1801_1900/s1816_truncate_sentence/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun truncateSentence() {
         assertThat(
             Solution().truncateSentence("Hello how are you Contestant", 4),
-            equalTo("Hello how are you")
+            equalTo("Hello how are you"),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun truncateSentence2() {
         assertThat(
             Solution().truncateSentence("What is the solution to this problem", 4),
-            equalTo("What is the solution")
+            equalTo("What is the solution"),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun truncateSentence3() {
         assertThat(
             Solution().truncateSentence("chopper is not a tanuki", 5),
-            equalTo("chopper is not a tanuki")
+            equalTo("chopper is not a tanuki"),
         )
     }
 }
diff --git a/src/test/kotlin/g1801_1900/s1817_finding_the_users_active_minutes/SolutionTest.kt b/src/test/kotlin/g1801_1900/s1817_finding_the_users_active_minutes/SolutionTest.kt
index 6ad17916f..9c2b4ac81 100644
--- a/src/test/kotlin/g1801_1900/s1817_finding_the_users_active_minutes/SolutionTest.kt
+++ b/src/test/kotlin/g1801_1900/s1817_finding_the_users_active_minutes/SolutionTest.kt
@@ -15,11 +15,11 @@ internal class SolutionTest {
                         intArrayOf(1, 2),
                         intArrayOf(0, 2),
                         intArrayOf(0, 5),
-                        intArrayOf(1, 3)
+                        intArrayOf(1, 3),
                     ),
-                    5
+                    5,
                 ),
-            equalTo(intArrayOf(0, 2, 0, 0, 0))
+            equalTo(intArrayOf(0, 2, 0, 0, 0)),
         )
     }
 
@@ -27,7 +27,7 @@ internal class SolutionTest {
     fun findingUsersActiveMinutes2() {
         assertThat(
             Solution().findingUsersActiveMinutes(arrayOf(intArrayOf(1, 1), intArrayOf(2, 2), intArrayOf(2, 3)), 4),
-            equalTo(intArrayOf(1, 1, 0, 0))
+            equalTo(intArrayOf(1, 1, 0, 0)),
         )
     }
 }
diff --git a/src/test/kotlin/g1801_1900/s1818_minimum_absolute_sum_difference/SolutionTest.kt b/src/test/kotlin/g1801_1900/s1818_minimum_absolute_sum_difference/SolutionTest.kt
index 48fc1e937..0a4853870 100644
--- a/src/test/kotlin/g1801_1900/s1818_minimum_absolute_sum_difference/SolutionTest.kt
+++ b/src/test/kotlin/g1801_1900/s1818_minimum_absolute_sum_difference/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun minAbsoluteSumDiff() {
         assertThat(
             Solution().minAbsoluteSumDiff(intArrayOf(1, 7, 5), intArrayOf(2, 3, 5)),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
@@ -18,7 +18,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .minAbsoluteSumDiff(intArrayOf(2, 4, 6, 8, 10), intArrayOf(2, 4, 6, 8, 10)),
-            equalTo(0)
+            equalTo(0),
         )
     }
 
@@ -27,7 +27,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .minAbsoluteSumDiff(intArrayOf(1, 10, 4, 4, 2, 7), intArrayOf(9, 3, 5, 1, 7, 4)),
-            equalTo(20)
+            equalTo(20),
         )
     }
 }
diff --git a/src/test/kotlin/g1801_1900/s1819_number_of_different_subsequences_gcds/SolutionTest.kt b/src/test/kotlin/g1801_1900/s1819_number_of_different_subsequences_gcds/SolutionTest.kt
index 620924459..4d045c6ad 100644
--- a/src/test/kotlin/g1801_1900/s1819_number_of_different_subsequences_gcds/SolutionTest.kt
+++ b/src/test/kotlin/g1801_1900/s1819_number_of_different_subsequences_gcds/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun countDifferentSubsequenceGCDs() {
         assertThat(
             Solution().countDifferentSubsequenceGCDs(intArrayOf(6, 10, 3)),
-            equalTo(5)
+            equalTo(5),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun countDifferentSubsequenceGCDs2() {
         assertThat(
             Solution().countDifferentSubsequenceGCDs(intArrayOf(5, 15, 40, 5, 6)),
-            equalTo(7)
+            equalTo(7),
         )
     }
 }
diff --git a/src/test/kotlin/g1801_1900/s1828_queries_on_number_of_points_inside_a_circle/SolutionTest.kt b/src/test/kotlin/g1801_1900/s1828_queries_on_number_of_points_inside_a_circle/SolutionTest.kt
index 2c4ef3e3d..8af40f5a3 100644
--- a/src/test/kotlin/g1801_1900/s1828_queries_on_number_of_points_inside_a_circle/SolutionTest.kt
+++ b/src/test/kotlin/g1801_1900/s1828_queries_on_number_of_points_inside_a_circle/SolutionTest.kt
@@ -11,9 +11,9 @@ internal class SolutionTest {
             Solution()
                 .countPoints(
                     arrayOf(intArrayOf(1, 3), intArrayOf(3, 3), intArrayOf(5, 3), intArrayOf(2, 2)),
-                    arrayOf(intArrayOf(2, 3, 1), intArrayOf(4, 3, 1), intArrayOf(1, 1, 2))
+                    arrayOf(intArrayOf(2, 3, 1), intArrayOf(4, 3, 1), intArrayOf(1, 1, 2)),
                 ),
-            equalTo(intArrayOf(3, 2, 2))
+            equalTo(intArrayOf(3, 2, 2)),
         )
     }
 
@@ -27,11 +27,11 @@ internal class SolutionTest {
                         intArrayOf(2, 2),
                         intArrayOf(3, 3),
                         intArrayOf(4, 4),
-                        intArrayOf(5, 5)
+                        intArrayOf(5, 5),
                     ),
-                    arrayOf(intArrayOf(1, 2, 2), intArrayOf(2, 2, 2), intArrayOf(4, 3, 2), intArrayOf(4, 3, 3))
+                    arrayOf(intArrayOf(1, 2, 2), intArrayOf(2, 2, 2), intArrayOf(4, 3, 2), intArrayOf(4, 3, 3)),
                 ),
-            equalTo(intArrayOf(2, 3, 2, 4))
+            equalTo(intArrayOf(2, 3, 2, 4)),
         )
     }
 }
diff --git a/src/test/kotlin/g1801_1900/s1829_maximum_xor_for_each_query/SolutionTest.kt b/src/test/kotlin/g1801_1900/s1829_maximum_xor_for_each_query/SolutionTest.kt
index 0af69b3a7..dddd63cf8 100644
--- a/src/test/kotlin/g1801_1900/s1829_maximum_xor_for_each_query/SolutionTest.kt
+++ b/src/test/kotlin/g1801_1900/s1829_maximum_xor_for_each_query/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun maximumXor() {
         assertThat(
             Solution().getMaximumXor(intArrayOf(0, 1, 1, 3), 2),
-            equalTo(intArrayOf(0, 3, 2, 3))
+            equalTo(intArrayOf(0, 3, 2, 3)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun maximumXor2() {
         assertThat(
             Solution().getMaximumXor(intArrayOf(2, 3, 4, 7), 3),
-            equalTo(intArrayOf(5, 2, 6, 5))
+            equalTo(intArrayOf(5, 2, 6, 5)),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun maximumXor3() {
         assertThat(
             Solution().getMaximumXor(intArrayOf(0, 1, 2, 2, 5, 7), 3),
-            equalTo(intArrayOf(4, 3, 6, 4, 6, 7))
+            equalTo(intArrayOf(4, 3, 6, 4, 6, 7)),
         )
     }
 }
diff --git a/src/test/kotlin/g1801_1900/s1832_check_if_the_sentence_is_pangram/SolutionTest.kt b/src/test/kotlin/g1801_1900/s1832_check_if_the_sentence_is_pangram/SolutionTest.kt
index 1a198c9eb..6650aa119 100644
--- a/src/test/kotlin/g1801_1900/s1832_check_if_the_sentence_is_pangram/SolutionTest.kt
+++ b/src/test/kotlin/g1801_1900/s1832_check_if_the_sentence_is_pangram/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun checkIfPangram() {
         assertThat(
             Solution().checkIfPangram("thequickbrownfoxjumpsoverthelazydog"),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
diff --git a/src/test/kotlin/g1801_1900/s1834_single_threaded_cpu/SolutionTest.kt b/src/test/kotlin/g1801_1900/s1834_single_threaded_cpu/SolutionTest.kt
index e9e99c342..81ce192e7 100644
--- a/src/test/kotlin/g1801_1900/s1834_single_threaded_cpu/SolutionTest.kt
+++ b/src/test/kotlin/g1801_1900/s1834_single_threaded_cpu/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun order() {
         assertThat(
             Solution().getOrder(arrayOf(intArrayOf(1, 2), intArrayOf(2, 4), intArrayOf(3, 2), intArrayOf(4, 1))),
-            equalTo(intArrayOf(0, 2, 3, 1))
+            equalTo(intArrayOf(0, 2, 3, 1)),
         )
     }
 
@@ -22,10 +22,10 @@ internal class SolutionTest {
                     intArrayOf(7, 12),
                     intArrayOf(7, 5),
                     intArrayOf(7, 4),
-                    intArrayOf(7, 2)
-                )
+                    intArrayOf(7, 2),
+                ),
             ),
-            equalTo(intArrayOf(4, 3, 2, 0, 1))
+            equalTo(intArrayOf(4, 3, 2, 0, 1)),
         )
     }
 }
diff --git a/src/test/kotlin/g1801_1900/s1835_find_xor_sum_of_all_pairs_bitwise_and/SolutionTest.kt b/src/test/kotlin/g1801_1900/s1835_find_xor_sum_of_all_pairs_bitwise_and/SolutionTest.kt
index 640743234..de2fea55b 100644
--- a/src/test/kotlin/g1801_1900/s1835_find_xor_sum_of_all_pairs_bitwise_and/SolutionTest.kt
+++ b/src/test/kotlin/g1801_1900/s1835_find_xor_sum_of_all_pairs_bitwise_and/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun xORSum() {
         assertThat(
             Solution().getXORSum(intArrayOf(1, 2, 3), intArrayOf(6, 5)),
-            equalTo(0)
+            equalTo(0),
         )
     }
 
diff --git a/src/test/kotlin/g1801_1900/s1839_longest_substring_of_all_vowels_in_order/SolutionTest.kt b/src/test/kotlin/g1801_1900/s1839_longest_substring_of_all_vowels_in_order/SolutionTest.kt
index 805b54799..4a0444a59 100644
--- a/src/test/kotlin/g1801_1900/s1839_longest_substring_of_all_vowels_in_order/SolutionTest.kt
+++ b/src/test/kotlin/g1801_1900/s1839_longest_substring_of_all_vowels_in_order/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun longestBeautifulSubstring() {
         assertThat(
             Solution().longestBeautifulSubstring("aeiaaioaaaaeiiiiouuuooaauuaeiu"),
-            equalTo(13)
+            equalTo(13),
         )
     }
 
diff --git a/src/test/kotlin/g1801_1900/s1840_maximum_building_height/SolutionTest.kt b/src/test/kotlin/g1801_1900/s1840_maximum_building_height/SolutionTest.kt
index 88d1357bb..4e932ad19 100644
--- a/src/test/kotlin/g1801_1900/s1840_maximum_building_height/SolutionTest.kt
+++ b/src/test/kotlin/g1801_1900/s1840_maximum_building_height/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun maxBuilding() {
         assertThat(
             Solution().maxBuilding(5, arrayOf(intArrayOf(2, 1), intArrayOf(4, 1))),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -22,7 +22,7 @@ internal class SolutionTest {
     fun maxBuilding3() {
         assertThat(
             Solution().maxBuilding(5, arrayOf(intArrayOf(5, 3), intArrayOf(2, 5), intArrayOf(7, 4), intArrayOf(10, 3))),
-            equalTo(5)
+            equalTo(5),
         )
     }
 }
diff --git a/src/test/kotlin/g1801_1900/s1846_maximum_element_after_decreasing_and_rearranging/SolutionTest.kt b/src/test/kotlin/g1801_1900/s1846_maximum_element_after_decreasing_and_rearranging/SolutionTest.kt
index 2acfe10a6..22b1c8d85 100644
--- a/src/test/kotlin/g1801_1900/s1846_maximum_element_after_decreasing_and_rearranging/SolutionTest.kt
+++ b/src/test/kotlin/g1801_1900/s1846_maximum_element_after_decreasing_and_rearranging/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .maximumElementAfterDecrementingAndRearranging(intArrayOf(2, 2, 1, 2, 1)),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -19,7 +19,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .maximumElementAfterDecrementingAndRearranging(intArrayOf(100, 1, 1000)),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
@@ -28,7 +28,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .maximumElementAfterDecrementingAndRearranging(intArrayOf(1, 2, 3, 4, 5)),
-            equalTo(5)
+            equalTo(5),
         )
     }
 }
diff --git a/src/test/kotlin/g1801_1900/s1847_closest_room/SolutionTest.kt b/src/test/kotlin/g1801_1900/s1847_closest_room/SolutionTest.kt
index 9dd29f27e..ea8bbf876 100644
--- a/src/test/kotlin/g1801_1900/s1847_closest_room/SolutionTest.kt
+++ b/src/test/kotlin/g1801_1900/s1847_closest_room/SolutionTest.kt
@@ -11,9 +11,9 @@ internal class SolutionTest {
             Solution()
                 .closestRoom(
                     arrayOf(intArrayOf(2, 2), intArrayOf(1, 2), intArrayOf(3, 2)),
-                    arrayOf(intArrayOf(3, 1), intArrayOf(3, 3), intArrayOf(5, 2))
+                    arrayOf(intArrayOf(3, 1), intArrayOf(3, 3), intArrayOf(5, 2)),
                 ),
-            equalTo(intArrayOf(3, -1, 3))
+            equalTo(intArrayOf(3, -1, 3)),
         )
     }
 
@@ -27,11 +27,11 @@ internal class SolutionTest {
                         intArrayOf(2, 3),
                         intArrayOf(3, 5),
                         intArrayOf(4, 1),
-                        intArrayOf(5, 2)
+                        intArrayOf(5, 2),
                     ),
-                    arrayOf(intArrayOf(2, 3), intArrayOf(2, 4), intArrayOf(2, 5))
+                    arrayOf(intArrayOf(2, 3), intArrayOf(2, 4), intArrayOf(2, 5)),
                 ),
-            equalTo(intArrayOf(2, 1, 3))
+            equalTo(intArrayOf(2, 1, 3)),
         )
     }
 }
diff --git a/src/test/kotlin/g1801_1900/s1848_minimum_distance_to_the_target_element/SolutionTest.kt b/src/test/kotlin/g1801_1900/s1848_minimum_distance_to_the_target_element/SolutionTest.kt
index 8383f1632..aa115a3e1 100644
--- a/src/test/kotlin/g1801_1900/s1848_minimum_distance_to_the_target_element/SolutionTest.kt
+++ b/src/test/kotlin/g1801_1900/s1848_minimum_distance_to_the_target_element/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun minDistance() {
         assertThat(
             Solution().getMinDistance(intArrayOf(1, 2, 3, 4, 5), 5, 3),
-            equalTo(1)
+            equalTo(1),
         )
     }
 
@@ -22,7 +22,7 @@ internal class SolutionTest {
     fun minDistance3() {
         assertThat(
             Solution().getMinDistance(intArrayOf(1, 1, 1, 1, 1, 1, 1, 1, 1, 1), 5, 3),
-            equalTo(0)
+            equalTo(0),
         )
     }
 }
diff --git a/src/test/kotlin/g1801_1900/s1851_minimum_interval_to_include_each_query/SolutionTest.kt b/src/test/kotlin/g1801_1900/s1851_minimum_interval_to_include_each_query/SolutionTest.kt
index 247796f37..d41357778 100644
--- a/src/test/kotlin/g1801_1900/s1851_minimum_interval_to_include_each_query/SolutionTest.kt
+++ b/src/test/kotlin/g1801_1900/s1851_minimum_interval_to_include_each_query/SolutionTest.kt
@@ -11,9 +11,9 @@ internal class SolutionTest {
             Solution()
                 .minInterval(
                     arrayOf(intArrayOf(1, 4), intArrayOf(2, 4), intArrayOf(3, 6), intArrayOf(4, 4)),
-                    intArrayOf(2, 3, 4, 5)
+                    intArrayOf(2, 3, 4, 5),
                 ),
-            equalTo(intArrayOf(3, 3, 1, 4))
+            equalTo(intArrayOf(3, 3, 1, 4)),
         )
     }
 
@@ -23,9 +23,9 @@ internal class SolutionTest {
             Solution()
                 .minInterval(
                     arrayOf(intArrayOf(2, 3), intArrayOf(2, 5), intArrayOf(1, 8), intArrayOf(20, 25)),
-                    intArrayOf(2, 19, 5, 22)
+                    intArrayOf(2, 19, 5, 22),
                 ),
-            equalTo(intArrayOf(2, -1, 4, 6))
+            equalTo(intArrayOf(2, -1, 4, 6)),
         )
     }
 }
diff --git a/src/test/kotlin/g1801_1900/s1854_maximum_population_year/SolutionTest.kt b/src/test/kotlin/g1801_1900/s1854_maximum_population_year/SolutionTest.kt
index 6cf15b347..d7b8f4786 100644
--- a/src/test/kotlin/g1801_1900/s1854_maximum_population_year/SolutionTest.kt
+++ b/src/test/kotlin/g1801_1900/s1854_maximum_population_year/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun maximumPopulation() {
         assertThat(
             Solution().maximumPopulation(arrayOf(intArrayOf(1993, 1999), intArrayOf(2000, 2010))),
-            equalTo(1993)
+            equalTo(1993),
         )
     }
 
@@ -18,7 +18,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .maximumPopulation(arrayOf(intArrayOf(1950, 1961), intArrayOf(1960, 1971), intArrayOf(1970, 1981))),
-            equalTo(1960)
+            equalTo(1960),
         )
     }
 }
diff --git a/src/test/kotlin/g1801_1900/s1855_maximum_distance_between_a_pair_of_values/SolutionTest.kt b/src/test/kotlin/g1801_1900/s1855_maximum_distance_between_a_pair_of_values/SolutionTest.kt
index f72ab7de5..8dd390cdc 100644
--- a/src/test/kotlin/g1801_1900/s1855_maximum_distance_between_a_pair_of_values/SolutionTest.kt
+++ b/src/test/kotlin/g1801_1900/s1855_maximum_distance_between_a_pair_of_values/SolutionTest.kt
@@ -10,14 +10,15 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .maxDistance(intArrayOf(55, 30, 5, 4, 2), intArrayOf(100, 20, 10, 10, 5)),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
     @Test
     fun maxDistance2() {
         assertThat(
-            Solution().maxDistance(intArrayOf(2, 2, 2), intArrayOf(10, 10, 1)), equalTo(1)
+            Solution().maxDistance(intArrayOf(2, 2, 2), intArrayOf(10, 10, 1)),
+            equalTo(1),
         )
     }
 
@@ -26,7 +27,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .maxDistance(intArrayOf(30, 29, 19, 5), intArrayOf(25, 25, 25, 25, 25)),
-            equalTo(2)
+            equalTo(2),
         )
     }
 }
diff --git a/src/test/kotlin/g1801_1900/s1857_largest_color_value_in_a_directed_graph/SolutionTest.kt b/src/test/kotlin/g1801_1900/s1857_largest_color_value_in_a_directed_graph/SolutionTest.kt
index 249143eaa..61d69c0e7 100644
--- a/src/test/kotlin/g1801_1900/s1857_largest_color_value_in_a_directed_graph/SolutionTest.kt
+++ b/src/test/kotlin/g1801_1900/s1857_largest_color_value_in_a_directed_graph/SolutionTest.kt
@@ -11,9 +11,9 @@ internal class SolutionTest {
             Solution()
                 .largestPathValue(
                     "abaca",
-                    arrayOf(intArrayOf(0, 1), intArrayOf(0, 2), intArrayOf(2, 3), intArrayOf(3, 4))
+                    arrayOf(intArrayOf(0, 1), intArrayOf(0, 2), intArrayOf(2, 3), intArrayOf(3, 4)),
                 ),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
diff --git a/src/test/kotlin/g1801_1900/s1859_sorting_the_sentence/SolutionTest.kt b/src/test/kotlin/g1801_1900/s1859_sorting_the_sentence/SolutionTest.kt
index 95478a498..3759e54a5 100644
--- a/src/test/kotlin/g1801_1900/s1859_sorting_the_sentence/SolutionTest.kt
+++ b/src/test/kotlin/g1801_1900/s1859_sorting_the_sentence/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun sortSentence() {
         assertThat(
             Solution().sortSentence("is2 sentence4 This1 a3"),
-            equalTo("This is a sentence")
+            equalTo("This is a sentence"),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun sortSentence2() {
         assertThat(
             Solution().sortSentence("Myself2 Me1 I4 and3"),
-            equalTo("Me Myself and I")
+            equalTo("Me Myself and I"),
         )
     }
 }
diff --git a/src/test/kotlin/g1801_1900/s1861_rotating_the_box/SolutionTest.kt b/src/test/kotlin/g1801_1900/s1861_rotating_the_box/SolutionTest.kt
index 2166fd769..f63ec4d4b 100644
--- a/src/test/kotlin/g1801_1900/s1861_rotating_the_box/SolutionTest.kt
+++ b/src/test/kotlin/g1801_1900/s1861_rotating_the_box/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun rotateTheBox() {
         assertThat(
             Solution().rotateTheBox(arrayOf(charArrayOf('#', '.', '#'))),
-            equalTo(arrayOf(charArrayOf('.'), charArrayOf('#'), charArrayOf('#')))
+            equalTo(arrayOf(charArrayOf('.'), charArrayOf('#'), charArrayOf('#'))),
         )
     }
 
@@ -23,9 +23,9 @@ internal class SolutionTest {
                     charArrayOf('#', '.'),
                     charArrayOf('#', '#'),
                     charArrayOf('*', '*'),
-                    charArrayOf('.', '.')
-                )
-            )
+                    charArrayOf('.', '.'),
+                ),
+            ),
         )
     }
 
@@ -37,8 +37,8 @@ internal class SolutionTest {
                     arrayOf(
                         charArrayOf('#', '#', '*', '.', '*', '.'),
                         charArrayOf('#', '#', '#', '*', '.', '.'),
-                        charArrayOf('#', '#', '#', '.', '#', '.')
-                    )
+                        charArrayOf('#', '#', '#', '.', '#', '.'),
+                    ),
                 ),
             equalTo(
                 arrayOf(
@@ -47,9 +47,9 @@ internal class SolutionTest {
                     charArrayOf('#', '#', '*'),
                     charArrayOf('#', '*', '.'),
                     charArrayOf('#', '.', '*'),
-                    charArrayOf('#', '.', '.')
-                )
-            )
+                    charArrayOf('#', '.', '.'),
+                ),
+            ),
         )
     }
 }
diff --git a/src/test/kotlin/g1801_1900/s1862_sum_of_floored_pairs/SolutionTest.kt b/src/test/kotlin/g1801_1900/s1862_sum_of_floored_pairs/SolutionTest.kt
index da85fbacb..aa0f65f33 100644
--- a/src/test/kotlin/g1801_1900/s1862_sum_of_floored_pairs/SolutionTest.kt
+++ b/src/test/kotlin/g1801_1900/s1862_sum_of_floored_pairs/SolutionTest.kt
@@ -14,7 +14,7 @@ internal class SolutionTest {
     fun sumOfFlooredPairs2() {
         assertThat(
             Solution().sumOfFlooredPairs(intArrayOf(7, 7, 7, 7, 7, 7, 7)),
-            equalTo(49)
+            equalTo(49),
         )
     }
 }
diff --git a/src/test/kotlin/g1801_1900/s1872_stone_game_viii/SolutionTest.kt b/src/test/kotlin/g1801_1900/s1872_stone_game_viii/SolutionTest.kt
index fa09f8018..c6bdc1995 100644
--- a/src/test/kotlin/g1801_1900/s1872_stone_game_viii/SolutionTest.kt
+++ b/src/test/kotlin/g1801_1900/s1872_stone_game_viii/SolutionTest.kt
@@ -14,7 +14,7 @@ internal class SolutionTest {
     fun stoneGameVIII2() {
         assertThat(
             Solution().stoneGameVIII(intArrayOf(7, -6, 5, 10, 5, -2, -6)),
-            equalTo(13)
+            equalTo(13),
         )
     }
 
diff --git a/src/test/kotlin/g1801_1900/s1873_calculate_special_bonus/MysqlTest.kt b/src/test/kotlin/g1801_1900/s1873_calculate_special_bonus/MysqlTest.kt
index a10f08f2f..6c53d83cd 100644
--- a/src/test/kotlin/g1801_1900/s1873_calculate_special_bonus/MysqlTest.kt
+++ b/src/test/kotlin/g1801_1900/s1873_calculate_special_bonus/MysqlTest.kt
@@ -26,8 +26,8 @@ import javax.sql.DataSource
             "INSERT INTO Employees(employee_id, name, salary)" +
             " VALUES (8, 'Juan', 6100); " +
             "INSERT INTO Employees(employee_id, name, salary)" +
-            " VALUES (9, 'Kannon', 7700); "
-    ]
+            " VALUES (9, 'Kannon', 7700); ",
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -39,12 +39,12 @@ internal class MysqlTest {
                     BufferedReader(
                         FileReader(
                             "src/main/kotlin/g1801_1900/s1873_calculat" +
-                                "e_special_bonus/script.sql"
-                        )
+                                "e_special_bonus/script.sql",
+                        ),
                     )
                         .lines()
                         .collect(Collectors.joining("\n"))
-                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace("#.*?\\r?\\n".toRegex(), ""),
                 ).use { resultSet ->
                     assertThat(resultSet.next(), equalTo(true))
                     assertThat(resultSet.getInt(1), equalTo(2))
diff --git a/src/test/kotlin/g1801_1900/s1878_get_biggest_three_rhombus_sums_in_a_grid/SolutionTest.kt b/src/test/kotlin/g1801_1900/s1878_get_biggest_three_rhombus_sums_in_a_grid/SolutionTest.kt
index cde601e73..08ab663c5 100644
--- a/src/test/kotlin/g1801_1900/s1878_get_biggest_three_rhombus_sums_in_a_grid/SolutionTest.kt
+++ b/src/test/kotlin/g1801_1900/s1878_get_biggest_three_rhombus_sums_in_a_grid/SolutionTest.kt
@@ -15,10 +15,10 @@ internal class SolutionTest {
                         intArrayOf(3, 3, 4, 2, 3),
                         intArrayOf(20, 30, 200, 40, 10),
                         intArrayOf(1, 5, 5, 4, 1),
-                        intArrayOf(4, 3, 2, 2, 5)
-                    )
+                        intArrayOf(4, 3, 2, 2, 5),
+                    ),
                 ),
-            equalTo(intArrayOf(228, 216, 211))
+            equalTo(intArrayOf(228, 216, 211)),
         )
     }
 
@@ -26,7 +26,7 @@ internal class SolutionTest {
     fun biggestThree2() {
         assertThat(
             Solution().getBiggestThree(arrayOf(intArrayOf(1, 2, 3), intArrayOf(4, 5, 6), intArrayOf(7, 8, 9))),
-            equalTo(intArrayOf(20, 9, 8))
+            equalTo(intArrayOf(20, 9, 8)),
         )
     }
 
@@ -35,8 +35,8 @@ internal class SolutionTest {
         assertThat(
             Solution().getBiggestThree(arrayOf(intArrayOf(7, 7, 7))),
             equalTo(
-                intArrayOf(7)
-            )
+                intArrayOf(7),
+            ),
         )
     }
 }
diff --git a/src/test/kotlin/g1801_1900/s1879_minimum_xor_sum_of_two_arrays/SolutionTest.kt b/src/test/kotlin/g1801_1900/s1879_minimum_xor_sum_of_two_arrays/SolutionTest.kt
index d464e6bf4..47cf9c55f 100644
--- a/src/test/kotlin/g1801_1900/s1879_minimum_xor_sum_of_two_arrays/SolutionTest.kt
+++ b/src/test/kotlin/g1801_1900/s1879_minimum_xor_sum_of_two_arrays/SolutionTest.kt
@@ -13,7 +13,8 @@ internal class SolutionTest {
     @Test
     fun minimumXORSum2() {
         assertThat(
-            Solution().minimumXORSum(intArrayOf(1, 0, 3), intArrayOf(5, 3, 4)), equalTo(8)
+            Solution().minimumXORSum(intArrayOf(1, 0, 3), intArrayOf(5, 3, 4)),
+            equalTo(8),
         )
     }
 }
diff --git a/src/test/kotlin/g1801_1900/s1882_process_tasks_using_servers/SolutionTest.kt b/src/test/kotlin/g1801_1900/s1882_process_tasks_using_servers/SolutionTest.kt
index 1a1adb1b6..400927c5a 100644
--- a/src/test/kotlin/g1801_1900/s1882_process_tasks_using_servers/SolutionTest.kt
+++ b/src/test/kotlin/g1801_1900/s1882_process_tasks_using_servers/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun assignTasks() {
         assertThat(
             Solution().assignTasks(intArrayOf(3, 3, 2), intArrayOf(1, 2, 3, 2, 1, 2)),
-            equalTo(intArrayOf(2, 2, 0, 2, 1, 2))
+            equalTo(intArrayOf(2, 2, 0, 2, 1, 2)),
         )
     }
 
@@ -18,7 +18,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .assignTasks(intArrayOf(5, 1, 4, 3, 2), intArrayOf(2, 1, 2, 4, 5, 2, 1)),
-            equalTo(intArrayOf(1, 4, 1, 4, 1, 3, 2))
+            equalTo(intArrayOf(1, 4, 1, 4, 1, 3, 2)),
         )
     }
 }
diff --git a/src/test/kotlin/g1801_1900/s1886_determine_whether_matrix_can_be_obtained_by_rotation/SolutionTest.kt b/src/test/kotlin/g1801_1900/s1886_determine_whether_matrix_can_be_obtained_by_rotation/SolutionTest.kt
index b61e1d742..a38ace009 100644
--- a/src/test/kotlin/g1801_1900/s1886_determine_whether_matrix_can_be_obtained_by_rotation/SolutionTest.kt
+++ b/src/test/kotlin/g1801_1900/s1886_determine_whether_matrix_can_be_obtained_by_rotation/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .findRotation(arrayOf(intArrayOf(0, 1), intArrayOf(1, 0)), arrayOf(intArrayOf(1, 0), intArrayOf(0, 1))),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
@@ -19,7 +19,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .findRotation(arrayOf(intArrayOf(0, 1), intArrayOf(1, 1)), arrayOf(intArrayOf(1, 0), intArrayOf(0, 1))),
-            equalTo(false)
+            equalTo(false),
         )
     }
 
@@ -29,9 +29,9 @@ internal class SolutionTest {
             Solution()
                 .findRotation(
                     arrayOf(intArrayOf(0, 0, 0), intArrayOf(0, 1, 0), intArrayOf(1, 1, 1)),
-                    arrayOf(intArrayOf(1, 1, 1), intArrayOf(0, 1, 0), intArrayOf(0, 0, 0))
+                    arrayOf(intArrayOf(1, 1, 1), intArrayOf(0, 1, 0), intArrayOf(0, 0, 0)),
                 ),
-            equalTo(true)
+            equalTo(true),
         )
     }
 }
diff --git a/src/test/kotlin/g1801_1900/s1889_minimum_space_wasted_from_packaging/SolutionTest.kt b/src/test/kotlin/g1801_1900/s1889_minimum_space_wasted_from_packaging/SolutionTest.kt
index b1ce29bb1..f0fb388be 100644
--- a/src/test/kotlin/g1801_1900/s1889_minimum_space_wasted_from_packaging/SolutionTest.kt
+++ b/src/test/kotlin/g1801_1900/s1889_minimum_space_wasted_from_packaging/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun minWastedSpace() {
         assertThat(
             Solution().minWastedSpace(intArrayOf(2, 3, 5), arrayOf(intArrayOf(4, 8), intArrayOf(2, 8))),
-            equalTo(6)
+            equalTo(6),
         )
     }
 
@@ -18,7 +18,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .minWastedSpace(intArrayOf(2, 3, 5), arrayOf(intArrayOf(1, 4), intArrayOf(2, 3), intArrayOf(3, 4))),
-            equalTo(-1)
+            equalTo(-1),
         )
     }
 
@@ -28,9 +28,9 @@ internal class SolutionTest {
             Solution()
                 .minWastedSpace(
                     intArrayOf(3, 5, 8, 10, 11, 12),
-                    arrayOf(intArrayOf(12), intArrayOf(11, 9), intArrayOf(10, 5, 14))
+                    arrayOf(intArrayOf(12), intArrayOf(11, 9), intArrayOf(10, 5, 14)),
                 ),
-            equalTo(9)
+            equalTo(9),
         )
     }
 }
diff --git a/src/test/kotlin/g1801_1900/s1890_the_latest_login_in_2020/MysqlTest.kt b/src/test/kotlin/g1801_1900/s1890_the_latest_login_in_2020/MysqlTest.kt
index 24f4bc2d9..27ca3c78a 100644
--- a/src/test/kotlin/g1801_1900/s1890_the_latest_login_in_2020/MysqlTest.kt
+++ b/src/test/kotlin/g1801_1900/s1890_the_latest_login_in_2020/MysqlTest.kt
@@ -34,8 +34,8 @@ import javax.sql.DataSource
             "INSERT INTO Logins(user_id, time_stamp)" +
             " VALUES (14, '2019-07-14 09:00:00'); " +
             "INSERT INTO Logins(user_id, time_stamp)" +
-            " VALUES (14, '2021-01-06 11:59:59'); "
-    ]
+            " VALUES (14, '2021-01-06 11:59:59'); ",
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -47,12 +47,12 @@ internal class MysqlTest {
                     BufferedReader(
                         FileReader(
                             "src/main/kotlin/g1801_1900/s1890_the_latest_" +
-                                "login_in_2020/script.sql"
-                        )
+                                "login_in_2020/script.sql",
+                        ),
                     )
                         .lines()
                         .collect(Collectors.joining("\n"))
-                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace("#.*?\\r?\\n".toRegex(), ""),
                 ).use { resultSet ->
                     assertThat(resultSet.next(), equalTo(true))
                     assertThat(resultSet.getInt(1), equalTo(2))
diff --git a/src/test/kotlin/g1801_1900/s1893_check_if_all_the_integers_in_a_range_are_covered/SolutionTest.kt b/src/test/kotlin/g1801_1900/s1893_check_if_all_the_integers_in_a_range_are_covered/SolutionTest.kt
index 4efe2660f..fa81a41a7 100644
--- a/src/test/kotlin/g1801_1900/s1893_check_if_all_the_integers_in_a_range_are_covered/SolutionTest.kt
+++ b/src/test/kotlin/g1801_1900/s1893_check_if_all_the_integers_in_a_range_are_covered/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun isCovered() {
         assertThat(
             Solution().isCovered(arrayOf(intArrayOf(1, 2), intArrayOf(3, 4), intArrayOf(5, 6)), 2, 5),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun isCovered2() {
         assertThat(
             Solution().isCovered(arrayOf(intArrayOf(1, 10), intArrayOf(10, 20)), 21, 21),
-            equalTo(false)
+            equalTo(false),
         )
     }
 }
diff --git a/src/test/kotlin/g1801_1900/s1895_largest_magic_square/SolutionTest.kt b/src/test/kotlin/g1801_1900/s1895_largest_magic_square/SolutionTest.kt
index c331fe403..33becfdfd 100644
--- a/src/test/kotlin/g1801_1900/s1895_largest_magic_square/SolutionTest.kt
+++ b/src/test/kotlin/g1801_1900/s1895_largest_magic_square/SolutionTest.kt
@@ -14,10 +14,10 @@ internal class SolutionTest {
                         intArrayOf(7, 1, 4, 5, 6),
                         intArrayOf(2, 5, 1, 6, 4),
                         intArrayOf(1, 5, 4, 3, 2),
-                        intArrayOf(1, 2, 7, 3, 4)
-                    )
+                        intArrayOf(1, 2, 7, 3, 4),
+                    ),
                 ),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
@@ -26,7 +26,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .largestMagicSquare(arrayOf(intArrayOf(5, 1, 3, 1), intArrayOf(9, 3, 3, 1), intArrayOf(1, 3, 3, 8))),
-            equalTo(2)
+            equalTo(2),
         )
     }
 }
diff --git a/src/test/kotlin/g1801_1900/s1898_maximum_number_of_removable_characters/SolutionTest.kt b/src/test/kotlin/g1801_1900/s1898_maximum_number_of_removable_characters/SolutionTest.kt
index 229c7bc41..4e3ecbf18 100644
--- a/src/test/kotlin/g1801_1900/s1898_maximum_number_of_removable_characters/SolutionTest.kt
+++ b/src/test/kotlin/g1801_1900/s1898_maximum_number_of_removable_characters/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun maximumRemovals() {
         assertThat(
             Solution().maximumRemovals("abcacb", "ab", intArrayOf(3, 1, 0)),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun maximumRemovals2() {
         assertThat(
             Solution().maximumRemovals("abcbddddd", "abcd", intArrayOf(3, 2, 1, 4, 5, 6)),
-            equalTo(1)
+            equalTo(1),
         )
     }
 }
diff --git a/src/test/kotlin/g1801_1900/s1899_merge_triplets_to_form_target_triplet/SolutionTest.kt b/src/test/kotlin/g1801_1900/s1899_merge_triplets_to_form_target_triplet/SolutionTest.kt
index 8a8d9164b..7ac31eeda 100644
--- a/src/test/kotlin/g1801_1900/s1899_merge_triplets_to_form_target_triplet/SolutionTest.kt
+++ b/src/test/kotlin/g1801_1900/s1899_merge_triplets_to_form_target_triplet/SolutionTest.kt
@@ -11,9 +11,9 @@ internal class SolutionTest {
             Solution()
                 .mergeTriplets(
                     arrayOf(intArrayOf(2, 5, 3), intArrayOf(1, 8, 4), intArrayOf(1, 7, 5)),
-                    intArrayOf(2, 7, 5)
+                    intArrayOf(2, 7, 5),
                 ),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
@@ -22,7 +22,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .mergeTriplets(arrayOf(intArrayOf(3, 4, 5), intArrayOf(4, 5, 6)), intArrayOf(3, 2, 5)),
-            equalTo(false)
+            equalTo(false),
         )
     }
 
@@ -35,11 +35,11 @@ internal class SolutionTest {
                         intArrayOf(2, 5, 3),
                         intArrayOf(2, 3, 4),
                         intArrayOf(1, 2, 5),
-                        intArrayOf(5, 2, 3)
+                        intArrayOf(5, 2, 3),
                     ),
-                    intArrayOf(5, 5, 5)
+                    intArrayOf(5, 5, 5),
                 ),
-            equalTo(true)
+            equalTo(true),
         )
     }
 }
diff --git a/src/test/kotlin/g1901_2000/s1901_find_a_peak_element_ii/SolutionTest.kt b/src/test/kotlin/g1901_2000/s1901_find_a_peak_element_ii/SolutionTest.kt
index 66758e798..d6b5ae309 100644
--- a/src/test/kotlin/g1901_2000/s1901_find_a_peak_element_ii/SolutionTest.kt
+++ b/src/test/kotlin/g1901_2000/s1901_find_a_peak_element_ii/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun findPeakGrid() {
         assertThat(
             Solution().findPeakGrid(arrayOf(intArrayOf(1, 4), intArrayOf(3, 2))),
-            equalTo(intArrayOf(1, 0))
+            equalTo(intArrayOf(1, 0)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun findPeakGrid2() {
         assertThat(
             Solution().findPeakGrid(arrayOf(intArrayOf(10, 20, 15), intArrayOf(21, 30, 14), intArrayOf(7, 16, 32))),
-            equalTo(intArrayOf(1, 1))
+            equalTo(intArrayOf(1, 1)),
         )
     }
 }
diff --git a/src/test/kotlin/g1901_2000/s1905_count_sub_islands/SolutionTest.kt b/src/test/kotlin/g1901_2000/s1905_count_sub_islands/SolutionTest.kt
index d284c49fc..6bede136f 100644
--- a/src/test/kotlin/g1901_2000/s1905_count_sub_islands/SolutionTest.kt
+++ b/src/test/kotlin/g1901_2000/s1905_count_sub_islands/SolutionTest.kt
@@ -11,15 +11,21 @@ internal class SolutionTest {
             Solution()
                 .countSubIslands(
                     arrayOf(
-                        intArrayOf(1, 1, 1, 0, 0), intArrayOf(0, 1, 1, 1, 1),
-                        intArrayOf(0, 0, 0, 0, 0), intArrayOf(1, 0, 0, 0, 0), intArrayOf(1, 1, 0, 1, 1)
+                        intArrayOf(1, 1, 1, 0, 0),
+                        intArrayOf(0, 1, 1, 1, 1),
+                        intArrayOf(0, 0, 0, 0, 0),
+                        intArrayOf(1, 0, 0, 0, 0),
+                        intArrayOf(1, 1, 0, 1, 1),
                     ),
                     arrayOf(
-                        intArrayOf(1, 1, 1, 0, 0), intArrayOf(0, 0, 1, 1, 1),
-                        intArrayOf(0, 1, 0, 0, 0), intArrayOf(1, 0, 1, 1, 0), intArrayOf(0, 1, 0, 1, 0)
-                    )
+                        intArrayOf(1, 1, 1, 0, 0),
+                        intArrayOf(0, 0, 1, 1, 1),
+                        intArrayOf(0, 1, 0, 0, 0),
+                        intArrayOf(1, 0, 1, 1, 0),
+                        intArrayOf(0, 1, 0, 1, 0),
+                    ),
                 ),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
@@ -29,15 +35,21 @@ internal class SolutionTest {
             Solution()
                 .countSubIslands(
                     arrayOf(
-                        intArrayOf(1, 0, 1, 0, 1), intArrayOf(1, 1, 1, 1, 1),
-                        intArrayOf(0, 0, 0, 0, 0), intArrayOf(1, 1, 1, 1, 1), intArrayOf(1, 0, 1, 0, 1)
+                        intArrayOf(1, 0, 1, 0, 1),
+                        intArrayOf(1, 1, 1, 1, 1),
+                        intArrayOf(0, 0, 0, 0, 0),
+                        intArrayOf(1, 1, 1, 1, 1),
+                        intArrayOf(1, 0, 1, 0, 1),
                     ),
                     arrayOf(
-                        intArrayOf(0, 0, 0, 0, 0), intArrayOf(1, 1, 1, 1, 1),
-                        intArrayOf(0, 1, 0, 1, 0), intArrayOf(0, 1, 0, 1, 0), intArrayOf(1, 0, 0, 0, 1)
-                    )
+                        intArrayOf(0, 0, 0, 0, 0),
+                        intArrayOf(1, 1, 1, 1, 1),
+                        intArrayOf(0, 1, 0, 1, 0),
+                        intArrayOf(0, 1, 0, 1, 0),
+                        intArrayOf(1, 0, 0, 0, 1),
+                    ),
                 ),
-            equalTo(2)
+            equalTo(2),
         )
     }
 }
diff --git a/src/test/kotlin/g1901_2000/s1906_minimum_absolute_difference_queries/SolutionTest.kt b/src/test/kotlin/g1901_2000/s1906_minimum_absolute_difference_queries/SolutionTest.kt
index ef65c0caf..2aefa5f45 100644
--- a/src/test/kotlin/g1901_2000/s1906_minimum_absolute_difference_queries/SolutionTest.kt
+++ b/src/test/kotlin/g1901_2000/s1906_minimum_absolute_difference_queries/SolutionTest.kt
@@ -13,10 +13,12 @@ internal class SolutionTest {
                     intArrayOf(1, 3, 4, 8),
                     arrayOf(
                         intArrayOf(0, 1),
-                        intArrayOf(1, 2), intArrayOf(2, 3), intArrayOf(0, 3)
-                    )
+                        intArrayOf(1, 2),
+                        intArrayOf(2, 3),
+                        intArrayOf(0, 3),
+                    ),
                 ),
-            equalTo(intArrayOf(2, 1, 4, 1))
+            equalTo(intArrayOf(2, 1, 4, 1)),
         )
     }
 
@@ -26,9 +28,9 @@ internal class SolutionTest {
             Solution()
                 .minDifference(
                     intArrayOf(4, 5, 2, 2, 7, 10),
-                    arrayOf(intArrayOf(2, 3), intArrayOf(0, 2), intArrayOf(0, 5), intArrayOf(3, 5))
+                    arrayOf(intArrayOf(2, 3), intArrayOf(0, 2), intArrayOf(0, 5), intArrayOf(3, 5)),
                 ),
-            equalTo(intArrayOf(-1, 1, 1, 3))
+            equalTo(intArrayOf(-1, 1, 1, 3)),
         )
     }
 }
diff --git a/src/test/kotlin/g1901_2000/s1907_count_salary_categories/MysqlTest.kt b/src/test/kotlin/g1901_2000/s1907_count_salary_categories/MysqlTest.kt
index c0c1c22c5..2c3b1d946 100644
--- a/src/test/kotlin/g1901_2000/s1907_count_salary_categories/MysqlTest.kt
+++ b/src/test/kotlin/g1901_2000/s1907_count_salary_categories/MysqlTest.kt
@@ -24,8 +24,8 @@ import javax.sql.DataSource
             "INSERT INTO Accounts(account_id, income)" +
             " VALUES (8, 87709); " +
             "INSERT INTO Accounts(account_id, income)" +
-            " VALUES (6, 91796); "
-    ]
+            " VALUES (6, 91796); ",
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -37,12 +37,12 @@ internal class MysqlTest {
                     BufferedReader(
                         FileReader(
                             "src/main/kotlin/g1901_2000/" +
-                                "s1907_count_salary_categories/script.sql"
-                        )
+                                "s1907_count_salary_categories/script.sql",
+                        ),
                     )
                         .lines()
                         .collect(Collectors.joining("\n"))
-                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace("#.*?\\r?\\n".toRegex(), ""),
                 ).use { resultSet ->
                     assertThat(resultSet.next(), equalTo(true))
                     assertThat(resultSet.getNString(1), equalTo("Average Salary"))
diff --git a/src/test/kotlin/g1901_2000/s1912_design_movie_rental_system/MovieRentingSystemTest.kt b/src/test/kotlin/g1901_2000/s1912_design_movie_rental_system/MovieRentingSystemTest.kt
index 59b823971..a9f86125c 100644
--- a/src/test/kotlin/g1901_2000/s1912_design_movie_rental_system/MovieRentingSystemTest.kt
+++ b/src/test/kotlin/g1901_2000/s1912_design_movie_rental_system/MovieRentingSystemTest.kt
@@ -10,16 +10,20 @@ internal class MovieRentingSystemTest {
         val movieRentingSystem = MovieRentingSystem(
             3,
             arrayOf(
-                intArrayOf(0, 1, 5), intArrayOf(0, 2, 6), intArrayOf(0, 3, 7),
-                intArrayOf(1, 1, 4), intArrayOf(1, 2, 7), intArrayOf(2, 1, 5)
-            )
+                intArrayOf(0, 1, 5),
+                intArrayOf(0, 2, 6),
+                intArrayOf(0, 3, 7),
+                intArrayOf(1, 1, 4),
+                intArrayOf(1, 2, 7),
+                intArrayOf(2, 1, 5),
+            ),
         )
         assertThat(movieRentingSystem.search(1), equalTo(mutableListOf(1, 0, 2)))
         movieRentingSystem.rent(0, 1)
         movieRentingSystem.rent(1, 2)
         assertThat(
             movieRentingSystem.report(),
-            equalTo(listOf(mutableListOf(0, 1), mutableListOf(1, 2)))
+            equalTo(listOf(mutableListOf(0, 1), mutableListOf(1, 2))),
         )
         movieRentingSystem.drop(1, 2)
         assertThat(movieRentingSystem.search(2), equalTo(mutableListOf(0, 1)))
diff --git a/src/test/kotlin/g1901_2000/s1913_maximum_product_difference_between_two_pairs/SolutionTest.kt b/src/test/kotlin/g1901_2000/s1913_maximum_product_difference_between_two_pairs/SolutionTest.kt
index 9f51a22b2..073727b9c 100644
--- a/src/test/kotlin/g1901_2000/s1913_maximum_product_difference_between_two_pairs/SolutionTest.kt
+++ b/src/test/kotlin/g1901_2000/s1913_maximum_product_difference_between_two_pairs/SolutionTest.kt
@@ -13,7 +13,8 @@ internal class SolutionTest {
     @Test
     fun maxProductDifference2() {
         assertThat(
-            Solution().maxProductDifference(intArrayOf(4, 2, 5, 9, 7, 4, 8)), equalTo(64)
+            Solution().maxProductDifference(intArrayOf(4, 2, 5, 9, 7, 4, 8)),
+            equalTo(64),
         )
     }
 }
diff --git a/src/test/kotlin/g1901_2000/s1914_cyclically_rotating_a_grid/SolutionTest.kt b/src/test/kotlin/g1901_2000/s1914_cyclically_rotating_a_grid/SolutionTest.kt
index c92bcbc5d..b80ec0ca9 100644
--- a/src/test/kotlin/g1901_2000/s1914_cyclically_rotating_a_grid/SolutionTest.kt
+++ b/src/test/kotlin/g1901_2000/s1914_cyclically_rotating_a_grid/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun rotateGrid() {
         assertThat(
             Solution().rotateGrid(arrayOf(intArrayOf(40, 10), intArrayOf(30, 20)), 1),
-            equalTo(arrayOf(intArrayOf(10, 20), intArrayOf(40, 30)))
+            equalTo(arrayOf(intArrayOf(10, 20), intArrayOf(40, 30))),
         )
     }
 
@@ -19,17 +19,21 @@ internal class SolutionTest {
             Solution()
                 .rotateGrid(
                     arrayOf(
-                        intArrayOf(1, 2, 3, 4), intArrayOf(5, 6, 7, 8),
-                        intArrayOf(9, 10, 11, 12), intArrayOf(13, 14, 15, 16)
+                        intArrayOf(1, 2, 3, 4),
+                        intArrayOf(5, 6, 7, 8),
+                        intArrayOf(9, 10, 11, 12),
+                        intArrayOf(13, 14, 15, 16),
                     ),
-                    2
+                    2,
                 ),
             equalTo(
                 arrayOf(
-                    intArrayOf(3, 4, 8, 12), intArrayOf(2, 11, 10, 16),
-                    intArrayOf(1, 7, 6, 15), intArrayOf(5, 9, 13, 14)
-                )
-            )
+                    intArrayOf(3, 4, 8, 12),
+                    intArrayOf(2, 11, 10, 16),
+                    intArrayOf(1, 7, 6, 15),
+                    intArrayOf(5, 9, 13, 14),
+                ),
+            ),
         )
     }
 }
diff --git a/src/test/kotlin/g1901_2000/s1920_build_array_from_permutation/SolutionTest.kt b/src/test/kotlin/g1901_2000/s1920_build_array_from_permutation/SolutionTest.kt
index e079ae30d..cb3ca8de5 100644
--- a/src/test/kotlin/g1901_2000/s1920_build_array_from_permutation/SolutionTest.kt
+++ b/src/test/kotlin/g1901_2000/s1920_build_array_from_permutation/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun buildArray() {
         assertThat(
             Solution().buildArray(intArrayOf(0, 2, 1, 5, 3, 4)),
-            equalTo(intArrayOf(0, 1, 2, 4, 5, 3))
+            equalTo(intArrayOf(0, 1, 2, 4, 5, 3)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun buildArray2() {
         assertThat(
             Solution().buildArray(intArrayOf(5, 0, 1, 2, 3, 4)),
-            equalTo(intArrayOf(4, 5, 0, 1, 2, 3))
+            equalTo(intArrayOf(4, 5, 0, 1, 2, 3)),
         )
     }
 }
diff --git a/src/test/kotlin/g1901_2000/s1921_eliminate_maximum_number_of_monsters/SolutionTest.kt b/src/test/kotlin/g1901_2000/s1921_eliminate_maximum_number_of_monsters/SolutionTest.kt
index 4b9af2f1a..a7a42390d 100644
--- a/src/test/kotlin/g1901_2000/s1921_eliminate_maximum_number_of_monsters/SolutionTest.kt
+++ b/src/test/kotlin/g1901_2000/s1921_eliminate_maximum_number_of_monsters/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun eliminateMaximum() {
         assertThat(
             Solution().eliminateMaximum(intArrayOf(1, 3, 4), intArrayOf(1, 1, 1)),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun eliminateMaximum2() {
         assertThat(
             Solution().eliminateMaximum(intArrayOf(1, 1, 2, 3), intArrayOf(1, 1, 1, 1)),
-            equalTo(1)
+            equalTo(1),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun eliminateMaximum3() {
         assertThat(
             Solution().eliminateMaximum(intArrayOf(3, 2, 4), intArrayOf(5, 3, 2)),
-            equalTo(1)
+            equalTo(1),
         )
     }
 }
diff --git a/src/test/kotlin/g1901_2000/s1923_longest_common_subpath/SolutionTest.kt b/src/test/kotlin/g1901_2000/s1923_longest_common_subpath/SolutionTest.kt
index 50754b076..bbfdb7ecc 100644
--- a/src/test/kotlin/g1901_2000/s1923_longest_common_subpath/SolutionTest.kt
+++ b/src/test/kotlin/g1901_2000/s1923_longest_common_subpath/SolutionTest.kt
@@ -10,9 +10,10 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .longestCommonSubpath(
-                    5, arrayOf(intArrayOf(0, 1, 2, 3, 4), intArrayOf(2, 3, 4), intArrayOf(4, 0, 1, 2, 3))
+                    5,
+                    arrayOf(intArrayOf(0, 1, 2, 3, 4), intArrayOf(2, 3, 4), intArrayOf(4, 0, 1, 2, 3)),
                 ),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -26,7 +27,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .longestCommonSubpath(5, arrayOf(intArrayOf(0, 1, 2, 3, 4), intArrayOf(4, 3, 2, 1, 0))),
-            equalTo(1)
+            equalTo(1),
         )
     }
 }
diff --git a/src/test/kotlin/g1901_2000/s1926_nearest_exit_from_entrance_in_maze/SolutionTest.kt b/src/test/kotlin/g1901_2000/s1926_nearest_exit_from_entrance_in_maze/SolutionTest.kt
index c10759e9e..7c8b124de 100644
--- a/src/test/kotlin/g1901_2000/s1926_nearest_exit_from_entrance_in_maze/SolutionTest.kt
+++ b/src/test/kotlin/g1901_2000/s1926_nearest_exit_from_entrance_in_maze/SolutionTest.kt
@@ -12,11 +12,12 @@ internal class SolutionTest {
                 .nearestExit(
                     arrayOf(
                         charArrayOf('+', '+', '.', '+'),
-                        charArrayOf('.', '.', '.', '+'), charArrayOf('+', '+', '+', '.')
+                        charArrayOf('.', '.', '.', '+'),
+                        charArrayOf('+', '+', '+', '.'),
                     ),
-                    intArrayOf(1, 2)
+                    intArrayOf(1, 2),
                 ),
-            equalTo(1)
+            equalTo(1),
         )
     }
 
@@ -27,11 +28,12 @@ internal class SolutionTest {
                 .nearestExit(
                     arrayOf(
                         charArrayOf('+', '+', '+'),
-                        charArrayOf('.', '.', '.'), charArrayOf('+', '+', '+')
+                        charArrayOf('.', '.', '.'),
+                        charArrayOf('+', '+', '+'),
                     ),
-                    intArrayOf(1, 0)
+                    intArrayOf(1, 0),
                 ),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -39,7 +41,7 @@ internal class SolutionTest {
     fun nearestExit3() {
         assertThat(
             Solution().nearestExit(arrayOf(charArrayOf('.', '+')), intArrayOf(0, 0)),
-            equalTo(-1)
+            equalTo(-1),
         )
     }
 }
diff --git a/src/test/kotlin/g1901_2000/s1928_minimum_cost_to_reach_destination_in_time/SolutionTest.kt b/src/test/kotlin/g1901_2000/s1928_minimum_cost_to_reach_destination_in_time/SolutionTest.kt
index f365f3d97..632938f26 100644
--- a/src/test/kotlin/g1901_2000/s1928_minimum_cost_to_reach_destination_in_time/SolutionTest.kt
+++ b/src/test/kotlin/g1901_2000/s1928_minimum_cost_to_reach_destination_in_time/SolutionTest.kt
@@ -12,13 +12,16 @@ internal class SolutionTest {
                 .minCost(
                     30,
                     arrayOf(
-                        intArrayOf(0, 1, 10), intArrayOf(1, 2, 10),
-                        intArrayOf(2, 5, 10), intArrayOf(0, 3, 1), intArrayOf(3, 4, 10),
-                        intArrayOf(4, 5, 15)
+                        intArrayOf(0, 1, 10),
+                        intArrayOf(1, 2, 10),
+                        intArrayOf(2, 5, 10),
+                        intArrayOf(0, 3, 1),
+                        intArrayOf(3, 4, 10),
+                        intArrayOf(4, 5, 15),
                     ),
-                    intArrayOf(5, 1, 2, 20, 20, 3)
+                    intArrayOf(5, 1, 2, 20, 20, 3),
                 ),
-            equalTo(11)
+            equalTo(11),
         )
     }
 
@@ -29,13 +32,16 @@ internal class SolutionTest {
                 .minCost(
                     29,
                     arrayOf(
-                        intArrayOf(0, 1, 10), intArrayOf(1, 2, 10),
-                        intArrayOf(2, 5, 10), intArrayOf(0, 3, 1), intArrayOf(3, 4, 10),
-                        intArrayOf(4, 5, 15)
+                        intArrayOf(0, 1, 10),
+                        intArrayOf(1, 2, 10),
+                        intArrayOf(2, 5, 10),
+                        intArrayOf(0, 3, 1),
+                        intArrayOf(3, 4, 10),
+                        intArrayOf(4, 5, 15),
                     ),
-                    intArrayOf(5, 1, 2, 20, 20, 3)
+                    intArrayOf(5, 1, 2, 20, 20, 3),
                 ),
-            equalTo(48)
+            equalTo(48),
         )
     }
 
@@ -46,13 +52,16 @@ internal class SolutionTest {
                 .minCost(
                     25,
                     arrayOf(
-                        intArrayOf(0, 1, 10), intArrayOf(1, 2, 10),
-                        intArrayOf(2, 5, 10), intArrayOf(0, 3, 1), intArrayOf(3, 4, 10),
-                        intArrayOf(4, 5, 15)
+                        intArrayOf(0, 1, 10),
+                        intArrayOf(1, 2, 10),
+                        intArrayOf(2, 5, 10),
+                        intArrayOf(0, 3, 1),
+                        intArrayOf(3, 4, 10),
+                        intArrayOf(4, 5, 15),
                     ),
-                    intArrayOf(5, 1, 2, 20, 20, 3)
+                    intArrayOf(5, 1, 2, 20, 20, 3),
                 ),
-            equalTo(-1)
+            equalTo(-1),
         )
     }
 }
diff --git a/src/test/kotlin/g1901_2000/s1929_concatenation_of_array/SolutionTest.kt b/src/test/kotlin/g1901_2000/s1929_concatenation_of_array/SolutionTest.kt
index 6eda8629f..0cde02188 100644
--- a/src/test/kotlin/g1901_2000/s1929_concatenation_of_array/SolutionTest.kt
+++ b/src/test/kotlin/g1901_2000/s1929_concatenation_of_array/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun concatenation() {
         assertThat(
             Solution().getConcatenation(intArrayOf(1, 2, 1)),
-            equalTo(intArrayOf(1, 2, 1, 1, 2, 1))
+            equalTo(intArrayOf(1, 2, 1, 1, 2, 1)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun concatenation2() {
         assertThat(
             Solution().getConcatenation(intArrayOf(1, 3, 2, 1)),
-            equalTo(intArrayOf(1, 3, 2, 1, 1, 3, 2, 1))
+            equalTo(intArrayOf(1, 3, 2, 1, 1, 3, 2, 1)),
         )
     }
 }
diff --git a/src/test/kotlin/g1901_2000/s1932_merge_bsts_to_create_single_bst/SolutionTest.kt b/src/test/kotlin/g1901_2000/s1932_merge_bsts_to_create_single_bst/SolutionTest.kt
index bf803c0fd..3a3a1d55b 100644
--- a/src/test/kotlin/g1901_2000/s1932_merge_bsts_to_create_single_bst/SolutionTest.kt
+++ b/src/test/kotlin/g1901_2000/s1932_merge_bsts_to_create_single_bst/SolutionTest.kt
@@ -11,11 +11,11 @@ internal class SolutionTest {
         val nodes: List<TreeNode> = listOf(
             TreeNode.create(mutableListOf(2, 1))!!,
             TreeNode.create(mutableListOf(3, 2, 5))!!,
-            TreeNode.create(mutableListOf(5, 4))!!
+            TreeNode.create(mutableListOf(5, 4))!!,
         )
         assertThat(
             Solution().canMerge(nodes).toString(),
-            equalTo(TreeNode.create(mutableListOf(3, 2, 5, 1, null, 4)).toString())
+            equalTo(TreeNode.create(mutableListOf(3, 2, 5, 1, null, 4)).toString()),
         )
     }
 
@@ -23,20 +23,23 @@ internal class SolutionTest {
     fun canMerge2() {
         val nodes: List<TreeNode> = listOf(
             TreeNode.create(mutableListOf(5, 3, 8))!!,
-            TreeNode.create(mutableListOf(3, 2, 6))!!
+            TreeNode.create(mutableListOf(3, 2, 6))!!,
         )
         assertThat(
-            Solution().canMerge(nodes), equalTo(TreeNode.create(emptyList()))
+            Solution().canMerge(nodes),
+            equalTo(TreeNode.create(emptyList())),
         )
     }
 
     @Test
     fun canMerge3() {
         val nodes: List<TreeNode> = listOf(
-            TreeNode.create(mutableListOf(5, 4))!!, TreeNode.create(mutableListOf(3))!!
+            TreeNode.create(mutableListOf(5, 4))!!,
+            TreeNode.create(mutableListOf(3))!!,
         )
         assertThat(
-            Solution().canMerge(nodes), equalTo(TreeNode.create(emptyList()))
+            Solution().canMerge(nodes),
+            equalTo(TreeNode.create(emptyList())),
         )
     }
 }
diff --git a/src/test/kotlin/g1901_2000/s1934_confirmation_rate/MysqlTest.kt b/src/test/kotlin/g1901_2000/s1934_confirmation_rate/MysqlTest.kt
index e9cc692aa..cf7ad1b27 100644
--- a/src/test/kotlin/g1901_2000/s1934_confirmation_rate/MysqlTest.kt
+++ b/src/test/kotlin/g1901_2000/s1934_confirmation_rate/MysqlTest.kt
@@ -39,8 +39,8 @@ import javax.sql.DataSource
             "INSERT INTO Confirmations(user_id, time_stamp, action)" +
             " VALUES (2, '2021-01-22 00:00:00', 'confirmed'); " +
             "INSERT INTO Confirmations(user_id, time_stamp, action)" +
-            " VALUES (2, '2021-02-28 23:59:59', 'timeout'); "
-    ]
+            " VALUES (2, '2021-02-28 23:59:59', 'timeout'); ",
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -52,12 +52,12 @@ internal class MysqlTest {
                     BufferedReader(
                         FileReader(
                             "src/main/kotlin/g1901_2000/" +
-                                "s1934_confirmation_rate/script.sql"
-                        )
+                                "s1934_confirmation_rate/script.sql",
+                        ),
                     )
                         .lines()
                         .collect(Collectors.joining("\n"))
-                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace("#.*?\\r?\\n".toRegex(), ""),
                 ).use { resultSet ->
                     assertThat(resultSet.next(), equalTo(true))
                     assertThat(resultSet.getInt(1), equalTo(2))
diff --git a/src/test/kotlin/g1901_2000/s1937_maximum_number_of_points_with_cost/SolutionTest.kt b/src/test/kotlin/g1901_2000/s1937_maximum_number_of_points_with_cost/SolutionTest.kt
index e0f5a191c..8fd46aaa2 100644
--- a/src/test/kotlin/g1901_2000/s1937_maximum_number_of_points_with_cost/SolutionTest.kt
+++ b/src/test/kotlin/g1901_2000/s1937_maximum_number_of_points_with_cost/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun maxPoints() {
         assertThat(
             Solution().maxPoints(arrayOf(intArrayOf(1, 2, 3), intArrayOf(1, 5, 1), intArrayOf(3, 1, 1))),
-            equalTo(9L)
+            equalTo(9L),
         )
     }
 
diff --git a/src/test/kotlin/g1901_2000/s1938_maximum_genetic_difference_query/SolutionTest.kt b/src/test/kotlin/g1901_2000/s1938_maximum_genetic_difference_query/SolutionTest.kt
index 087c02ad6..601ae6833 100644
--- a/src/test/kotlin/g1901_2000/s1938_maximum_genetic_difference_query/SolutionTest.kt
+++ b/src/test/kotlin/g1901_2000/s1938_maximum_genetic_difference_query/SolutionTest.kt
@@ -13,10 +13,11 @@ internal class SolutionTest {
                     intArrayOf(-1, 0, 1, 1),
                     arrayOf(
                         intArrayOf(0, 2),
-                        intArrayOf(3, 2), intArrayOf(2, 5)
-                    )
+                        intArrayOf(3, 2),
+                        intArrayOf(2, 5),
+                    ),
                 ),
-            equalTo(intArrayOf(2, 3, 7))
+            equalTo(intArrayOf(2, 3, 7)),
         )
     }
 
@@ -26,9 +27,9 @@ internal class SolutionTest {
             Solution()
                 .maxGeneticDifference(
                     intArrayOf(3, 7, -1, 2, 0, 7, 0, 2),
-                    arrayOf(intArrayOf(4, 6), intArrayOf(1, 15), intArrayOf(0, 5))
+                    arrayOf(intArrayOf(4, 6), intArrayOf(1, 15), intArrayOf(0, 5)),
                 ),
-            equalTo(intArrayOf(6, 14, 7))
+            equalTo(intArrayOf(6, 14, 7)),
         )
     }
 }
diff --git a/src/test/kotlin/g1901_2000/s1942_the_number_of_the_smallest_unoccupied_chair/SolutionTest.kt b/src/test/kotlin/g1901_2000/s1942_the_number_of_the_smallest_unoccupied_chair/SolutionTest.kt
index 9aa91ea5a..c70761551 100644
--- a/src/test/kotlin/g1901_2000/s1942_the_number_of_the_smallest_unoccupied_chair/SolutionTest.kt
+++ b/src/test/kotlin/g1901_2000/s1942_the_number_of_the_smallest_unoccupied_chair/SolutionTest.kt
@@ -8,14 +8,16 @@ internal class SolutionTest {
     @Test
     fun smallestChair() {
         assertThat(
-            Solution().smallestChair(arrayOf(intArrayOf(1, 4), intArrayOf(2, 3), intArrayOf(4, 6)), 1), equalTo(1)
+            Solution().smallestChair(arrayOf(intArrayOf(1, 4), intArrayOf(2, 3), intArrayOf(4, 6)), 1),
+            equalTo(1),
         )
     }
 
     @Test
     fun smallestChair2() {
         assertThat(
-            Solution().smallestChair(arrayOf(intArrayOf(3, 10), intArrayOf(1, 5), intArrayOf(2, 6)), 0), equalTo(2)
+            Solution().smallestChair(arrayOf(intArrayOf(3, 10), intArrayOf(1, 5), intArrayOf(2, 6)), 0),
+            equalTo(2),
         )
     }
 }
diff --git a/src/test/kotlin/g1901_2000/s1943_describe_the_painting/SolutionTest.kt b/src/test/kotlin/g1901_2000/s1943_describe_the_painting/SolutionTest.kt
index 38c9ee54c..6843630bb 100644
--- a/src/test/kotlin/g1901_2000/s1943_describe_the_painting/SolutionTest.kt
+++ b/src/test/kotlin/g1901_2000/s1943_describe_the_painting/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun splitPainting() {
         assertThat(
             Solution().splitPainting(arrayOf(intArrayOf(1, 4, 5), intArrayOf(4, 7, 7), intArrayOf(1, 7, 9))),
-            equalTo(listOf(mutableListOf(1L, 4L, 14L), mutableListOf(4L, 7L, 16L)))
+            equalTo(listOf(mutableListOf(1L, 4L, 14L), mutableListOf(4L, 7L, 16L))),
         )
     }
 
@@ -19,10 +19,12 @@ internal class SolutionTest {
             Solution().splitPainting(arrayOf(intArrayOf(1, 7, 9), intArrayOf(6, 8, 15), intArrayOf(8, 10, 7))),
             equalTo(
                 listOf(
-                    mutableListOf(1L, 6L, 9L), mutableListOf(6L, 7L, 24L),
-                    mutableListOf(7L, 8L, 15L), mutableListOf(8L, 10L, 7L)
-                )
-            )
+                    mutableListOf(1L, 6L, 9L),
+                    mutableListOf(6L, 7L, 24L),
+                    mutableListOf(7L, 8L, 15L),
+                    mutableListOf(8L, 10L, 7L),
+                ),
+            ),
         )
     }
 
@@ -32,11 +34,13 @@ internal class SolutionTest {
             Solution()
                 .splitPainting(
                     arrayOf(
-                        intArrayOf(1, 4, 5), intArrayOf(1, 4, 7),
-                        intArrayOf(4, 7, 1), intArrayOf(4, 7, 11)
-                    )
+                        intArrayOf(1, 4, 5),
+                        intArrayOf(1, 4, 7),
+                        intArrayOf(4, 7, 1),
+                        intArrayOf(4, 7, 11),
+                    ),
                 ),
-            equalTo(listOf(mutableListOf(1L, 4L, 12L), mutableListOf(4L, 7L, 12L)))
+            equalTo(listOf(mutableListOf(1L, 4L, 12L), mutableListOf(4L, 7L, 12L))),
         )
     }
 }
diff --git a/src/test/kotlin/g1901_2000/s1944_number_of_visible_people_in_a_queue/SolutionTest.kt b/src/test/kotlin/g1901_2000/s1944_number_of_visible_people_in_a_queue/SolutionTest.kt
index c2fd97e7a..28651673c 100644
--- a/src/test/kotlin/g1901_2000/s1944_number_of_visible_people_in_a_queue/SolutionTest.kt
+++ b/src/test/kotlin/g1901_2000/s1944_number_of_visible_people_in_a_queue/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun canSeePersonsCount() {
         assertThat(
             Solution().canSeePersonsCount(intArrayOf(10, 6, 8, 5, 11, 9)),
-            equalTo(intArrayOf(3, 1, 2, 1, 1, 0))
+            equalTo(intArrayOf(3, 1, 2, 1, 1, 0)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun canSeePersonsCount2() {
         assertThat(
             Solution().canSeePersonsCount(intArrayOf(5, 1, 2, 3, 10)),
-            equalTo(intArrayOf(4, 1, 1, 1, 0))
+            equalTo(intArrayOf(4, 1, 1, 1, 0)),
         )
     }
 }
diff --git a/src/test/kotlin/g1901_2000/s1946_largest_number_after_mutating_substring/SolutionTest.kt b/src/test/kotlin/g1901_2000/s1946_largest_number_after_mutating_substring/SolutionTest.kt
index 67613db01..c07529748 100644
--- a/src/test/kotlin/g1901_2000/s1946_largest_number_after_mutating_substring/SolutionTest.kt
+++ b/src/test/kotlin/g1901_2000/s1946_largest_number_after_mutating_substring/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun maximumNumber() {
         assertThat(
             Solution().maximumNumber("132", intArrayOf(9, 8, 5, 0, 3, 6, 4, 2, 6, 8)),
-            equalTo("832")
+            equalTo("832"),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun maximumNumber2() {
         assertThat(
             Solution().maximumNumber("021", intArrayOf(9, 4, 3, 5, 7, 2, 1, 9, 0, 6)),
-            equalTo("934")
+            equalTo("934"),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun maximumNumber3() {
         assertThat(
             Solution().maximumNumber("5", intArrayOf(1, 4, 7, 5, 3, 2, 5, 6, 9, 4)),
-            equalTo("5")
+            equalTo("5"),
         )
     }
 }
diff --git a/src/test/kotlin/g1901_2000/s1947_maximum_compatibility_score_sum/SolutionTest.kt b/src/test/kotlin/g1901_2000/s1947_maximum_compatibility_score_sum/SolutionTest.kt
index 869c845f5..241899c95 100644
--- a/src/test/kotlin/g1901_2000/s1947_maximum_compatibility_score_sum/SolutionTest.kt
+++ b/src/test/kotlin/g1901_2000/s1947_maximum_compatibility_score_sum/SolutionTest.kt
@@ -11,15 +11,17 @@ internal class SolutionTest {
             Solution()
                 .maxCompatibilitySum(
                     arrayOf(
-                        intArrayOf(1, 1, 0), intArrayOf(1, 0, 1),
-                        intArrayOf(0, 0, 1)
+                        intArrayOf(1, 1, 0),
+                        intArrayOf(1, 0, 1),
+                        intArrayOf(0, 0, 1),
                     ),
                     arrayOf(
                         intArrayOf(1, 0, 0),
-                        intArrayOf(0, 0, 1), intArrayOf(1, 1, 0)
-                    )
+                        intArrayOf(0, 0, 1),
+                        intArrayOf(1, 1, 0),
+                    ),
                 ),
-            equalTo(8)
+            equalTo(8),
         )
     }
 
@@ -30,11 +32,12 @@ internal class SolutionTest {
                 .maxCompatibilitySum(
                     arrayOf(
                         intArrayOf(0, 0),
-                        intArrayOf(0, 0), intArrayOf(0, 0)
+                        intArrayOf(0, 0),
+                        intArrayOf(0, 0),
                     ),
-                    arrayOf(intArrayOf(1, 1), intArrayOf(1, 1), intArrayOf(1, 1))
+                    arrayOf(intArrayOf(1, 1), intArrayOf(1, 1), intArrayOf(1, 1)),
                 ),
-            equalTo(0)
+            equalTo(0),
         )
     }
 }
diff --git a/src/test/kotlin/g1901_2000/s1948_delete_duplicate_folders_in_system/SolutionTest.kt b/src/test/kotlin/g1901_2000/s1948_delete_duplicate_folders_in_system/SolutionTest.kt
index 6b83b4225..ef4381c89 100644
--- a/src/test/kotlin/g1901_2000/s1948_delete_duplicate_folders_in_system/SolutionTest.kt
+++ b/src/test/kotlin/g1901_2000/s1948_delete_duplicate_folders_in_system/SolutionTest.kt
@@ -11,11 +11,15 @@ internal class SolutionTest {
             Solution()
                 .deleteDuplicateFolder(
                     listOf(
-                        listOf("a"), listOf("c"), listOf("d"),
-                        mutableListOf("a", "b"), mutableListOf("c", "b"), mutableListOf("d", "a")
-                    )
+                        listOf("a"),
+                        listOf("c"),
+                        listOf("d"),
+                        mutableListOf("a", "b"),
+                        mutableListOf("c", "b"),
+                        mutableListOf("d", "a"),
+                    ),
                 ),
-            equalTo(listOf(listOf("d"), mutableListOf("d", "a")))
+            equalTo(listOf(listOf("d"), mutableListOf("d", "a"))),
         )
     }
 
@@ -25,15 +29,19 @@ internal class SolutionTest {
             Solution()
                 .deleteDuplicateFolder(
                     listOf(
-                        listOf("a"), listOf("c"),
-                        mutableListOf("a", "b"), mutableListOf("c", "b"),
-                        mutableListOf("a", "b", "x"), mutableListOf("a", "b", "x", "y"),
-                        listOf("w"), mutableListOf("w", "y")
-                    )
+                        listOf("a"),
+                        listOf("c"),
+                        mutableListOf("a", "b"),
+                        mutableListOf("c", "b"),
+                        mutableListOf("a", "b", "x"),
+                        mutableListOf("a", "b", "x", "y"),
+                        listOf("w"),
+                        mutableListOf("w", "y"),
+                    ),
                 ),
             equalTo(
-                listOf(listOf("a"), mutableListOf("a", "b"), listOf("c"), mutableListOf("c", "b"))
-            )
+                listOf(listOf("a"), mutableListOf("a", "b"), listOf("c"), mutableListOf("c", "b")),
+            ),
         )
     }
 
@@ -42,11 +50,11 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .deleteDuplicateFolder(
-                    listOf(mutableListOf("a", "b"), mutableListOf("c", "d"), listOf("c"), listOf("a"))
+                    listOf(mutableListOf("a", "b"), mutableListOf("c", "d"), listOf("c"), listOf("a")),
                 ),
             equalTo(
-                listOf(listOf("a"), mutableListOf("a", "b"), listOf("c"), mutableListOf("c", "d"))
-            )
+                listOf(listOf("a"), mutableListOf("a", "b"), listOf("c"), mutableListOf("c", "d")),
+            ),
         )
     }
 }
diff --git a/src/test/kotlin/g1901_2000/s1955_count_number_of_special_subsequences/SolutionTest.kt b/src/test/kotlin/g1901_2000/s1955_count_number_of_special_subsequences/SolutionTest.kt
index 3ab0e9a84..4e6e04094 100644
--- a/src/test/kotlin/g1901_2000/s1955_count_number_of_special_subsequences/SolutionTest.kt
+++ b/src/test/kotlin/g1901_2000/s1955_count_number_of_special_subsequences/SolutionTest.kt
@@ -18,7 +18,8 @@ internal class SolutionTest {
     @Test
     fun countSpecialSubsequences3() {
         assertThat(
-            Solution().countSpecialSubsequences(intArrayOf(0, 1, 2, 0, 1, 2)), equalTo(7)
+            Solution().countSpecialSubsequences(intArrayOf(0, 1, 2, 0, 1, 2)),
+            equalTo(7),
         )
     }
 }
diff --git a/src/test/kotlin/g1901_2000/s1958_check_if_move_is_legal/SolutionTest.kt b/src/test/kotlin/g1901_2000/s1958_check_if_move_is_legal/SolutionTest.kt
index 825cf52b5..17c5f3a3f 100644
--- a/src/test/kotlin/g1901_2000/s1958_check_if_move_is_legal/SolutionTest.kt
+++ b/src/test/kotlin/g1901_2000/s1958_check_if_move_is_legal/SolutionTest.kt
@@ -18,13 +18,13 @@ internal class SolutionTest {
                         charArrayOf('W', 'B', 'B', '.', 'W', 'W', 'W', 'B'),
                         charArrayOf('.', '.', '.', 'B', '.', '.', '.', '.'),
                         charArrayOf('.', '.', '.', 'B', '.', '.', '.', '.'),
-                        charArrayOf('.', '.', '.', 'W', '.', '.', '.', '.')
+                        charArrayOf('.', '.', '.', 'W', '.', '.', '.', '.'),
                     ),
                     4,
                     3,
-                    'B'
+                    'B',
                 ),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
@@ -41,13 +41,13 @@ internal class SolutionTest {
                         charArrayOf('.', '.', '.', '.', '.', '.', '.', '.'),
                         charArrayOf('.', '.', '.', '.', 'B', 'W', '.', '.'),
                         charArrayOf('.', '.', '.', '.', '.', '.', 'W', '.'),
-                        charArrayOf('.', '.', '.', '.', '.', '.', '.', 'B')
+                        charArrayOf('.', '.', '.', '.', '.', '.', '.', 'B'),
                     ),
                     4,
                     4,
-                    'W'
+                    'W',
                 ),
-            equalTo(false)
+            equalTo(false),
         )
     }
 }
diff --git a/src/test/kotlin/g1901_2000/s1959_minimum_total_space_wasted_with_k_resizing_operations/SolutionTest.kt b/src/test/kotlin/g1901_2000/s1959_minimum_total_space_wasted_with_k_resizing_operations/SolutionTest.kt
index da001dbd3..a23595797 100644
--- a/src/test/kotlin/g1901_2000/s1959_minimum_total_space_wasted_with_k_resizing_operations/SolutionTest.kt
+++ b/src/test/kotlin/g1901_2000/s1959_minimum_total_space_wasted_with_k_resizing_operations/SolutionTest.kt
@@ -14,7 +14,7 @@ internal class SolutionTest {
     fun checkMove2() {
         assertThat(
             Solution().minSpaceWastedKResizing(intArrayOf(10, 20, 30), 1),
-            equalTo(10)
+            equalTo(10),
         )
     }
 
@@ -22,7 +22,7 @@ internal class SolutionTest {
     fun checkMove3() {
         assertThat(
             Solution().minSpaceWastedKResizing(intArrayOf(10, 20, 15, 30, 20), 2),
-            equalTo(15)
+            equalTo(15),
         )
     }
 }
diff --git a/src/test/kotlin/g1901_2000/s1961_check_if_string_is_a_prefix_of_array/SolutionTest.kt b/src/test/kotlin/g1901_2000/s1961_check_if_string_is_a_prefix_of_array/SolutionTest.kt
index 93cf3d391..d1511db3c 100644
--- a/src/test/kotlin/g1901_2000/s1961_check_if_string_is_a_prefix_of_array/SolutionTest.kt
+++ b/src/test/kotlin/g1901_2000/s1961_check_if_string_is_a_prefix_of_array/SolutionTest.kt
@@ -10,9 +10,10 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .isPrefixString(
-                    "iloveleetcode", arrayOf("i", "love", "leetcode", "apples")
+                    "iloveleetcode",
+                    arrayOf("i", "love", "leetcode", "apples"),
                 ),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
@@ -21,9 +22,10 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .isPrefixString(
-                    "iloveleetcode", arrayOf("apples", "i", "love", "leetcode")
+                    "iloveleetcode",
+                    arrayOf("apples", "i", "love", "leetcode"),
                 ),
-            equalTo(false)
+            equalTo(false),
         )
     }
 }
diff --git a/src/test/kotlin/g1901_2000/s1964_find_the_longest_valid_obstacle_course_at_each_position/SolutionTest.kt b/src/test/kotlin/g1901_2000/s1964_find_the_longest_valid_obstacle_course_at_each_position/SolutionTest.kt
index c3b5a153c..8ea15e65c 100644
--- a/src/test/kotlin/g1901_2000/s1964_find_the_longest_valid_obstacle_course_at_each_position/SolutionTest.kt
+++ b/src/test/kotlin/g1901_2000/s1964_find_the_longest_valid_obstacle_course_at_each_position/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun longestObstacleCourseAtEachPosition() {
         assertThat(
             Solution().longestObstacleCourseAtEachPosition(intArrayOf(1, 2, 3, 2)),
-            equalTo(intArrayOf(1, 2, 3, 3))
+            equalTo(intArrayOf(1, 2, 3, 3)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun longestObstacleCourseAtEachPosition2() {
         assertThat(
             Solution().longestObstacleCourseAtEachPosition(intArrayOf(2, 2, 1)),
-            equalTo(intArrayOf(1, 2, 1))
+            equalTo(intArrayOf(1, 2, 1)),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun longestObstacleCourseAtEachPosition3() {
         assertThat(
             Solution().longestObstacleCourseAtEachPosition(intArrayOf(3, 1, 5, 6, 4, 2)),
-            equalTo(intArrayOf(1, 1, 2, 3, 2, 2))
+            equalTo(intArrayOf(1, 1, 2, 3, 2, 2)),
         )
     }
 }
diff --git a/src/test/kotlin/g1901_2000/s1965_employees_with_missing_information/MysqlTest.kt b/src/test/kotlin/g1901_2000/s1965_employees_with_missing_information/MysqlTest.kt
index 9bd20f227..adffd7d3e 100644
--- a/src/test/kotlin/g1901_2000/s1965_employees_with_missing_information/MysqlTest.kt
+++ b/src/test/kotlin/g1901_2000/s1965_employees_with_missing_information/MysqlTest.kt
@@ -29,8 +29,8 @@ import javax.sql.DataSource
             "INSERT INTO Salaries(employee_id, salary)" +
             " VALUES (1, 22517); " +
             "INSERT INTO Salaries(employee_id, salary)" +
-            " VALUES (4, 63539); "
-    ]
+            " VALUES (4, 63539); ",
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -42,12 +42,12 @@ internal class MysqlTest {
                     BufferedReader(
                         FileReader(
                             "src/main/kotlin/g1901_2000/s1965_employees_" +
-                                "with_missing_information/script.sql"
-                        )
+                                "with_missing_information/script.sql",
+                        ),
                     )
                         .lines()
                         .collect(Collectors.joining("\n"))
-                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace("#.*?\\r?\\n".toRegex(), ""),
                 ).use { resultSet ->
                     assertThat(resultSet.next(), equalTo(true))
                     assertThat(resultSet.getInt(1), equalTo(1))
diff --git a/src/test/kotlin/g1901_2000/s1967_number_of_strings_that_appear_as_substrings_in_word/SolutionTest.kt b/src/test/kotlin/g1901_2000/s1967_number_of_strings_that_appear_as_substrings_in_word/SolutionTest.kt
index 665acbb3f..060ba3d71 100644
--- a/src/test/kotlin/g1901_2000/s1967_number_of_strings_that_appear_as_substrings_in_word/SolutionTest.kt
+++ b/src/test/kotlin/g1901_2000/s1967_number_of_strings_that_appear_as_substrings_in_word/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun numOfStrings() {
         assertThat(
             Solution().numOfStrings(arrayOf("a", "abc", "bc", "d"), "abc"),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun numOfStrings2() {
         assertThat(
             Solution().numOfStrings(arrayOf("a", "b", "c"), "aaaaabbbbb"),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
diff --git a/src/test/kotlin/g1901_2000/s1968_array_with_elements_not_equal_to_average_of_neighbors/SolutionTest.kt b/src/test/kotlin/g1901_2000/s1968_array_with_elements_not_equal_to_average_of_neighbors/SolutionTest.kt
index a3408dd16..b2542d440 100644
--- a/src/test/kotlin/g1901_2000/s1968_array_with_elements_not_equal_to_average_of_neighbors/SolutionTest.kt
+++ b/src/test/kotlin/g1901_2000/s1968_array_with_elements_not_equal_to_average_of_neighbors/SolutionTest.kt
@@ -10,9 +10,10 @@ internal class SolutionTest {
     fun rearrangeArray() {
         assertThat(
             CommonUtils.compareArray(
-                Solution().rearrangeArray(intArrayOf(1, 2, 3, 4, 5)), intArrayOf(1, 2, 4, 5, 3)
+                Solution().rearrangeArray(intArrayOf(1, 2, 3, 4, 5)),
+                intArrayOf(1, 2, 4, 5, 3),
             ),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
@@ -20,9 +21,10 @@ internal class SolutionTest {
     fun rearrangeArray2() {
         assertThat(
             CommonUtils.compareArray(
-                Solution().rearrangeArray(intArrayOf(6, 2, 0, 9, 7)), intArrayOf(6, 2, 0, 9, 7)
+                Solution().rearrangeArray(intArrayOf(6, 2, 0, 9, 7)),
+                intArrayOf(6, 2, 0, 9, 7),
             ),
-            equalTo(true)
+            equalTo(true),
         )
     }
 }
diff --git a/src/test/kotlin/g1901_2000/s1970_last_day_where_you_can_still_cross/SolutionTest.kt b/src/test/kotlin/g1901_2000/s1970_last_day_where_you_can_still_cross/SolutionTest.kt
index 572696ede..1ffe3debd 100644
--- a/src/test/kotlin/g1901_2000/s1970_last_day_where_you_can_still_cross/SolutionTest.kt
+++ b/src/test/kotlin/g1901_2000/s1970_last_day_where_you_can_still_cross/SolutionTest.kt
@@ -11,9 +11,9 @@ internal class SolutionTest {
             Solution().latestDayToCross(
                 2,
                 2,
-                arrayOf(intArrayOf(1, 1), intArrayOf(2, 1), intArrayOf(1, 2), intArrayOf(2, 2))
+                arrayOf(intArrayOf(1, 1), intArrayOf(2, 1), intArrayOf(1, 2), intArrayOf(2, 2)),
             ),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -23,9 +23,9 @@ internal class SolutionTest {
             Solution().latestDayToCross(
                 2,
                 2,
-                arrayOf(intArrayOf(1, 1), intArrayOf(1, 2), intArrayOf(2, 1), intArrayOf(2, 2))
+                arrayOf(intArrayOf(1, 1), intArrayOf(1, 2), intArrayOf(2, 1), intArrayOf(2, 2)),
             ),
-            equalTo(1)
+            equalTo(1),
         )
     }
 
@@ -45,10 +45,10 @@ internal class SolutionTest {
                         intArrayOf(1, 3),
                         intArrayOf(2, 3),
                         intArrayOf(3, 2),
-                        intArrayOf(3, 1)
-                    )
+                        intArrayOf(3, 1),
+                    ),
                 ),
-            equalTo(3)
+            equalTo(3),
         )
     }
 }
diff --git a/src/test/kotlin/g1901_2000/s1971_find_if_path_exists_in_graph/SolutionTest.kt b/src/test/kotlin/g1901_2000/s1971_find_if_path_exists_in_graph/SolutionTest.kt
index d1cdd90c3..5be6013f6 100644
--- a/src/test/kotlin/g1901_2000/s1971_find_if_path_exists_in_graph/SolutionTest.kt
+++ b/src/test/kotlin/g1901_2000/s1971_find_if_path_exists_in_graph/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun validPath() {
         assertThat(
             Solution().validPath(3, arrayOf(intArrayOf(0, 1), intArrayOf(1, 2), intArrayOf(2, 0)), 0, 2),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
@@ -21,9 +21,9 @@ internal class SolutionTest {
                     6,
                     arrayOf(intArrayOf(0, 1), intArrayOf(0, 2), intArrayOf(3, 5), intArrayOf(5, 4), intArrayOf(4, 3)),
                     0,
-                    5
+                    5,
                 ),
-            equalTo(false)
+            equalTo(false),
         )
     }
 }
diff --git a/src/test/kotlin/g1901_2000/s1975_maximum_matrix_sum/SolutionTest.kt b/src/test/kotlin/g1901_2000/s1975_maximum_matrix_sum/SolutionTest.kt
index 4c56dfbff..a2c7578ad 100644
--- a/src/test/kotlin/g1901_2000/s1975_maximum_matrix_sum/SolutionTest.kt
+++ b/src/test/kotlin/g1901_2000/s1975_maximum_matrix_sum/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun maxMatrixSum() {
         assertThat(
             Solution().maxMatrixSum(arrayOf(intArrayOf(1, -1), intArrayOf(-1, 1))),
-            equalTo(4L)
+            equalTo(4L),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun maxMatrixSum2() {
         assertThat(
             Solution().maxMatrixSum(arrayOf(intArrayOf(1, 2, 3), intArrayOf(-1, -2, -3), intArrayOf(1, 2, 3))),
-            equalTo(16L)
+            equalTo(16L),
         )
     }
 }
diff --git a/src/test/kotlin/g1901_2000/s1976_number_of_ways_to_arrive_at_destination/SolutionTest.kt b/src/test/kotlin/g1901_2000/s1976_number_of_ways_to_arrive_at_destination/SolutionTest.kt
index 17d06a607..47bb4479d 100644
--- a/src/test/kotlin/g1901_2000/s1976_number_of_ways_to_arrive_at_destination/SolutionTest.kt
+++ b/src/test/kotlin/g1901_2000/s1976_number_of_ways_to_arrive_at_destination/SolutionTest.kt
@@ -21,10 +21,10 @@ internal class SolutionTest {
                         intArrayOf(6, 5, 1),
                         intArrayOf(2, 5, 1),
                         intArrayOf(0, 4, 5),
-                        intArrayOf(4, 6, 2)
-                    )
+                        intArrayOf(4, 6, 2),
+                    ),
                 ),
-            equalTo(4)
+            equalTo(4),
         )
     }
 
diff --git a/src/test/kotlin/g1901_2000/s1978_employees_whose_manager_left_the_company/MysqlTest.kt b/src/test/kotlin/g1901_2000/s1978_employees_whose_manager_left_the_company/MysqlTest.kt
index 59265fc9c..d6d267168 100644
--- a/src/test/kotlin/g1901_2000/s1978_employees_whose_manager_left_the_company/MysqlTest.kt
+++ b/src/test/kotlin/g1901_2000/s1978_employees_whose_manager_left_the_company/MysqlTest.kt
@@ -28,8 +28,8 @@ import javax.sql.DataSource
             "INSERT INTO Employees(employee_id, name, manager_id, salary)" +
             " VALUES (9, 'Mikaela', null, 50937); " +
             "INSERT INTO Employees(employee_id, name, manager_id, salary)" +
-            " VALUES (11, 'Joziah', 6, 28485); "
-    ]
+            " VALUES (11, 'Joziah', 6, 28485); ",
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -41,12 +41,12 @@ internal class MysqlTest {
                     BufferedReader(
                         FileReader(
                             "src/main/kotlin/g1901_2000/" +
-                                "s1978_employees_whose_manager_left_the_company/script.sql"
-                        )
+                                "s1978_employees_whose_manager_left_the_company/script.sql",
+                        ),
                     )
                         .lines()
                         .collect(Collectors.joining("\n"))
-                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace("#.*?\\r?\\n".toRegex(), ""),
                 ).use { resultSet ->
                     assertThat(resultSet.next(), equalTo(true))
                     assertThat(resultSet.getInt(1), equalTo(11))
diff --git a/src/test/kotlin/g1901_2000/s1980_find_unique_binary_string/SolutionTest.kt b/src/test/kotlin/g1901_2000/s1980_find_unique_binary_string/SolutionTest.kt
index 8d55703ab..4c3066869 100644
--- a/src/test/kotlin/g1901_2000/s1980_find_unique_binary_string/SolutionTest.kt
+++ b/src/test/kotlin/g1901_2000/s1980_find_unique_binary_string/SolutionTest.kt
@@ -8,14 +8,16 @@ internal class SolutionTest {
     @Test
     fun findDifferentBinaryString() {
         assertThat(
-            Solution().findDifferentBinaryString(arrayOf("01", "10")), equalTo("00")
+            Solution().findDifferentBinaryString(arrayOf("01", "10")),
+            equalTo("00"),
         )
     }
 
     @Test
     fun findDifferentBinaryString2() {
         assertThat(
-            Solution().findDifferentBinaryString(arrayOf("00", "01")), equalTo("10")
+            Solution().findDifferentBinaryString(arrayOf("00", "01")),
+            equalTo("10"),
         )
     }
 
@@ -23,7 +25,7 @@ internal class SolutionTest {
     fun findDifferentBinaryString3() {
         assertThat(
             Solution().findDifferentBinaryString(arrayOf("111", "011", "001")),
-            equalTo("000")
+            equalTo("000"),
         )
     }
 }
diff --git a/src/test/kotlin/g1901_2000/s1981_minimize_the_difference_between_target_and_chosen_elements/SolutionTest.kt b/src/test/kotlin/g1901_2000/s1981_minimize_the_difference_between_target_and_chosen_elements/SolutionTest.kt
index d9fa512fc..00af6bb1c 100644
--- a/src/test/kotlin/g1901_2000/s1981_minimize_the_difference_between_target_and_chosen_elements/SolutionTest.kt
+++ b/src/test/kotlin/g1901_2000/s1981_minimize_the_difference_between_target_and_chosen_elements/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .minimizeTheDifference(arrayOf(intArrayOf(1, 2, 3), intArrayOf(4, 5, 6), intArrayOf(7, 8, 9)), 13),
-            equalTo(0)
+            equalTo(0),
         )
     }
 
@@ -18,14 +18,15 @@ internal class SolutionTest {
     fun minimizeTheDifference2() {
         assertThat(
             Solution().minimizeTheDifference(arrayOf(intArrayOf(1), intArrayOf(2), intArrayOf(3)), 100),
-            equalTo(94)
+            equalTo(94),
         )
     }
 
     @Test
     fun minimizeTheDifference3() {
         assertThat(
-            Solution().minimizeTheDifference(arrayOf(intArrayOf(1, 2, 9, 8, 7)), 6), equalTo(1)
+            Solution().minimizeTheDifference(arrayOf(intArrayOf(1, 2, 9, 8, 7)), 6),
+            equalTo(1),
         )
     }
 }
diff --git a/src/test/kotlin/g1901_2000/s1982_find_array_given_subset_sums/SolutionTest.kt b/src/test/kotlin/g1901_2000/s1982_find_array_given_subset_sums/SolutionTest.kt
index bf5ff9062..92172d764 100644
--- a/src/test/kotlin/g1901_2000/s1982_find_array_given_subset_sums/SolutionTest.kt
+++ b/src/test/kotlin/g1901_2000/s1982_find_array_given_subset_sums/SolutionTest.kt
@@ -9,14 +9,15 @@ internal class SolutionTest {
     fun recoverArray() {
         assertThat(
             Solution().recoverArray(3, intArrayOf(-3, -2, -1, 0, 0, 1, 2, 3)),
-            equalTo(intArrayOf(1, 2, -3))
+            equalTo(intArrayOf(1, 2, -3)),
         )
     }
 
     @Test
     fun recoverArray2() {
         assertThat(
-            Solution().recoverArray(2, intArrayOf(0, 0, 0, 0)), equalTo(intArrayOf(0, 0))
+            Solution().recoverArray(2, intArrayOf(0, 0, 0, 0)),
+            equalTo(intArrayOf(0, 0)),
         )
     }
 
@@ -25,9 +26,10 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .recoverArray(
-                    4, intArrayOf(0, 0, 5, 5, 4, -1, 4, 9, 9, -1, 4, 3, 4, 8, 3, 8)
+                    4,
+                    intArrayOf(0, 0, 5, 5, 4, -1, 4, 9, 9, -1, 4, 3, 4, 8, 3, 8),
                 ),
-            equalTo(intArrayOf(0, -1, 4, 5))
+            equalTo(intArrayOf(0, -1, 4, 5)),
         )
     }
 }
diff --git a/src/test/kotlin/g1901_2000/s1985_find_the_kth_largest_integer_in_the_array/SolutionTest.kt b/src/test/kotlin/g1901_2000/s1985_find_the_kth_largest_integer_in_the_array/SolutionTest.kt
index 2b02b7806..6cff5a9ff 100644
--- a/src/test/kotlin/g1901_2000/s1985_find_the_kth_largest_integer_in_the_array/SolutionTest.kt
+++ b/src/test/kotlin/g1901_2000/s1985_find_the_kth_largest_integer_in_the_array/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun kthLargestNumber() {
         assertThat(
             Solution().kthLargestNumber(arrayOf("3", "6", "7", "10"), 4),
-            equalTo("3")
+            equalTo("3"),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun kthLargestNumber2() {
         assertThat(
             Solution().kthLargestNumber(arrayOf("2", "21", "12", "1"), 3),
-            equalTo("2")
+            equalTo("2"),
         )
     }
 
diff --git a/src/test/kotlin/g1901_2000/s1992_find_all_groups_of_farmland/SolutionTest.kt b/src/test/kotlin/g1901_2000/s1992_find_all_groups_of_farmland/SolutionTest.kt
index 1e8579af1..730ead9e3 100644
--- a/src/test/kotlin/g1901_2000/s1992_find_all_groups_of_farmland/SolutionTest.kt
+++ b/src/test/kotlin/g1901_2000/s1992_find_all_groups_of_farmland/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun findFarmland() {
         assertThat(
             Solution().findFarmland(arrayOf(intArrayOf(1, 0, 0), intArrayOf(0, 1, 1), intArrayOf(0, 1, 1))),
-            equalTo(arrayOf(intArrayOf(0, 0, 0, 0), intArrayOf(1, 1, 2, 2)))
+            equalTo(arrayOf(intArrayOf(0, 0, 0, 0), intArrayOf(1, 1, 2, 2))),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun findFarmland2() {
         assertThat(
             Solution().findFarmland(arrayOf(intArrayOf(1, 1), intArrayOf(1, 1))),
-            equalTo(arrayOf(intArrayOf(0, 0, 1, 1)))
+            equalTo(arrayOf(intArrayOf(0, 0, 1, 1))),
         )
     }
 
diff --git a/src/test/kotlin/g1901_2000/s1996_the_number_of_weak_characters_in_the_game/SolutionTest.kt b/src/test/kotlin/g1901_2000/s1996_the_number_of_weak_characters_in_the_game/SolutionTest.kt
index 107364d6b..4c4f00ba4 100644
--- a/src/test/kotlin/g1901_2000/s1996_the_number_of_weak_characters_in_the_game/SolutionTest.kt
+++ b/src/test/kotlin/g1901_2000/s1996_the_number_of_weak_characters_in_the_game/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun numberOfWeakCharacters() {
         assertThat(
             Solution().numberOfWeakCharacters(arrayOf(intArrayOf(5, 5), intArrayOf(6, 3), intArrayOf(3, 6))),
-            equalTo(0)
+            equalTo(0),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun numberOfWeakCharacters2() {
         assertThat(
             Solution().numberOfWeakCharacters(arrayOf(intArrayOf(2, 2), intArrayOf(3, 3))),
-            equalTo(1)
+            equalTo(1),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun numberOfWeakCharacters3() {
         assertThat(
             Solution().numberOfWeakCharacters(arrayOf(intArrayOf(1, 5), intArrayOf(10, 4), intArrayOf(4, 3))),
-            equalTo(1)
+            equalTo(1),
         )
     }
 }
diff --git a/src/test/kotlin/g2001_2100/s2001_number_of_pairs_of_interchangeable_rectangles/SolutionTest.kt b/src/test/kotlin/g2001_2100/s2001_number_of_pairs_of_interchangeable_rectangles/SolutionTest.kt
index 541de87ae..27965554d 100644
--- a/src/test/kotlin/g2001_2100/s2001_number_of_pairs_of_interchangeable_rectangles/SolutionTest.kt
+++ b/src/test/kotlin/g2001_2100/s2001_number_of_pairs_of_interchangeable_rectangles/SolutionTest.kt
@@ -14,10 +14,10 @@ internal class SolutionTest {
                         intArrayOf(4, 8),
                         intArrayOf(3, 6),
                         intArrayOf(10, 20),
-                        intArrayOf(15, 30)
-                    )
+                        intArrayOf(15, 30),
+                    ),
                 ),
-            equalTo(6L)
+            equalTo(6L),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun interchangeableRectangles2() {
         assertThat(
             Solution().interchangeableRectangles(arrayOf(intArrayOf(4, 5), intArrayOf(7, 8))),
-            equalTo(0L)
+            equalTo(0L),
         )
     }
 }
diff --git a/src/test/kotlin/g2001_2100/s2003_smallest_missing_genetic_value_in_each_subtree/SolutionTest.kt b/src/test/kotlin/g2001_2100/s2003_smallest_missing_genetic_value_in_each_subtree/SolutionTest.kt
index 86ba94389..da4e1a2d7 100644
--- a/src/test/kotlin/g2001_2100/s2003_smallest_missing_genetic_value_in_each_subtree/SolutionTest.kt
+++ b/src/test/kotlin/g2001_2100/s2003_smallest_missing_genetic_value_in_each_subtree/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .smallestMissingValueSubtree(intArrayOf(-1, 0, 0, 2), intArrayOf(1, 2, 3, 4)),
-            equalTo(intArrayOf(5, 1, 1, 1))
+            equalTo(intArrayOf(5, 1, 1, 1)),
         )
     }
 
@@ -19,7 +19,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .smallestMissingValueSubtree(intArrayOf(-1, 0, 1, 0, 3, 3), intArrayOf(5, 4, 6, 2, 1, 3)),
-            equalTo(intArrayOf(7, 1, 1, 4, 2, 1))
+            equalTo(intArrayOf(7, 1, 1, 4, 2, 1)),
         )
     }
 
@@ -28,7 +28,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .smallestMissingValueSubtree(intArrayOf(-1, 2, 3, 0, 2, 4, 1), intArrayOf(2, 3, 4, 5, 6, 7, 8)),
-            equalTo(intArrayOf(1, 1, 1, 1, 1, 1, 1))
+            equalTo(intArrayOf(1, 1, 1, 1, 1, 1, 1)),
         )
     }
 }
diff --git a/src/test/kotlin/g2001_2100/s2007_find_original_array_from_doubled_array/SolutionTest.kt b/src/test/kotlin/g2001_2100/s2007_find_original_array_from_doubled_array/SolutionTest.kt
index aa34d6843..223af3350 100644
--- a/src/test/kotlin/g2001_2100/s2007_find_original_array_from_doubled_array/SolutionTest.kt
+++ b/src/test/kotlin/g2001_2100/s2007_find_original_array_from_doubled_array/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun findOriginalArray() {
         assertThat(
             Solution().findOriginalArray(intArrayOf(1, 3, 4, 2, 6, 8)),
-            equalTo(intArrayOf(1, 3, 4))
+            equalTo(intArrayOf(1, 3, 4)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun findOriginalArray2() {
         assertThat(
             Solution().findOriginalArray(intArrayOf(6, 3, 0, 1)),
-            equalTo(intArrayOf())
+            equalTo(intArrayOf()),
         )
     }
 
diff --git a/src/test/kotlin/g2001_2100/s2008_maximum_earnings_from_taxi/SolutionTest.kt b/src/test/kotlin/g2001_2100/s2008_maximum_earnings_from_taxi/SolutionTest.kt
index 8327c1fb0..18e8a7bdf 100644
--- a/src/test/kotlin/g2001_2100/s2008_maximum_earnings_from_taxi/SolutionTest.kt
+++ b/src/test/kotlin/g2001_2100/s2008_maximum_earnings_from_taxi/SolutionTest.kt
@@ -8,7 +8,8 @@ internal class SolutionTest {
     @Test
     fun maxTaxiEarnings() {
         assertThat(
-            Solution().maxTaxiEarnings(5, arrayOf(intArrayOf(2, 5, 4), intArrayOf(1, 5, 1))), equalTo(7L)
+            Solution().maxTaxiEarnings(5, arrayOf(intArrayOf(2, 5, 4), intArrayOf(1, 5, 1))),
+            equalTo(7L),
         )
     }
 
@@ -24,10 +25,10 @@ internal class SolutionTest {
                         intArrayOf(10, 12, 3),
                         intArrayOf(11, 12, 2),
                         intArrayOf(12, 15, 2),
-                        intArrayOf(13, 18, 1)
-                    )
+                        intArrayOf(13, 18, 1),
+                    ),
                 ),
-            equalTo(20L)
+            equalTo(20L),
         )
     }
 }
diff --git a/src/test/kotlin/g2001_2100/s2011_final_value_of_variable_after_performing_operations/SolutionTest.kt b/src/test/kotlin/g2001_2100/s2011_final_value_of_variable_after_performing_operations/SolutionTest.kt
index cc95b901b..c4f087244 100644
--- a/src/test/kotlin/g2001_2100/s2011_final_value_of_variable_after_performing_operations/SolutionTest.kt
+++ b/src/test/kotlin/g2001_2100/s2011_final_value_of_variable_after_performing_operations/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun finalValueAfterOperations() {
         assertThat(
             Solution().finalValueAfterOperations(arrayOf("--X", "X++", "X++")),
-            equalTo(1)
+            equalTo(1),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun finalValueAfterOperations2() {
         assertThat(
             Solution().finalValueAfterOperations(arrayOf("++X", "++X", "X++")),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun finalValueAfterOperations3() {
         assertThat(
             Solution().finalValueAfterOperations(arrayOf("X++", "++X", "--X", "X--")),
-            equalTo(0)
+            equalTo(0),
         )
     }
 }
diff --git a/src/test/kotlin/g2001_2100/s2017_grid_game/SolutionTest.kt b/src/test/kotlin/g2001_2100/s2017_grid_game/SolutionTest.kt
index 179eabfac..73b4dc1c9 100644
--- a/src/test/kotlin/g2001_2100/s2017_grid_game/SolutionTest.kt
+++ b/src/test/kotlin/g2001_2100/s2017_grid_game/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun gridGame() {
         assertThat(
             Solution().gridGame(arrayOf(intArrayOf(2, 5, 4), intArrayOf(1, 5, 1))),
-            equalTo(4L)
+            equalTo(4L),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun gridGame2() {
         assertThat(
             Solution().gridGame(arrayOf(intArrayOf(3, 3, 1), intArrayOf(8, 5, 2))),
-            equalTo(4L)
+            equalTo(4L),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun gridGame3() {
         assertThat(
             Solution().gridGame(arrayOf(intArrayOf(1, 3, 1, 15), intArrayOf(1, 3, 3, 1))),
-            equalTo(7L)
+            equalTo(7L),
         )
     }
 }
diff --git a/src/test/kotlin/g2001_2100/s2018_check_if_word_can_be_placed_in_crossword/SolutionTest.kt b/src/test/kotlin/g2001_2100/s2018_check_if_word_can_be_placed_in_crossword/SolutionTest.kt
index 823ec1493..57d1d49df 100644
--- a/src/test/kotlin/g2001_2100/s2018_check_if_word_can_be_placed_in_crossword/SolutionTest.kt
+++ b/src/test/kotlin/g2001_2100/s2018_check_if_word_can_be_placed_in_crossword/SolutionTest.kt
@@ -11,9 +11,9 @@ internal class SolutionTest {
             Solution()
                 .placeWordInCrossword(
                     arrayOf(charArrayOf('#', ' ', '#'), charArrayOf(' ', ' ', '#'), charArrayOf('#', 'c', ' ')),
-                    "abc"
+                    "abc",
                 ),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
@@ -23,9 +23,9 @@ internal class SolutionTest {
             Solution()
                 .placeWordInCrossword(
                     arrayOf(charArrayOf(' ', '#', 'a'), charArrayOf(' ', '#', 'c'), charArrayOf(' ', '#', 'a')),
-                    "ac"
+                    "ac",
                 ),
-            equalTo(false)
+            equalTo(false),
         )
     }
 
@@ -35,9 +35,9 @@ internal class SolutionTest {
             Solution()
                 .placeWordInCrossword(
                     arrayOf(charArrayOf('#', ' ', '#'), charArrayOf(' ', ' ', '#'), charArrayOf('#', ' ', 'c')),
-                    "ca"
+                    "ca",
                 ),
-            equalTo(true)
+            equalTo(true),
         )
     }
 }
diff --git a/src/test/kotlin/g2001_2100/s2019_the_score_of_students_solving_math_expression/SolutionTest.kt b/src/test/kotlin/g2001_2100/s2019_the_score_of_students_solving_math_expression/SolutionTest.kt
index 87357c039..62357e4ad 100644
--- a/src/test/kotlin/g2001_2100/s2019_the_score_of_students_solving_math_expression/SolutionTest.kt
+++ b/src/test/kotlin/g2001_2100/s2019_the_score_of_students_solving_math_expression/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun scoreOfStudents() {
         assertThat(
             Solution().scoreOfStudents("3+5*2", intArrayOf(13, 0, 10, 13, 13, 16, 16)),
-            equalTo(19)
+            equalTo(19),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun scoreOfStudents2() {
         assertThat(
             Solution().scoreOfStudents("6+0*1", intArrayOf(12, 9, 6, 4, 8, 6)),
-            equalTo(10)
+            equalTo(10),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun scoreOfStudents3() {
         assertThat(
             Solution().scoreOfStudents("3+5*2", intArrayOf(13, 0, 10, 13, 13, 16, 16)),
-            equalTo(19)
+            equalTo(19),
         )
     }
 }
diff --git a/src/test/kotlin/g2001_2100/s2022_convert_1d_array_into_2d_array/SolutionTest.kt b/src/test/kotlin/g2001_2100/s2022_convert_1d_array_into_2d_array/SolutionTest.kt
index b5c41b874..15a4eee3c 100644
--- a/src/test/kotlin/g2001_2100/s2022_convert_1d_array_into_2d_array/SolutionTest.kt
+++ b/src/test/kotlin/g2001_2100/s2022_convert_1d_array_into_2d_array/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun construct2DArray() {
         assertThat(
             Solution().construct2DArray(intArrayOf(1, 2, 3, 4), 2, 2),
-            equalTo(arrayOf(intArrayOf(1, 2), intArrayOf(3, 4)))
+            equalTo(arrayOf(intArrayOf(1, 2), intArrayOf(3, 4))),
         )
     }
 
@@ -17,14 +17,15 @@ internal class SolutionTest {
     fun construct2DArray2() {
         assertThat(
             Solution().construct2DArray(intArrayOf(1, 2, 3), 1, 3),
-            equalTo(arrayOf(intArrayOf(1, 2, 3)))
+            equalTo(arrayOf(intArrayOf(1, 2, 3))),
         )
     }
 
     @Test
     fun construct2DArray3() {
         assertThat(
-            Solution().construct2DArray(intArrayOf(1, 2), 1, 1), equalTo(arrayOf())
+            Solution().construct2DArray(intArrayOf(1, 2), 1, 1),
+            equalTo(arrayOf()),
         )
     }
 }
diff --git a/src/test/kotlin/g2001_2100/s2023_number_of_pairs_of_strings_with_concatenation_equal_to_target/SolutionTest.kt b/src/test/kotlin/g2001_2100/s2023_number_of_pairs_of_strings_with_concatenation_equal_to_target/SolutionTest.kt
index 860ecaa3c..84c3146f4 100644
--- a/src/test/kotlin/g2001_2100/s2023_number_of_pairs_of_strings_with_concatenation_equal_to_target/SolutionTest.kt
+++ b/src/test/kotlin/g2001_2100/s2023_number_of_pairs_of_strings_with_concatenation_equal_to_target/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun numOfPairs() {
         assertThat(
             Solution().numOfPairs(arrayOf("777", "7", "77", "77"), "7777"),
-            equalTo(4)
+            equalTo(4),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun numOfPairs2() {
         assertThat(
             Solution().numOfPairs(arrayOf("123", "4", "12", "34"), "1234"),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
diff --git a/src/test/kotlin/g2001_2100/s2025_maximum_number_of_ways_to_partition_an_array/SolutionTest.kt b/src/test/kotlin/g2001_2100/s2025_maximum_number_of_ways_to_partition_an_array/SolutionTest.kt
index 94b3a4f08..96ad9500a 100644
--- a/src/test/kotlin/g2001_2100/s2025_maximum_number_of_ways_to_partition_an_array/SolutionTest.kt
+++ b/src/test/kotlin/g2001_2100/s2025_maximum_number_of_ways_to_partition_an_array/SolutionTest.kt
@@ -21,9 +21,9 @@ internal class SolutionTest {
             Solution()
                 .waysToPartition(
                     intArrayOf(22, 4, -25, -20, -15, 15, -16, 7, 19, -10, 0, -13, -14),
-                    -33
+                    -33,
                 ),
-            equalTo(4)
+            equalTo(4),
         )
     }
 }
diff --git a/src/test/kotlin/g2001_2100/s2028_find_missing_observations/SolutionTest.kt b/src/test/kotlin/g2001_2100/s2028_find_missing_observations/SolutionTest.kt
index e0ec6d36a..8e055cdf2 100644
--- a/src/test/kotlin/g2001_2100/s2028_find_missing_observations/SolutionTest.kt
+++ b/src/test/kotlin/g2001_2100/s2028_find_missing_observations/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun missingRolls() {
         assertThat(
             Solution().missingRolls(intArrayOf(3, 2, 4, 3), 4, 2),
-            equalTo(intArrayOf(6, 6))
+            equalTo(intArrayOf(6, 6)),
         )
     }
 
@@ -17,14 +17,15 @@ internal class SolutionTest {
     fun missingRolls2() {
         assertThat(
             Solution().missingRolls(intArrayOf(1, 5, 6), 3, 4),
-            equalTo(intArrayOf(6, 1, 1, 1))
+            equalTo(intArrayOf(6, 1, 1, 1)),
         )
     }
 
     @Test
     fun missingRolls3() {
         assertThat(
-            Solution().missingRolls(intArrayOf(1, 2, 3, 4), 6, 4), equalTo(intArrayOf())
+            Solution().missingRolls(intArrayOf(1, 2, 3, 4), 6, 4),
+            equalTo(intArrayOf()),
         )
     }
 }
diff --git a/src/test/kotlin/g2001_2100/s2032_two_out_of_three/SolutionTest.kt b/src/test/kotlin/g2001_2100/s2032_two_out_of_three/SolutionTest.kt
index cbb7510e6..4e6b8a1a8 100644
--- a/src/test/kotlin/g2001_2100/s2032_two_out_of_three/SolutionTest.kt
+++ b/src/test/kotlin/g2001_2100/s2032_two_out_of_three/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .twoOutOfThree(intArrayOf(1, 1, 3, 2), intArrayOf(2, 3), intArrayOf(3)),
-            equalTo(mutableListOf(2, 3))
+            equalTo(mutableListOf(2, 3)),
         )
     }
 
@@ -18,7 +18,7 @@ internal class SolutionTest {
     fun twoOutOfThree2() {
         assertThat(
             Solution().twoOutOfThree(intArrayOf(3, 1), intArrayOf(2, 3), intArrayOf(1, 2)),
-            equalTo(mutableListOf(1, 2, 3))
+            equalTo(mutableListOf(1, 2, 3)),
         )
     }
 
@@ -27,7 +27,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .twoOutOfThree(intArrayOf(1, 2, 2), intArrayOf(4, 3, 3), intArrayOf(5)),
-            equalTo(emptyList<Any>())
+            equalTo(emptyList<Any>()),
         )
     }
 }
diff --git a/src/test/kotlin/g2001_2100/s2033_minimum_operations_to_make_a_uni_value_grid/SolutionTest.kt b/src/test/kotlin/g2001_2100/s2033_minimum_operations_to_make_a_uni_value_grid/SolutionTest.kt
index 1d99decf8..f0117edfd 100644
--- a/src/test/kotlin/g2001_2100/s2033_minimum_operations_to_make_a_uni_value_grid/SolutionTest.kt
+++ b/src/test/kotlin/g2001_2100/s2033_minimum_operations_to_make_a_uni_value_grid/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun minOperations() {
         assertThat(
             Solution().minOperations(arrayOf(intArrayOf(2, 4), intArrayOf(6, 8)), 2),
-            equalTo(4)
+            equalTo(4),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun minOperations2() {
         assertThat(
             Solution().minOperations(arrayOf(intArrayOf(1, 5), intArrayOf(2, 3)), 1),
-            equalTo(5)
+            equalTo(5),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun minOperations3() {
         assertThat(
             Solution().minOperations(arrayOf(intArrayOf(1, 2), intArrayOf(3, 4)), 2),
-            equalTo(-1)
+            equalTo(-1),
         )
     }
 }
diff --git a/src/test/kotlin/g2001_2100/s2037_minimum_number_of_moves_to_seat_everyone/SolutionTest.kt b/src/test/kotlin/g2001_2100/s2037_minimum_number_of_moves_to_seat_everyone/SolutionTest.kt
index 641060991..910a2f6f1 100644
--- a/src/test/kotlin/g2001_2100/s2037_minimum_number_of_moves_to_seat_everyone/SolutionTest.kt
+++ b/src/test/kotlin/g2001_2100/s2037_minimum_number_of_moves_to_seat_everyone/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun minMovesToSeat() {
         assertThat(
             Solution().minMovesToSeat(intArrayOf(3, 1, 5), intArrayOf(2, 7, 4)),
-            equalTo(4)
+            equalTo(4),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun minMovesToSeat2() {
         assertThat(
             Solution().minMovesToSeat(intArrayOf(4, 1, 5, 9), intArrayOf(1, 3, 2, 6)),
-            equalTo(7)
+            equalTo(7),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun minMovesToSeat3() {
         assertThat(
             Solution().minMovesToSeat(intArrayOf(2, 2, 6, 6), intArrayOf(1, 3, 2, 6)),
-            equalTo(4)
+            equalTo(4),
         )
     }
 }
diff --git a/src/test/kotlin/g2001_2100/s2039_the_time_when_the_network_becomes_idle/SolutionTest.kt b/src/test/kotlin/g2001_2100/s2039_the_time_when_the_network_becomes_idle/SolutionTest.kt
index 854f73f84..957e585b7 100644
--- a/src/test/kotlin/g2001_2100/s2039_the_time_when_the_network_becomes_idle/SolutionTest.kt
+++ b/src/test/kotlin/g2001_2100/s2039_the_time_when_the_network_becomes_idle/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .networkBecomesIdle(arrayOf(intArrayOf(0, 1), intArrayOf(1, 2)), intArrayOf(0, 2, 1)),
-            equalTo(8)
+            equalTo(8),
         )
     }
 
@@ -20,9 +20,9 @@ internal class SolutionTest {
             Solution()
                 .networkBecomesIdle(
                     arrayOf(intArrayOf(0, 1), intArrayOf(0, 2), intArrayOf(1, 2)),
-                    intArrayOf(0, 10, 10)
+                    intArrayOf(0, 10, 10),
                 ),
-            equalTo(3)
+            equalTo(3),
         )
     }
 }
diff --git a/src/test/kotlin/g2001_2100/s2040_kth_smallest_product_of_two_sorted_arrays/SolutionTest.kt b/src/test/kotlin/g2001_2100/s2040_kth_smallest_product_of_two_sorted_arrays/SolutionTest.kt
index e21d4e1d6..0e33f31bd 100644
--- a/src/test/kotlin/g2001_2100/s2040_kth_smallest_product_of_two_sorted_arrays/SolutionTest.kt
+++ b/src/test/kotlin/g2001_2100/s2040_kth_smallest_product_of_two_sorted_arrays/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun kthSmallestProduct() {
         assertThat(
             Solution().kthSmallestProduct(intArrayOf(2, 5), intArrayOf(3, 4), 2),
-            equalTo(8L)
+            equalTo(8L),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun kthSmallestProduct2() {
         assertThat(
             Solution().kthSmallestProduct(intArrayOf(-4, -2, 0, 3), intArrayOf(2, 4), 6),
-            equalTo(0L)
+            equalTo(0L),
         )
     }
 
@@ -26,7 +26,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .kthSmallestProduct(intArrayOf(-2, -1, 0, 1, 2), intArrayOf(-3, -1, 2, 4, 5), 3),
-            equalTo(-6L)
+            equalTo(-6L),
         )
     }
 }
diff --git a/src/test/kotlin/g2001_2100/s2042_check_if_numbers_are_ascending_in_a_sentence/SolutionTest.kt b/src/test/kotlin/g2001_2100/s2042_check_if_numbers_are_ascending_in_a_sentence/SolutionTest.kt
index 160fdd28b..07307c4fc 100644
--- a/src/test/kotlin/g2001_2100/s2042_check_if_numbers_are_ascending_in_a_sentence/SolutionTest.kt
+++ b/src/test/kotlin/g2001_2100/s2042_check_if_numbers_are_ascending_in_a_sentence/SolutionTest.kt
@@ -10,9 +10,9 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .areNumbersAscending(
-                    "1 box has 3 blue 4 red 6 green and 12 yellow marbles"
+                    "1 box has 3 blue 4 red 6 green and 12 yellow marbles",
                 ),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
@@ -26,9 +26,9 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .areNumbersAscending(
-                    "sunset is at 7 51 pm overnight lows will be in the low 50 and 60 s"
+                    "sunset is at 7 51 pm overnight lows will be in the low 50 and 60 s",
                 ),
-            equalTo(false)
+            equalTo(false),
         )
     }
 }
diff --git a/src/test/kotlin/g2001_2100/s2045_second_minimum_time_to_reach_destination/SolutionTest.kt b/src/test/kotlin/g2001_2100/s2045_second_minimum_time_to_reach_destination/SolutionTest.kt
index 9ffca0b5c..3c849c7a0 100644
--- a/src/test/kotlin/g2001_2100/s2045_second_minimum_time_to_reach_destination/SolutionTest.kt
+++ b/src/test/kotlin/g2001_2100/s2045_second_minimum_time_to_reach_destination/SolutionTest.kt
@@ -13,9 +13,9 @@ internal class SolutionTest {
                     5,
                     arrayOf(intArrayOf(1, 2), intArrayOf(1, 3), intArrayOf(1, 4), intArrayOf(3, 4), intArrayOf(4, 5)),
                     3,
-                    5
+                    5,
                 ),
-            equalTo(13)
+            equalTo(13),
         )
     }
 
diff --git a/src/test/kotlin/g2001_2100/s2047_number_of_valid_words_in_a_sentence/SolutionTest.kt b/src/test/kotlin/g2001_2100/s2047_number_of_valid_words_in_a_sentence/SolutionTest.kt
index 54e412264..2ff01cd5f 100644
--- a/src/test/kotlin/g2001_2100/s2047_number_of_valid_words_in_a_sentence/SolutionTest.kt
+++ b/src/test/kotlin/g2001_2100/s2047_number_of_valid_words_in_a_sentence/SolutionTest.kt
@@ -19,7 +19,7 @@ internal class SolutionTest {
     fun countValidWords3() {
         assertThat(
             Solution().countValidWords("alice and  bob are playing stone-game10"),
-            equalTo(5)
+            equalTo(5),
         )
     }
 }
diff --git a/src/test/kotlin/g2001_2100/s2050_parallel_courses_iii/SolutionTest.kt b/src/test/kotlin/g2001_2100/s2050_parallel_courses_iii/SolutionTest.kt
index d4f99506c..3759c0bbb 100644
--- a/src/test/kotlin/g2001_2100/s2050_parallel_courses_iii/SolutionTest.kt
+++ b/src/test/kotlin/g2001_2100/s2050_parallel_courses_iii/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun minimumTime() {
         assertThat(
             Solution().minimumTime(3, arrayOf(intArrayOf(1, 3), intArrayOf(2, 3)), intArrayOf(3, 2, 5)),
-            equalTo(8)
+            equalTo(8),
         )
     }
 
@@ -20,9 +20,9 @@ internal class SolutionTest {
                 .minimumTime(
                     5,
                     arrayOf(intArrayOf(1, 5), intArrayOf(2, 5), intArrayOf(3, 5), intArrayOf(3, 4), intArrayOf(4, 5)),
-                    intArrayOf(1, 2, 3, 4, 5)
+                    intArrayOf(1, 2, 3, 4, 5),
                 ),
-            equalTo(12)
+            equalTo(12),
         )
     }
 }
diff --git a/src/test/kotlin/g2001_2100/s2053_kth_distinct_string_in_an_array/SolutionTest.kt b/src/test/kotlin/g2001_2100/s2053_kth_distinct_string_in_an_array/SolutionTest.kt
index 25fd1483d..054835de4 100644
--- a/src/test/kotlin/g2001_2100/s2053_kth_distinct_string_in_an_array/SolutionTest.kt
+++ b/src/test/kotlin/g2001_2100/s2053_kth_distinct_string_in_an_array/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun kthDistinct() {
         assertThat(
             Solution().kthDistinct(arrayOf("d", "b", "c", "b", "c", "a"), 2),
-            equalTo("a")
+            equalTo("a"),
         )
     }
 
diff --git a/src/test/kotlin/g2001_2100/s2055_plates_between_candles/SolutionTest.kt b/src/test/kotlin/g2001_2100/s2055_plates_between_candles/SolutionTest.kt
index ddba09d69..51b4dfc0e 100644
--- a/src/test/kotlin/g2001_2100/s2055_plates_between_candles/SolutionTest.kt
+++ b/src/test/kotlin/g2001_2100/s2055_plates_between_candles/SolutionTest.kt
@@ -10,19 +10,22 @@ internal class SolutionTest {
         val queries = arrayOf(intArrayOf(2, 5), intArrayOf(5, 9))
         assertThat(
             Solution().platesBetweenCandles("**|**|***|", queries),
-            equalTo(intArrayOf(2, 3))
+            equalTo(intArrayOf(2, 3)),
         )
     }
 
     @Test
     fun platesBetweenCandles2() {
         val queries = arrayOf(
-            intArrayOf(1, 17), intArrayOf(4, 5), intArrayOf(14, 17),
-            intArrayOf(5, 11), intArrayOf(15, 16)
+            intArrayOf(1, 17),
+            intArrayOf(4, 5),
+            intArrayOf(14, 17),
+            intArrayOf(5, 11),
+            intArrayOf(15, 16),
         )
         assertThat(
             Solution().platesBetweenCandles("***|**|*****|**||**|*", queries),
-            equalTo(intArrayOf(9, 0, 0, 0, 0))
+            equalTo(intArrayOf(9, 0, 0, 0, 0)),
         )
     }
 }
diff --git a/src/test/kotlin/g2001_2100/s2056_number_of_valid_move_combinations_on_chessboard/SolutionTest.kt b/src/test/kotlin/g2001_2100/s2056_number_of_valid_move_combinations_on_chessboard/SolutionTest.kt
index ffa1d6c1f..6b3963677 100644
--- a/src/test/kotlin/g2001_2100/s2056_number_of_valid_move_combinations_on_chessboard/SolutionTest.kt
+++ b/src/test/kotlin/g2001_2100/s2056_number_of_valid_move_combinations_on_chessboard/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun countCombinations() {
         assertThat(
             Solution().countCombinations(arrayOf("rook"), arrayOf(intArrayOf(1, 1))),
-            equalTo(15)
+            equalTo(15),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun countCombinations2() {
         assertThat(
             Solution().countCombinations(arrayOf("queen"), arrayOf(intArrayOf(1, 1))),
-            equalTo(22)
+            equalTo(22),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun countCombinations3() {
         assertThat(
             Solution().countCombinations(arrayOf("bishop"), arrayOf(intArrayOf(4, 3))),
-            equalTo(12)
+            equalTo(12),
         )
     }
 }
diff --git a/src/test/kotlin/g2001_2100/s2057_smallest_index_with_equal_value/SolutionTest.kt b/src/test/kotlin/g2001_2100/s2057_smallest_index_with_equal_value/SolutionTest.kt
index 572bf0636..3cd8b3a03 100644
--- a/src/test/kotlin/g2001_2100/s2057_smallest_index_with_equal_value/SolutionTest.kt
+++ b/src/test/kotlin/g2001_2100/s2057_smallest_index_with_equal_value/SolutionTest.kt
@@ -19,7 +19,7 @@ internal class SolutionTest {
     fun smallestEqual3() {
         assertThat(
             Solution().smallestEqual(intArrayOf(1, 2, 3, 4, 5, 6, 7, 8, 9, 0)),
-            equalTo(-1)
+            equalTo(-1),
         )
     }
 }
diff --git a/src/test/kotlin/g2001_2100/s2065_maximum_path_quality_of_a_graph/SolutionTest.kt b/src/test/kotlin/g2001_2100/s2065_maximum_path_quality_of_a_graph/SolutionTest.kt
index 261991f59..63efcb3ca 100644
--- a/src/test/kotlin/g2001_2100/s2065_maximum_path_quality_of_a_graph/SolutionTest.kt
+++ b/src/test/kotlin/g2001_2100/s2065_maximum_path_quality_of_a_graph/SolutionTest.kt
@@ -12,9 +12,9 @@ internal class SolutionTest {
                 .maximalPathQuality(
                     intArrayOf(0, 32, 10, 43),
                     arrayOf(intArrayOf(0, 1, 10), intArrayOf(1, 2, 15), intArrayOf(0, 3, 10)),
-                    49
+                    49,
                 ),
-            equalTo(75)
+            equalTo(75),
         )
     }
 
@@ -25,9 +25,9 @@ internal class SolutionTest {
                 .maximalPathQuality(
                     intArrayOf(1, 2, 3, 4),
                     arrayOf(intArrayOf(0, 1, 10), intArrayOf(1, 2, 11), intArrayOf(2, 3, 12), intArrayOf(1, 3, 13)),
-                    50
+                    50,
                 ),
-            equalTo(7)
+            equalTo(7),
         )
     }
 
@@ -38,9 +38,9 @@ internal class SolutionTest {
                 .maximalPathQuality(
                     intArrayOf(5, 10, 15, 20),
                     arrayOf(intArrayOf(0, 1, 10), intArrayOf(1, 2, 10), intArrayOf(0, 3, 10)),
-                    30
+                    30,
                 ),
-            equalTo(25)
+            equalTo(25),
         )
     }
 }
diff --git a/src/test/kotlin/g2001_2100/s2071_maximum_number_of_tasks_you_can_assign/SolutionTest.kt b/src/test/kotlin/g2001_2100/s2071_maximum_number_of_tasks_you_can_assign/SolutionTest.kt
index ac2dd8373..4298fe72d 100644
--- a/src/test/kotlin/g2001_2100/s2071_maximum_number_of_tasks_you_can_assign/SolutionTest.kt
+++ b/src/test/kotlin/g2001_2100/s2071_maximum_number_of_tasks_you_can_assign/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun maxTaskAssign() {
         assertThat(
             Solution().maxTaskAssign(intArrayOf(3, 2, 1), intArrayOf(0, 3, 3), 1, 1),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun maxTaskAssign2() {
         assertThat(
             Solution().maxTaskAssign(intArrayOf(5, 4), intArrayOf(0, 0, 0), 1, 5),
-            equalTo(1)
+            equalTo(1),
         )
     }
 
@@ -26,7 +26,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .maxTaskAssign(intArrayOf(10, 15, 30), intArrayOf(0, 10, 10, 10, 10), 3, 10),
-            equalTo(2)
+            equalTo(2),
         )
     }
 }
diff --git a/src/test/kotlin/g2001_2100/s2074_reverse_nodes_in_even_length_groups/SolutionTest.kt b/src/test/kotlin/g2001_2100/s2074_reverse_nodes_in_even_length_groups/SolutionTest.kt
index 14ee4dfbd..fd684aa23 100644
--- a/src/test/kotlin/g2001_2100/s2074_reverse_nodes_in_even_length_groups/SolutionTest.kt
+++ b/src/test/kotlin/g2001_2100/s2074_reverse_nodes_in_even_length_groups/SolutionTest.kt
@@ -11,7 +11,7 @@ internal class SolutionTest {
         val head = contructLinkedList(intArrayOf(5, 2, 6, 3, 9, 1, 7, 3, 8, 4))
         assertThat(
             Solution().reverseEvenLengthGroups(head).toString(),
-            equalTo("5, 6, 2, 3, 9, 1, 4, 8, 3, 7")
+            equalTo("5, 6, 2, 3, 9, 1, 4, 8, 3, 7"),
         )
     }
 
@@ -20,7 +20,7 @@ internal class SolutionTest {
         val head = contructLinkedList(intArrayOf(1, 1, 0, 6))
         assertThat(
             Solution().reverseEvenLengthGroups(head).toString(),
-            equalTo("1, 0, 1, 6")
+            equalTo("1, 0, 1, 6"),
         )
     }
 
@@ -28,7 +28,8 @@ internal class SolutionTest {
     fun reverseEvenLengthGroups3() {
         val head = contructLinkedList(intArrayOf(1, 1, 0, 6, 5))
         assertThat(
-            Solution().reverseEvenLengthGroups(head).toString(), equalTo("1, 0, 1, 5, 6")
+            Solution().reverseEvenLengthGroups(head).toString(),
+            equalTo("1, 0, 1, 5, 6"),
         )
     }
 }
diff --git a/src/test/kotlin/g2001_2100/s2075_decode_the_slanted_ciphertext/SolutionTest.kt b/src/test/kotlin/g2001_2100/s2075_decode_the_slanted_ciphertext/SolutionTest.kt
index a149c7c88..7bc99c300 100644
--- a/src/test/kotlin/g2001_2100/s2075_decode_the_slanted_ciphertext/SolutionTest.kt
+++ b/src/test/kotlin/g2001_2100/s2075_decode_the_slanted_ciphertext/SolutionTest.kt
@@ -14,7 +14,7 @@ internal class SolutionTest {
     fun decodeCiphertext2() {
         assertThat(
             Solution().decodeCiphertext("iveo    eed   l te   olc", 4),
-            equalTo("i love leetcode")
+            equalTo("i love leetcode"),
         )
     }
 
diff --git a/src/test/kotlin/g2001_2100/s2076_process_restricted_friend_requests/SolutionTest.kt b/src/test/kotlin/g2001_2100/s2076_process_restricted_friend_requests/SolutionTest.kt
index 2632f520e..1544b0be2 100644
--- a/src/test/kotlin/g2001_2100/s2076_process_restricted_friend_requests/SolutionTest.kt
+++ b/src/test/kotlin/g2001_2100/s2076_process_restricted_friend_requests/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .friendRequests(3, arrayOf(intArrayOf(0, 1)), arrayOf(intArrayOf(0, 2), intArrayOf(2, 1))),
-            equalTo(booleanArrayOf(true, false))
+            equalTo(booleanArrayOf(true, false)),
         )
     }
 
@@ -19,7 +19,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .friendRequests(3, arrayOf(intArrayOf(0, 1)), arrayOf(intArrayOf(1, 2), intArrayOf(0, 2))),
-            equalTo(booleanArrayOf(true, false))
+            equalTo(booleanArrayOf(true, false)),
         )
     }
 
@@ -30,9 +30,9 @@ internal class SolutionTest {
                 .friendRequests(
                     5,
                     arrayOf(intArrayOf(0, 1), intArrayOf(1, 2), intArrayOf(2, 3)),
-                    arrayOf(intArrayOf(0, 4), intArrayOf(1, 2), intArrayOf(3, 1), intArrayOf(3, 4))
+                    arrayOf(intArrayOf(0, 4), intArrayOf(1, 2), intArrayOf(3, 1), intArrayOf(3, 4)),
                 ),
-            equalTo(booleanArrayOf(true, false, true, false))
+            equalTo(booleanArrayOf(true, false, true, false)),
         )
     }
 }
diff --git a/src/test/kotlin/g2001_2100/s2079_watering_plants/SolutionTest.kt b/src/test/kotlin/g2001_2100/s2079_watering_plants/SolutionTest.kt
index b077364d1..5782ebc5c 100644
--- a/src/test/kotlin/g2001_2100/s2079_watering_plants/SolutionTest.kt
+++ b/src/test/kotlin/g2001_2100/s2079_watering_plants/SolutionTest.kt
@@ -19,7 +19,7 @@ internal class SolutionTest {
     fun wateringPlants3() {
         assertThat(
             Solution().wateringPlants(intArrayOf(7, 7, 7, 7, 7, 7, 7), 8),
-            equalTo(49)
+            equalTo(49),
         )
     }
 }
diff --git a/src/test/kotlin/g2001_2100/s2085_count_common_words_with_one_occurrence/SolutionTest.kt b/src/test/kotlin/g2001_2100/s2085_count_common_words_with_one_occurrence/SolutionTest.kt
index e2b35429a..c207c36ff 100644
--- a/src/test/kotlin/g2001_2100/s2085_count_common_words_with_one_occurrence/SolutionTest.kt
+++ b/src/test/kotlin/g2001_2100/s2085_count_common_words_with_one_occurrence/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .countWords(arrayOf("leetcode", "is", "amazing", "as", "is"), arrayOf("amazing", "leetcode", "is")),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -19,7 +19,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .countWords(arrayOf("b", "bb", "bbb"), arrayOf("a", "aa", "aaa")),
-            equalTo(0)
+            equalTo(0),
         )
     }
 
@@ -28,7 +28,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .countWords(arrayOf("a", "ab"), arrayOf("a", "a", "a", "ab")),
-            equalTo(1)
+            equalTo(1),
         )
     }
 }
diff --git a/src/test/kotlin/g2001_2100/s2087_minimum_cost_homecoming_of_a_robot_in_a_grid/SolutionTest.kt b/src/test/kotlin/g2001_2100/s2087_minimum_cost_homecoming_of_a_robot_in_a_grid/SolutionTest.kt
index e9243273f..ff9077429 100644
--- a/src/test/kotlin/g2001_2100/s2087_minimum_cost_homecoming_of_a_robot_in_a_grid/SolutionTest.kt
+++ b/src/test/kotlin/g2001_2100/s2087_minimum_cost_homecoming_of_a_robot_in_a_grid/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .minCost(intArrayOf(1, 0), intArrayOf(2, 3), intArrayOf(5, 4, 3), intArrayOf(8, 2, 6, 7)),
-            equalTo(18)
+            equalTo(18),
         )
     }
 
@@ -19,7 +19,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .minCost(intArrayOf(0, 0), intArrayOf(0, 0), intArrayOf(5), intArrayOf(26)),
-            equalTo(0)
+            equalTo(0),
         )
     }
 }
diff --git a/src/test/kotlin/g2001_2100/s2088_count_fertile_pyramids_in_a_land/SolutionTest.kt b/src/test/kotlin/g2001_2100/s2088_count_fertile_pyramids_in_a_land/SolutionTest.kt
index f3e402599..4b24d4c8c 100644
--- a/src/test/kotlin/g2001_2100/s2088_count_fertile_pyramids_in_a_land/SolutionTest.kt
+++ b/src/test/kotlin/g2001_2100/s2088_count_fertile_pyramids_in_a_land/SolutionTest.kt
@@ -8,7 +8,8 @@ internal class SolutionTest {
     @Test
     fun countPyramids() {
         assertThat(
-            Solution().countPyramids(arrayOf(intArrayOf(0, 1, 1, 0), intArrayOf(1, 1, 1, 1))), equalTo(2)
+            Solution().countPyramids(arrayOf(intArrayOf(0, 1, 1, 0), intArrayOf(1, 1, 1, 1))),
+            equalTo(2),
         )
     }
 
@@ -16,7 +17,7 @@ internal class SolutionTest {
     fun countPyramids2() {
         assertThat(
             Solution().countPyramids(arrayOf(intArrayOf(1, 1, 1), intArrayOf(1, 1, 1))),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -29,10 +30,10 @@ internal class SolutionTest {
                         intArrayOf(1, 1, 1, 1, 0),
                         intArrayOf(1, 1, 1, 1, 1),
                         intArrayOf(1, 1, 1, 1, 1),
-                        intArrayOf(0, 1, 0, 0, 1)
-                    )
+                        intArrayOf(0, 1, 0, 0, 1),
+                    ),
                 ),
-            equalTo(13)
+            equalTo(13),
         )
     }
 }
diff --git a/src/test/kotlin/g2001_2100/s2089_find_target_indices_after_sorting_array/SolutionTest.kt b/src/test/kotlin/g2001_2100/s2089_find_target_indices_after_sorting_array/SolutionTest.kt
index 32bfb6221..3b6f8d925 100644
--- a/src/test/kotlin/g2001_2100/s2089_find_target_indices_after_sorting_array/SolutionTest.kt
+++ b/src/test/kotlin/g2001_2100/s2089_find_target_indices_after_sorting_array/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun targetIndices() {
         assertThat(
             Solution().targetIndices(intArrayOf(1, 2, 5, 2, 3), 2),
-            equalTo(listOf(1, 2))
+            equalTo(listOf(1, 2)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun targetIndices2() {
         assertThat(
             Solution().targetIndices(intArrayOf(1, 2, 5, 2, 3), 3),
-            equalTo(listOf(3))
+            equalTo(listOf(3)),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun targetIndices3() {
         assertThat(
             Solution().targetIndices(intArrayOf(1, 2, 5, 2, 3), 5),
-            equalTo(listOf(4))
+            equalTo(listOf(4)),
         )
     }
 }
diff --git a/src/test/kotlin/g2001_2100/s2090_k_radius_subarray_averages/SolutionTest.kt b/src/test/kotlin/g2001_2100/s2090_k_radius_subarray_averages/SolutionTest.kt
index 29801849a..0bb502eed 100644
--- a/src/test/kotlin/g2001_2100/s2090_k_radius_subarray_averages/SolutionTest.kt
+++ b/src/test/kotlin/g2001_2100/s2090_k_radius_subarray_averages/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun averages() {
         assertThat(
             Solution().getAverages(intArrayOf(7, 4, 3, 9, 1, 8, 5, 2, 6), 3),
-            equalTo(intArrayOf(-1, -1, -1, 5, 4, 4, -1, -1, -1))
+            equalTo(intArrayOf(-1, -1, -1, 5, 4, 4, -1, -1, -1)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun averages2() {
         assertThat(
             Solution().getAverages(intArrayOf(100000), 0),
-            equalTo(intArrayOf(100000))
+            equalTo(intArrayOf(100000)),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun averages3() {
         assertThat(
             Solution().getAverages(intArrayOf(8), 100000),
-            equalTo(intArrayOf(-1))
+            equalTo(intArrayOf(-1)),
         )
     }
 }
diff --git a/src/test/kotlin/g2001_2100/s2091_removing_minimum_and_maximum_from_array/SolutionTest.kt b/src/test/kotlin/g2001_2100/s2091_removing_minimum_and_maximum_from_array/SolutionTest.kt
index 66ffa27a2..1f9a1471f 100644
--- a/src/test/kotlin/g2001_2100/s2091_removing_minimum_and_maximum_from_array/SolutionTest.kt
+++ b/src/test/kotlin/g2001_2100/s2091_removing_minimum_and_maximum_from_array/SolutionTest.kt
@@ -8,7 +8,8 @@ internal class SolutionTest {
     @Test
     fun minimumDeletions() {
         assertThat(
-            Solution().minimumDeletions(intArrayOf(2, 10, 7, 5, 4, 1, 8, 6)), equalTo(5)
+            Solution().minimumDeletions(intArrayOf(2, 10, 7, 5, 4, 1, 8, 6)),
+            equalTo(5),
         )
     }
 
@@ -16,7 +17,7 @@ internal class SolutionTest {
     fun minimumDeletions2() {
         assertThat(
             Solution().minimumDeletions(intArrayOf(0, -4, 19, 1, 8, -2, -3, 5)),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
diff --git a/src/test/kotlin/g2001_2100/s2092_find_all_people_with_secret/SolutionTest.kt b/src/test/kotlin/g2001_2100/s2092_find_all_people_with_secret/SolutionTest.kt
index e27137a7c..b51a120bd 100644
--- a/src/test/kotlin/g2001_2100/s2092_find_all_people_with_secret/SolutionTest.kt
+++ b/src/test/kotlin/g2001_2100/s2092_find_all_people_with_secret/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun findAllPeople() {
         assertThat(
             Solution().findAllPeople(6, arrayOf(intArrayOf(1, 2, 5), intArrayOf(2, 3, 8), intArrayOf(1, 5, 10)), 1),
-            equalTo(listOf(0, 1, 2, 3, 5))
+            equalTo(listOf(0, 1, 2, 3, 5)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun findAllPeople2() {
         assertThat(
             Solution().findAllPeople(4, arrayOf(intArrayOf(3, 1, 3), intArrayOf(1, 2, 2), intArrayOf(0, 3, 3)), 3),
-            equalTo(listOf(0, 1, 3))
+            equalTo(listOf(0, 1, 3)),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun findAllPeople3() {
         assertThat(
             Solution().findAllPeople(5, arrayOf(intArrayOf(3, 4, 2), intArrayOf(1, 2, 1), intArrayOf(2, 3, 1)), 1),
-            equalTo(listOf(0, 1, 2, 3, 4))
+            equalTo(listOf(0, 1, 2, 3, 4)),
         )
     }
 }
diff --git a/src/test/kotlin/g2001_2100/s2094_finding_3_digit_even_numbers/SolutionTest.kt b/src/test/kotlin/g2001_2100/s2094_finding_3_digit_even_numbers/SolutionTest.kt
index 193476c5f..9de668cfd 100644
--- a/src/test/kotlin/g2001_2100/s2094_finding_3_digit_even_numbers/SolutionTest.kt
+++ b/src/test/kotlin/g2001_2100/s2094_finding_3_digit_even_numbers/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun findEvenNumbers() {
         assertThat(
             Solution().findEvenNumbers(intArrayOf(2, 1, 3, 0)),
-            equalTo(intArrayOf(102, 120, 130, 132, 210, 230, 302, 310, 312, 320))
+            equalTo(intArrayOf(102, 120, 130, 132, 210, 230, 302, 310, 312, 320)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun findEvenNumbers2() {
         assertThat(
             Solution().findEvenNumbers(intArrayOf(2, 2, 8, 8, 2)),
-            equalTo(intArrayOf(222, 228, 282, 288, 822, 828, 882))
+            equalTo(intArrayOf(222, 228, 282, 288, 822, 828, 882)),
         )
     }
 
diff --git a/src/test/kotlin/g2001_2100/s2096_step_by_step_directions_from_a_binary_tree_node_to_another/SolutionTest.kt b/src/test/kotlin/g2001_2100/s2096_step_by_step_directions_from_a_binary_tree_node_to_another/SolutionTest.kt
index d0945966f..5fd715ffd 100644
--- a/src/test/kotlin/g2001_2100/s2096_step_by_step_directions_from_a_binary_tree_node_to_another/SolutionTest.kt
+++ b/src/test/kotlin/g2001_2100/s2096_step_by_step_directions_from_a_binary_tree_node_to_another/SolutionTest.kt
@@ -11,9 +11,11 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .getDirections(
-                    TreeNode.create(listOf(5, 1, 2, 3, null, 6, 4)), 3, 6
+                    TreeNode.create(listOf(5, 1, 2, 3, null, 6, 4)),
+                    3,
+                    6,
                 ),
-            equalTo("UURL")
+            equalTo("UURL"),
         )
     }
 
@@ -21,7 +23,7 @@ internal class SolutionTest {
     fun directions2() {
         assertThat(
             Solution().getDirections(TreeNode.create(listOf(2, 1)), 2, 1),
-            equalTo("L")
+            equalTo("L"),
         )
     }
 }
diff --git a/src/test/kotlin/g2001_2100/s2097_valid_arrangement_of_pairs/SolutionTest.kt b/src/test/kotlin/g2001_2100/s2097_valid_arrangement_of_pairs/SolutionTest.kt
index 045c5f239..a2ba73ab1 100644
--- a/src/test/kotlin/g2001_2100/s2097_valid_arrangement_of_pairs/SolutionTest.kt
+++ b/src/test/kotlin/g2001_2100/s2097_valid_arrangement_of_pairs/SolutionTest.kt
@@ -13,10 +13,10 @@ internal class SolutionTest {
                     intArrayOf(5, 1),
                     intArrayOf(4, 5),
                     intArrayOf(11, 9),
-                    intArrayOf(9, 4)
-                )
+                    intArrayOf(9, 4),
+                ),
             ),
-            equalTo(arrayOf(intArrayOf(11, 9), intArrayOf(9, 4), intArrayOf(4, 5), intArrayOf(5, 1)))
+            equalTo(arrayOf(intArrayOf(11, 9), intArrayOf(9, 4), intArrayOf(4, 5), intArrayOf(5, 1))),
         )
     }
 
@@ -24,7 +24,7 @@ internal class SolutionTest {
     fun validArrangement2() {
         assertThat(
             Solution().validArrangement(arrayOf(intArrayOf(1, 3), intArrayOf(3, 2), intArrayOf(2, 1))),
-            equalTo(arrayOf(intArrayOf(3, 2), intArrayOf(2, 1), intArrayOf(1, 3)))
+            equalTo(arrayOf(intArrayOf(3, 2), intArrayOf(2, 1), intArrayOf(1, 3))),
         )
     }
 
@@ -32,7 +32,7 @@ internal class SolutionTest {
     fun validArrangement3() {
         assertThat(
             Solution().validArrangement(arrayOf(intArrayOf(1, 2), intArrayOf(1, 3), intArrayOf(2, 1))),
-            equalTo(arrayOf(intArrayOf(1, 2), intArrayOf(2, 1), intArrayOf(1, 3)))
+            equalTo(arrayOf(intArrayOf(1, 2), intArrayOf(2, 1), intArrayOf(1, 3))),
         )
     }
 }
diff --git a/src/test/kotlin/g2001_2100/s2099_find_subsequence_of_length_k_with_the_largest_sum/SolutionTest.kt b/src/test/kotlin/g2001_2100/s2099_find_subsequence_of_length_k_with_the_largest_sum/SolutionTest.kt
index f2ce1d4c8..b26a7830c 100644
--- a/src/test/kotlin/g2001_2100/s2099_find_subsequence_of_length_k_with_the_largest_sum/SolutionTest.kt
+++ b/src/test/kotlin/g2001_2100/s2099_find_subsequence_of_length_k_with_the_largest_sum/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun maxSubsequence() {
         assertThat(
             Solution().maxSubsequence(intArrayOf(2, 1, 3, 3), 2),
-            equalTo(intArrayOf(3, 3))
+            equalTo(intArrayOf(3, 3)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun maxSubsequence2() {
         assertThat(
             Solution().maxSubsequence(intArrayOf(-1, -2, 3, 4), 3),
-            equalTo(intArrayOf(-1, 3, 4))
+            equalTo(intArrayOf(-1, 3, 4)),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun maxSubsequence3() {
         assertThat(
             Solution().maxSubsequence(intArrayOf(3, 4, 3, 3), 2),
-            equalTo(intArrayOf(4, 3))
+            equalTo(intArrayOf(4, 3)),
         )
     }
 }
diff --git a/src/test/kotlin/g2001_2100/s2100_find_good_days_to_rob_the_bank/SolutionTest.kt b/src/test/kotlin/g2001_2100/s2100_find_good_days_to_rob_the_bank/SolutionTest.kt
index d30bd6660..9350df8e2 100644
--- a/src/test/kotlin/g2001_2100/s2100_find_good_days_to_rob_the_bank/SolutionTest.kt
+++ b/src/test/kotlin/g2001_2100/s2100_find_good_days_to_rob_the_bank/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun goodDaysToRobBank() {
         assertThat(
             Solution().goodDaysToRobBank(intArrayOf(5, 3, 3, 3, 5, 6, 2), 2),
-            equalTo(listOf(2, 3))
+            equalTo(listOf(2, 3)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun goodDaysToRobBank2() {
         assertThat(
             Solution().goodDaysToRobBank(intArrayOf(1, 1, 1, 1, 1), 0),
-            equalTo(listOf(0, 1, 2, 3, 4))
+            equalTo(listOf(0, 1, 2, 3, 4)),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun goodDaysToRobBank3() {
         assertThat(
             Solution().goodDaysToRobBank(intArrayOf(1, 2, 3, 4, 5, 6), 2),
-            equalTo(emptyList<Any>())
+            equalTo(emptyList<Any>()),
         )
     }
 }
diff --git a/src/test/kotlin/g2101_2200/s2101_detonate_the_maximum_bombs/SolutionTest.kt b/src/test/kotlin/g2101_2200/s2101_detonate_the_maximum_bombs/SolutionTest.kt
index 1ea6c68a9..333962069 100644
--- a/src/test/kotlin/g2101_2200/s2101_detonate_the_maximum_bombs/SolutionTest.kt
+++ b/src/test/kotlin/g2101_2200/s2101_detonate_the_maximum_bombs/SolutionTest.kt
@@ -8,14 +8,16 @@ internal class SolutionTest {
     @Test
     fun maximumDetonation() {
         assertThat(
-            Solution().maximumDetonation(arrayOf(intArrayOf(2, 1, 3), intArrayOf(6, 1, 4))), equalTo(2)
+            Solution().maximumDetonation(arrayOf(intArrayOf(2, 1, 3), intArrayOf(6, 1, 4))),
+            equalTo(2),
         )
     }
 
     @Test
     fun maximumDetonation2() {
         assertThat(
-            Solution().maximumDetonation(arrayOf(intArrayOf(1, 1, 5), intArrayOf(10, 10, 5))), equalTo(1)
+            Solution().maximumDetonation(arrayOf(intArrayOf(1, 1, 5), intArrayOf(10, 10, 5))),
+            equalTo(1),
         )
     }
 
@@ -29,10 +31,10 @@ internal class SolutionTest {
                         intArrayOf(2, 3, 1),
                         intArrayOf(3, 4, 2),
                         intArrayOf(4, 5, 3),
-                        intArrayOf(5, 6, 4)
-                    )
+                        intArrayOf(5, 6, 4),
+                    ),
                 ),
-            equalTo(5)
+            equalTo(5),
         )
     }
 }
diff --git a/src/test/kotlin/g2101_2200/s2106_maximum_fruits_harvested_after_at_most_k_steps/SolutionTest.kt b/src/test/kotlin/g2101_2200/s2106_maximum_fruits_harvested_after_at_most_k_steps/SolutionTest.kt
index 6733e6f5a..215ba5bec 100644
--- a/src/test/kotlin/g2101_2200/s2106_maximum_fruits_harvested_after_at_most_k_steps/SolutionTest.kt
+++ b/src/test/kotlin/g2101_2200/s2106_maximum_fruits_harvested_after_at_most_k_steps/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun maxTotalFruits() {
         assertThat(
             Solution().maxTotalFruits(arrayOf(intArrayOf(2, 8), intArrayOf(6, 3), intArrayOf(8, 6)), 5, 4),
-            equalTo(9)
+            equalTo(9),
         )
     }
 
@@ -24,12 +24,12 @@ internal class SolutionTest {
                         intArrayOf(5, 7),
                         intArrayOf(6, 2),
                         intArrayOf(7, 4),
-                        intArrayOf(10, 9)
+                        intArrayOf(10, 9),
                     ),
                     5,
-                    4
+                    4,
                 ),
-            equalTo(14)
+            equalTo(14),
         )
     }
 
@@ -37,7 +37,7 @@ internal class SolutionTest {
     fun maxTotalFruits3() {
         assertThat(
             Solution().maxTotalFruits(arrayOf(intArrayOf(0, 3), intArrayOf(6, 4), intArrayOf(8, 5)), 3, 2),
-            equalTo(0)
+            equalTo(0),
         )
     }
 }
diff --git a/src/test/kotlin/g2101_2200/s2108_find_first_palindromic_string_in_the_array/SolutionTest.kt b/src/test/kotlin/g2101_2200/s2108_find_first_palindromic_string_in_the_array/SolutionTest.kt
index c43f14590..99851884a 100644
--- a/src/test/kotlin/g2101_2200/s2108_find_first_palindromic_string_in_the_array/SolutionTest.kt
+++ b/src/test/kotlin/g2101_2200/s2108_find_first_palindromic_string_in_the_array/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .firstPalindrome(arrayOf("abc", "car", "ada", "racecar", "cool")),
-            equalTo("ada")
+            equalTo("ada"),
         )
     }
 
@@ -18,7 +18,7 @@ internal class SolutionTest {
     fun firstPalindrome2() {
         assertThat(
             Solution().firstPalindrome(arrayOf("notapalindrome", "racecar")),
-            equalTo("racecar")
+            equalTo("racecar"),
         )
     }
 
diff --git a/src/test/kotlin/g2101_2200/s2109_adding_spaces_to_a_string/SolutionTest.kt b/src/test/kotlin/g2101_2200/s2109_adding_spaces_to_a_string/SolutionTest.kt
index 744f4f7a6..55c7bfd02 100644
--- a/src/test/kotlin/g2101_2200/s2109_adding_spaces_to_a_string/SolutionTest.kt
+++ b/src/test/kotlin/g2101_2200/s2109_adding_spaces_to_a_string/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun addSpaces() {
         assertThat(
             Solution().addSpaces("LeetcodeHelpsMeLearn", intArrayOf(8, 13, 15)),
-            equalTo("Leetcode Helps Me Learn")
+            equalTo("Leetcode Helps Me Learn"),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun addSpaces2() {
         assertThat(
             Solution().addSpaces("icodeinpython", intArrayOf(1, 5, 7, 9)),
-            equalTo("i code in py thon")
+            equalTo("i code in py thon"),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun addSpaces3() {
         assertThat(
             Solution().addSpaces("spacing", intArrayOf(0, 1, 2, 3, 4, 5, 6)),
-            equalTo(" s p a c i n g")
+            equalTo(" s p a c i n g"),
         )
     }
 }
diff --git a/src/test/kotlin/g2101_2200/s2114_maximum_number_of_words_found_in_sentences/SolutionTest.kt b/src/test/kotlin/g2101_2200/s2114_maximum_number_of_words_found_in_sentences/SolutionTest.kt
index c29e8762b..c15a4a477 100644
--- a/src/test/kotlin/g2101_2200/s2114_maximum_number_of_words_found_in_sentences/SolutionTest.kt
+++ b/src/test/kotlin/g2101_2200/s2114_maximum_number_of_words_found_in_sentences/SolutionTest.kt
@@ -13,10 +13,10 @@ internal class SolutionTest {
                     arrayOf(
                         "alice and bob love leetcode",
                         "i think so too",
-                        "this is great thanks very much"
-                    )
+                        "this is great thanks very much",
+                    ),
                 ),
-            equalTo(6)
+            equalTo(6),
         )
     }
 
@@ -26,10 +26,12 @@ internal class SolutionTest {
             Solution()
                 .mostWordsFound(
                     arrayOf(
-                        "please wait", "continue to fight", "continue to win"
-                    )
+                        "please wait",
+                        "continue to fight",
+                        "continue to win",
+                    ),
                 ),
-            equalTo(3)
+            equalTo(3),
         )
     }
 }
diff --git a/src/test/kotlin/g2101_2200/s2115_find_all_possible_recipes_from_given_supplies/SolutionTest.kt b/src/test/kotlin/g2101_2200/s2115_find_all_possible_recipes_from_given_supplies/SolutionTest.kt
index 79d191920..05ef9bd68 100644
--- a/src/test/kotlin/g2101_2200/s2115_find_all_possible_recipes_from_given_supplies/SolutionTest.kt
+++ b/src/test/kotlin/g2101_2200/s2115_find_all_possible_recipes_from_given_supplies/SolutionTest.kt
@@ -12,9 +12,9 @@ internal class SolutionTest {
                 .findAllRecipes(
                     arrayOf("bread"),
                     listOf<List<String>>(mutableListOf("yeast", "flour")),
-                    arrayOf("yeast", "flour", "corn")
+                    arrayOf("yeast", "flour", "corn"),
                 ),
-            equalTo(listOf("bread"))
+            equalTo(listOf("bread")),
         )
     }
 
@@ -25,9 +25,9 @@ internal class SolutionTest {
                 .findAllRecipes(
                     arrayOf("bread", "sandwich"),
                     listOf(mutableListOf("yeast", "flour"), mutableListOf("bread", "meat")),
-                    arrayOf("yeast", "flour", "meat")
+                    arrayOf("yeast", "flour", "meat"),
                 ),
-            equalTo(mutableListOf("bread", "sandwich"))
+            equalTo(mutableListOf("bread", "sandwich")),
         )
     }
 
@@ -40,11 +40,11 @@ internal class SolutionTest {
                     listOf(
                         mutableListOf("yeast", "flour"),
                         mutableListOf("bread", "meat"),
-                        mutableListOf("sandwich", "meat", "bread")
+                        mutableListOf("sandwich", "meat", "bread"),
                     ),
-                    arrayOf("yeast", "flour", "meat")
+                    arrayOf("yeast", "flour", "meat"),
                 ),
-            equalTo(mutableListOf("bread", "sandwich", "burger"))
+            equalTo(mutableListOf("bread", "sandwich", "burger")),
         )
     }
 }
diff --git a/src/test/kotlin/g2101_2200/s2116_check_if_a_parentheses_string_can_be_valid/SolutionTest.kt b/src/test/kotlin/g2101_2200/s2116_check_if_a_parentheses_string_can_be_valid/SolutionTest.kt
index 4b34272b2..c7d2e3ef3 100644
--- a/src/test/kotlin/g2101_2200/s2116_check_if_a_parentheses_string_can_be_valid/SolutionTest.kt
+++ b/src/test/kotlin/g2101_2200/s2116_check_if_a_parentheses_string_can_be_valid/SolutionTest.kt
@@ -36,9 +36,9 @@ internal class SolutionTest {
             Solution()
                 .canBeValid(
                     "))))(())((()))))((()((((((())())((()))((((())()()))(()",
-                    "101100101111110000000101000101001010110001110000000101"
+                    "101100101111110000000101000101001010110001110000000101",
                 ),
-            equalTo(false)
+            equalTo(false),
         )
     }
 
@@ -48,9 +48,9 @@ internal class SolutionTest {
             Solution()
                 .canBeValid(
                     "())(()(()(())()())(())((())(()())((())))))(((((((())(()))))(",
-                    "100011110110011011010111100111011101111110000101001101001111"
+                    "100011110110011011010111100111011101111110000101001101001111",
                 ),
-            equalTo(false)
+            equalTo(false),
         )
     }
 }
diff --git a/src/test/kotlin/g2101_2200/s2117_abbreviating_the_product_of_a_range/SolutionTest.kt b/src/test/kotlin/g2101_2200/s2117_abbreviating_the_product_of_a_range/SolutionTest.kt
index fc7e675ae..1535e370d 100644
--- a/src/test/kotlin/g2101_2200/s2117_abbreviating_the_product_of_a_range/SolutionTest.kt
+++ b/src/test/kotlin/g2101_2200/s2117_abbreviating_the_product_of_a_range/SolutionTest.kt
@@ -24,7 +24,7 @@ internal class SolutionTest {
     fun abbreviateProduct4() {
         assertThat(
             Solution().abbreviateProduct(10000, 100005),
-            equalTo("99240...51744e22505")
+            equalTo("99240...51744e22505"),
         )
     }
 }
diff --git a/src/test/kotlin/g2101_2200/s2120_execution_of_all_suffix_instructions_staying_in_a_grid/SolutionTest.kt b/src/test/kotlin/g2101_2200/s2120_execution_of_all_suffix_instructions_staying_in_a_grid/SolutionTest.kt
index 934e94d12..20b537ee2 100644
--- a/src/test/kotlin/g2101_2200/s2120_execution_of_all_suffix_instructions_staying_in_a_grid/SolutionTest.kt
+++ b/src/test/kotlin/g2101_2200/s2120_execution_of_all_suffix_instructions_staying_in_a_grid/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun executeInstructions() {
         assertThat(
             Solution().executeInstructions(3, intArrayOf(0, 1), "RRDDLU"),
-            equalTo(intArrayOf(1, 5, 4, 3, 1, 0))
+            equalTo(intArrayOf(1, 5, 4, 3, 1, 0)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun executeInstructions2() {
         assertThat(
             Solution().executeInstructions(2, intArrayOf(1, 1), "LURD"),
-            equalTo(intArrayOf(4, 1, 0, 0))
+            equalTo(intArrayOf(4, 1, 0, 0)),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun executeInstructions3() {
         assertThat(
             Solution().executeInstructions(1, intArrayOf(0, 0), "LRUD"),
-            equalTo(intArrayOf(0, 0, 0, 0))
+            equalTo(intArrayOf(0, 0, 0, 0)),
         )
     }
 }
diff --git a/src/test/kotlin/g2101_2200/s2121_intervals_between_identical_elements/SolutionTest.kt b/src/test/kotlin/g2101_2200/s2121_intervals_between_identical_elements/SolutionTest.kt
index 2d4a79a57..3970bb62b 100644
--- a/src/test/kotlin/g2101_2200/s2121_intervals_between_identical_elements/SolutionTest.kt
+++ b/src/test/kotlin/g2101_2200/s2121_intervals_between_identical_elements/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun distances() {
         assertThat(
             Solution().getDistances(intArrayOf(2, 1, 3, 1, 2, 3, 3)),
-            equalTo(longArrayOf(4, 2, 7, 2, 4, 4, 5))
+            equalTo(longArrayOf(4, 2, 7, 2, 4, 4, 5)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun distances2() {
         assertThat(
             Solution().getDistances(intArrayOf(10, 5, 10, 10)),
-            equalTo(longArrayOf(5, 0, 3, 4))
+            equalTo(longArrayOf(5, 0, 3, 4)),
         )
     }
 }
diff --git a/src/test/kotlin/g2101_2200/s2122_recover_the_original_array/SolutionTest.kt b/src/test/kotlin/g2101_2200/s2122_recover_the_original_array/SolutionTest.kt
index ac8cb1c35..4084c25c3 100644
--- a/src/test/kotlin/g2101_2200/s2122_recover_the_original_array/SolutionTest.kt
+++ b/src/test/kotlin/g2101_2200/s2122_recover_the_original_array/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun recoverArray() {
         assertThat(
             Solution().recoverArray(intArrayOf(2, 10, 6, 4, 8, 12)),
-            equalTo(intArrayOf(3, 7, 11))
+            equalTo(intArrayOf(3, 7, 11)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun recoverArray2() {
         assertThat(
             Solution().recoverArray(intArrayOf(1, 1, 3, 3)),
-            equalTo(intArrayOf(2, 2))
+            equalTo(intArrayOf(2, 2)),
         )
     }
 
@@ -30,7 +30,7 @@ internal class SolutionTest {
     fun recoverArray4() {
         assertThat(
             Solution().recoverArray(intArrayOf(1, 50, 99, 101, 150, 199)),
-            equalTo(intArrayOf(51, 100, 149))
+            equalTo(intArrayOf(51, 100, 149)),
         )
     }
 }
diff --git a/src/test/kotlin/g2101_2200/s2125_number_of_laser_beams_in_a_bank/SolutionTest.kt b/src/test/kotlin/g2101_2200/s2125_number_of_laser_beams_in_a_bank/SolutionTest.kt
index 31fd5eb61..a93b91474 100644
--- a/src/test/kotlin/g2101_2200/s2125_number_of_laser_beams_in_a_bank/SolutionTest.kt
+++ b/src/test/kotlin/g2101_2200/s2125_number_of_laser_beams_in_a_bank/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun numberOfBeams() {
         assertThat(
             Solution().numberOfBeams(arrayOf("011001", "000000", "010100", "001000")),
-            equalTo(8)
+            equalTo(8),
         )
     }
 
diff --git a/src/test/kotlin/g2101_2200/s2126_destroying_asteroids/SolutionTest.kt b/src/test/kotlin/g2101_2200/s2126_destroying_asteroids/SolutionTest.kt
index 0264b5767..080e36519 100644
--- a/src/test/kotlin/g2101_2200/s2126_destroying_asteroids/SolutionTest.kt
+++ b/src/test/kotlin/g2101_2200/s2126_destroying_asteroids/SolutionTest.kt
@@ -8,7 +8,8 @@ internal class SolutionTest {
     @Test
     fun asteroidsDestroyed() {
         assertThat(
-            Solution().asteroidsDestroyed(10, intArrayOf(3, 9, 19, 5, 21)), equalTo(true)
+            Solution().asteroidsDestroyed(10, intArrayOf(3, 9, 19, 5, 21)),
+            equalTo(true),
         )
     }
 
diff --git a/src/test/kotlin/g2101_2200/s2129_capitalize_the_title/SolutionTest.kt b/src/test/kotlin/g2101_2200/s2129_capitalize_the_title/SolutionTest.kt
index 0f40aa92e..94b7e1f72 100644
--- a/src/test/kotlin/g2101_2200/s2129_capitalize_the_title/SolutionTest.kt
+++ b/src/test/kotlin/g2101_2200/s2129_capitalize_the_title/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun capitalizeTitle() {
         assertThat(
             Solution().capitalizeTitle("capiTalIze tHe titLe"),
-            equalTo("Capitalize The Title")
+            equalTo("Capitalize The Title"),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun capitalizeTitle2() {
         assertThat(
             Solution().capitalizeTitle("First leTTeR of EACH Word"),
-            equalTo("First Letter of Each Word")
+            equalTo("First Letter of Each Word"),
         )
     }
 
diff --git a/src/test/kotlin/g2101_2200/s2130_maximum_twin_sum_of_a_linked_list/SolutionTest.kt b/src/test/kotlin/g2101_2200/s2130_maximum_twin_sum_of_a_linked_list/SolutionTest.kt
index 7db04f83a..64df1e1b7 100644
--- a/src/test/kotlin/g2101_2200/s2130_maximum_twin_sum_of_a_linked_list/SolutionTest.kt
+++ b/src/test/kotlin/g2101_2200/s2130_maximum_twin_sum_of_a_linked_list/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
     fun pairSum() {
         assertThat(
             Solution().pairSum(contructLinkedList(intArrayOf(5, 4, 2, 1))),
-            equalTo(6)
+            equalTo(6),
         )
     }
 
@@ -18,7 +18,7 @@ internal class SolutionTest {
     fun pairSum2() {
         assertThat(
             Solution().pairSum(contructLinkedList(intArrayOf(4, 2, 2, 3))),
-            equalTo(7)
+            equalTo(7),
         )
     }
 
@@ -26,7 +26,7 @@ internal class SolutionTest {
     fun pairSum3() {
         assertThat(
             Solution().pairSum(contructLinkedList(intArrayOf(1, 100000))),
-            equalTo(100001)
+            equalTo(100001),
         )
     }
 }
diff --git a/src/test/kotlin/g2101_2200/s2131_longest_palindrome_by_concatenating_two_letter_words/SolutionTest.kt b/src/test/kotlin/g2101_2200/s2131_longest_palindrome_by_concatenating_two_letter_words/SolutionTest.kt
index 41f86e4b2..3fcb419de 100644
--- a/src/test/kotlin/g2101_2200/s2131_longest_palindrome_by_concatenating_two_letter_words/SolutionTest.kt
+++ b/src/test/kotlin/g2101_2200/s2131_longest_palindrome_by_concatenating_two_letter_words/SolutionTest.kt
@@ -14,7 +14,7 @@ internal class SolutionTest {
     fun longestPalindrome2() {
         assertThat(
             Solution().longestPalindrome(arrayOf("ab", "ty", "yt", "lc", "cl", "ab")),
-            equalTo(8)
+            equalTo(8),
         )
     }
 
diff --git a/src/test/kotlin/g2101_2200/s2132_stamping_the_grid/SolutionTest.kt b/src/test/kotlin/g2101_2200/s2132_stamping_the_grid/SolutionTest.kt
index a188c3d3b..ae89ae526 100644
--- a/src/test/kotlin/g2101_2200/s2132_stamping_the_grid/SolutionTest.kt
+++ b/src/test/kotlin/g2101_2200/s2132_stamping_the_grid/SolutionTest.kt
@@ -15,12 +15,12 @@ internal class SolutionTest {
                         intArrayOf(1, 0, 0, 0),
                         intArrayOf(1, 0, 0, 0),
                         intArrayOf(1, 0, 0, 0),
-                        intArrayOf(1, 0, 0, 0)
+                        intArrayOf(1, 0, 0, 0),
                     ),
                     4,
-                    3
+                    3,
                 ),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
@@ -33,12 +33,12 @@ internal class SolutionTest {
                         intArrayOf(1, 0, 0, 0),
                         intArrayOf(0, 1, 0, 0),
                         intArrayOf(0, 0, 1, 0),
-                        intArrayOf(0, 0, 0, 1)
+                        intArrayOf(0, 0, 0, 1),
                     ),
                     2,
-                    2
+                    2,
                 ),
-            equalTo(false)
+            equalTo(false),
         )
     }
 
@@ -52,12 +52,12 @@ internal class SolutionTest {
                         intArrayOf(0, 0, 0, 0, 0),
                         intArrayOf(0, 0, 1, 0, 0),
                         intArrayOf(0, 0, 0, 0, 1),
-                        intArrayOf(0, 0, 0, 1, 1)
+                        intArrayOf(0, 0, 0, 1, 1),
                     ),
                     2,
-                    2
+                    2,
                 ),
-            equalTo(false)
+            equalTo(false),
         )
     }
 
@@ -75,11 +75,12 @@ internal class SolutionTest {
                         intArrayOf(1),
                         intArrayOf(0),
                         intArrayOf(0),
-                        intArrayOf(1)
+                        intArrayOf(1),
                     ),
-                    9, 1
+                    9,
+                    1,
                 ),
-            equalTo(false)
+            equalTo(false),
         )
     }
 
@@ -87,21 +88,23 @@ internal class SolutionTest {
     fun possibleToStamp5() {
         assertThat(
             Solution().possibleToStamp(arrayOf(intArrayOf(1), intArrayOf(1), intArrayOf(0), intArrayOf(0)), 3, 1),
-            equalTo(false)
+            equalTo(false),
         )
     }
 
     @Test
     fun possibleToStamp6() {
         assertThat(
-            Solution().possibleToStamp(arrayOf(intArrayOf(0, 1), intArrayOf(0, 0)), 2, 2), equalTo(false)
+            Solution().possibleToStamp(arrayOf(intArrayOf(0, 1), intArrayOf(0, 0)), 2, 2),
+            equalTo(false),
         )
     }
 
     @Test
     fun possibleToStamp7() {
         assertThat(
-            Solution().possibleToStamp(arrayOf(intArrayOf(1, 1, 0, 0)), 1, 3), equalTo(false)
+            Solution().possibleToStamp(arrayOf(intArrayOf(1, 1, 0, 0)), 1, 3),
+            equalTo(false),
         )
     }
 }
diff --git a/src/test/kotlin/g2101_2200/s2133_check_if_every_row_and_column_contains_all_numbers/SolutionTest.kt b/src/test/kotlin/g2101_2200/s2133_check_if_every_row_and_column_contains_all_numbers/SolutionTest.kt
index 5707e17d4..6c7ac6660 100644
--- a/src/test/kotlin/g2101_2200/s2133_check_if_every_row_and_column_contains_all_numbers/SolutionTest.kt
+++ b/src/test/kotlin/g2101_2200/s2133_check_if_every_row_and_column_contains_all_numbers/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun checkValid() {
         assertThat(
             Solution().checkValid(arrayOf(intArrayOf(1, 2, 3), intArrayOf(3, 1, 2), intArrayOf(2, 3, 1))),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun checkValid2() {
         assertThat(
             Solution().checkValid(arrayOf(intArrayOf(1, 1, 1), intArrayOf(1, 2, 3), intArrayOf(1, 2, 3))),
-            equalTo(false)
+            equalTo(false),
         )
     }
 }
diff --git a/src/test/kotlin/g2101_2200/s2135_count_words_obtained_after_adding_a_letter/SolutionTest.kt b/src/test/kotlin/g2101_2200/s2135_count_words_obtained_after_adding_a_letter/SolutionTest.kt
index b8c89a587..8b46724ee 100644
--- a/src/test/kotlin/g2101_2200/s2135_count_words_obtained_after_adding_a_letter/SolutionTest.kt
+++ b/src/test/kotlin/g2101_2200/s2135_count_words_obtained_after_adding_a_letter/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .wordCount(arrayOf("ant", "act", "tack"), arrayOf("tack", "act", "acti")),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -18,7 +18,7 @@ internal class SolutionTest {
     fun wordCount2() {
         assertThat(
             Solution().wordCount(arrayOf("ab", "a"), arrayOf("abc", "abcd")),
-            equalTo(1)
+            equalTo(1),
         )
     }
 }
diff --git a/src/test/kotlin/g2101_2200/s2136_earliest_possible_day_of_full_bloom/SolutionTest.kt b/src/test/kotlin/g2101_2200/s2136_earliest_possible_day_of_full_bloom/SolutionTest.kt
index 5175872a0..a792e7995 100644
--- a/src/test/kotlin/g2101_2200/s2136_earliest_possible_day_of_full_bloom/SolutionTest.kt
+++ b/src/test/kotlin/g2101_2200/s2136_earliest_possible_day_of_full_bloom/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun earliestFullBloom() {
         assertThat(
             Solution().earliestFullBloom(intArrayOf(1, 4, 3), intArrayOf(2, 3, 1)),
-            equalTo(9)
+            equalTo(9),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun earliestFullBloom2() {
         assertThat(
             Solution().earliestFullBloom(intArrayOf(1, 2, 3, 2), intArrayOf(2, 1, 2, 1)),
-            equalTo(9)
+            equalTo(9),
         )
     }
 
diff --git a/src/test/kotlin/g2101_2200/s2138_divide_a_string_into_groups_of_size_k/SolutionTest.kt b/src/test/kotlin/g2101_2200/s2138_divide_a_string_into_groups_of_size_k/SolutionTest.kt
index 00c646b74..2153c811d 100644
--- a/src/test/kotlin/g2101_2200/s2138_divide_a_string_into_groups_of_size_k/SolutionTest.kt
+++ b/src/test/kotlin/g2101_2200/s2138_divide_a_string_into_groups_of_size_k/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun divideString() {
         assertThat(
             Solution().divideString("abcdefghi", 3, 'x'),
-            equalTo(arrayOf("abc", "def", "ghi"))
+            equalTo(arrayOf("abc", "def", "ghi")),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun divideString2() {
         assertThat(
             Solution().divideString("abcdefghij", 3, 'x'),
-            equalTo(arrayOf("abc", "def", "ghi", "jxx"))
+            equalTo(arrayOf("abc", "def", "ghi", "jxx")),
         )
     }
 }
diff --git a/src/test/kotlin/g2101_2200/s2140_solving_questions_with_brainpower/SolutionTest.kt b/src/test/kotlin/g2101_2200/s2140_solving_questions_with_brainpower/SolutionTest.kt
index d47c3ffc9..099acda4a 100644
--- a/src/test/kotlin/g2101_2200/s2140_solving_questions_with_brainpower/SolutionTest.kt
+++ b/src/test/kotlin/g2101_2200/s2140_solving_questions_with_brainpower/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun mostPoints() {
         assertThat(
             Solution().mostPoints(arrayOf(intArrayOf(3, 2), intArrayOf(4, 3), intArrayOf(4, 4), intArrayOf(2, 5))),
-            equalTo(5L)
+            equalTo(5L),
         )
     }
 
@@ -22,10 +22,10 @@ internal class SolutionTest {
                     intArrayOf(2, 2),
                     intArrayOf(3, 3),
                     intArrayOf(4, 4),
-                    intArrayOf(5, 5)
-                )
+                    intArrayOf(5, 5),
+                ),
             ),
-            equalTo(7L)
+            equalTo(7L),
         )
     }
 }
diff --git a/src/test/kotlin/g2101_2200/s2146_k_highest_ranked_items_within_a_price_range/SolutionTest.kt b/src/test/kotlin/g2101_2200/s2146_k_highest_ranked_items_within_a_price_range/SolutionTest.kt
index 634fe24a4..857c16137 100644
--- a/src/test/kotlin/g2101_2200/s2146_k_highest_ranked_items_within_a_price_range/SolutionTest.kt
+++ b/src/test/kotlin/g2101_2200/s2146_k_highest_ranked_items_within_a_price_range/SolutionTest.kt
@@ -13,11 +13,11 @@ internal class SolutionTest {
                     arrayOf(intArrayOf(1, 2, 0, 1), intArrayOf(1, 3, 0, 1), intArrayOf(0, 2, 5, 1)),
                     intArrayOf(2, 5),
                     intArrayOf(0, 0),
-                    3
+                    3,
                 ),
             equalTo(
-                listOf(mutableListOf(0, 1), mutableListOf(1, 1), mutableListOf(2, 1))
-            )
+                listOf(mutableListOf(0, 1), mutableListOf(1, 1), mutableListOf(2, 1)),
+            ),
         )
     }
 
@@ -29,9 +29,9 @@ internal class SolutionTest {
                     arrayOf(intArrayOf(1, 2, 0, 1), intArrayOf(1, 3, 3, 1), intArrayOf(0, 2, 5, 1)),
                     intArrayOf(2, 3),
                     intArrayOf(2, 3),
-                    2
+                    2,
                 ),
-            equalTo(listOf(mutableListOf(2, 1), mutableListOf(1, 2)))
+            equalTo(listOf(mutableListOf(2, 1), mutableListOf(1, 2))),
         )
     }
 
@@ -43,9 +43,9 @@ internal class SolutionTest {
                     arrayOf(intArrayOf(1, 1, 1), intArrayOf(0, 0, 1), intArrayOf(2, 3, 4)),
                     intArrayOf(2, 3),
                     intArrayOf(0, 0),
-                    3
+                    3,
                 ),
-            equalTo(listOf(mutableListOf(2, 1), mutableListOf(2, 0)))
+            equalTo(listOf(mutableListOf(2, 1), mutableListOf(2, 0))),
         )
     }
 }
diff --git a/src/test/kotlin/g2101_2200/s2149_rearrange_array_elements_by_sign/SolutionTest.kt b/src/test/kotlin/g2101_2200/s2149_rearrange_array_elements_by_sign/SolutionTest.kt
index 6793f58fb..2fe75cf48 100644
--- a/src/test/kotlin/g2101_2200/s2149_rearrange_array_elements_by_sign/SolutionTest.kt
+++ b/src/test/kotlin/g2101_2200/s2149_rearrange_array_elements_by_sign/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun rearrangeArray() {
         assertThat(
             Solution().rearrangeArray(intArrayOf(3, 1, -2, -5, 2, -4)),
-            equalTo(intArrayOf(3, -2, 1, -5, 2, -4))
+            equalTo(intArrayOf(3, -2, 1, -5, 2, -4)),
         )
     }
 
diff --git a/src/test/kotlin/g2101_2200/s2150_find_all_lonely_numbers_in_the_array/SolutionTest.kt b/src/test/kotlin/g2101_2200/s2150_find_all_lonely_numbers_in_the_array/SolutionTest.kt
index 7e5b450a5..e586bf267 100644
--- a/src/test/kotlin/g2101_2200/s2150_find_all_lonely_numbers_in_the_array/SolutionTest.kt
+++ b/src/test/kotlin/g2101_2200/s2150_find_all_lonely_numbers_in_the_array/SolutionTest.kt
@@ -8,7 +8,8 @@ internal class SolutionTest {
     @Test
     fun findLonely() {
         assertThat(
-            Solution().findLonely(intArrayOf(10, 6, 5, 8)), equalTo(mutableListOf(10, 8))
+            Solution().findLonely(intArrayOf(10, 6, 5, 8)),
+            equalTo(mutableListOf(10, 8)),
         )
     }
 
@@ -16,7 +17,7 @@ internal class SolutionTest {
     fun findLonely2() {
         assertThat(
             Solution().findLonely(intArrayOf(1, 3, 5, 3)),
-            equalTo(mutableListOf(1, 5))
+            equalTo(mutableListOf(1, 5)),
         )
     }
 }
diff --git a/src/test/kotlin/g2101_2200/s2151_maximum_good_people_based_on_statements/SolutionTest.kt b/src/test/kotlin/g2101_2200/s2151_maximum_good_people_based_on_statements/SolutionTest.kt
index 6cf11fa66..3c365043c 100644
--- a/src/test/kotlin/g2101_2200/s2151_maximum_good_people_based_on_statements/SolutionTest.kt
+++ b/src/test/kotlin/g2101_2200/s2151_maximum_good_people_based_on_statements/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun maximumGood() {
         assertThat(
             Solution().maximumGood(arrayOf(intArrayOf(2, 1, 2), intArrayOf(1, 2, 2), intArrayOf(2, 0, 2))),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun maximumGood2() {
         assertThat(
             Solution().maximumGood(arrayOf(intArrayOf(2, 0), intArrayOf(0, 2))),
-            equalTo(1)
+            equalTo(1),
         )
     }
 }
diff --git a/src/test/kotlin/g2101_2200/s2155_all_divisions_with_the_highest_score_of_a_binary_array/SolutionTest.kt b/src/test/kotlin/g2101_2200/s2155_all_divisions_with_the_highest_score_of_a_binary_array/SolutionTest.kt
index a627cf253..75aa4488e 100644
--- a/src/test/kotlin/g2101_2200/s2155_all_divisions_with_the_highest_score_of_a_binary_array/SolutionTest.kt
+++ b/src/test/kotlin/g2101_2200/s2155_all_divisions_with_the_highest_score_of_a_binary_array/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun maxScoreIndices() {
         assertThat(
             Solution().maxScoreIndices(intArrayOf(0, 0, 1, 0)),
-            equalTo(mutableListOf(2, 4))
+            equalTo(mutableListOf(2, 4)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun maxScoreIndices2() {
         assertThat(
             Solution().maxScoreIndices(intArrayOf(0, 0, 0)),
-            equalTo(mutableListOf(3))
+            equalTo(mutableListOf(3)),
         )
     }
 
diff --git a/src/test/kotlin/g2101_2200/s2157_groups_of_strings/SolutionTest.kt b/src/test/kotlin/g2101_2200/s2157_groups_of_strings/SolutionTest.kt
index 7eb5715b4..b67966ae6 100644
--- a/src/test/kotlin/g2101_2200/s2157_groups_of_strings/SolutionTest.kt
+++ b/src/test/kotlin/g2101_2200/s2157_groups_of_strings/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun groupStrings() {
         assertThat(
             Solution().groupStrings(arrayOf("a", "b", "ab", "cde")),
-            equalTo(intArrayOf(2, 3))
+            equalTo(intArrayOf(2, 3)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun groupStrings2() {
         assertThat(
             Solution().groupStrings(arrayOf("a", "ab", "abc")),
-            equalTo(intArrayOf(1, 3))
+            equalTo(intArrayOf(1, 3)),
         )
     }
 }
diff --git a/src/test/kotlin/g2101_2200/s2161_partition_array_according_to_given_pivot/SolutionTest.kt b/src/test/kotlin/g2101_2200/s2161_partition_array_according_to_given_pivot/SolutionTest.kt
index 8f1222ff4..55814dd22 100644
--- a/src/test/kotlin/g2101_2200/s2161_partition_array_according_to_given_pivot/SolutionTest.kt
+++ b/src/test/kotlin/g2101_2200/s2161_partition_array_according_to_given_pivot/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun pivotArray() {
         assertThat(
             Solution().pivotArray(intArrayOf(9, 12, 5, 10, 14, 3, 10), 10),
-            equalTo(intArrayOf(9, 5, 3, 10, 10, 12, 14))
+            equalTo(intArrayOf(9, 5, 3, 10, 10, 12, 14)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun pivotArray2() {
         assertThat(
             Solution().pivotArray(intArrayOf(-3, 4, 3, 2), 2),
-            equalTo(intArrayOf(-3, 2, 4, 3))
+            equalTo(intArrayOf(-3, 2, 4, 3)),
         )
     }
 }
diff --git a/src/test/kotlin/g2101_2200/s2164_sort_even_and_odd_indices_independently/SolutionTest.kt b/src/test/kotlin/g2101_2200/s2164_sort_even_and_odd_indices_independently/SolutionTest.kt
index c5686a7a0..a075677d5 100644
--- a/src/test/kotlin/g2101_2200/s2164_sort_even_and_odd_indices_independently/SolutionTest.kt
+++ b/src/test/kotlin/g2101_2200/s2164_sort_even_and_odd_indices_independently/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun sortEvenOdd() {
         assertThat(
             Solution().sortEvenOdd(intArrayOf(4, 1, 2, 3)),
-            equalTo(intArrayOf(2, 3, 4, 1))
+            equalTo(intArrayOf(2, 3, 4, 1)),
         )
     }
 
diff --git a/src/test/kotlin/g2101_2200/s2179_count_good_triplets_in_an_array/SolutionTest.kt b/src/test/kotlin/g2101_2200/s2179_count_good_triplets_in_an_array/SolutionTest.kt
index ab3ae8a05..a60103b34 100644
--- a/src/test/kotlin/g2101_2200/s2179_count_good_triplets_in_an_array/SolutionTest.kt
+++ b/src/test/kotlin/g2101_2200/s2179_count_good_triplets_in_an_array/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun goodTriplets() {
         assertThat(
             Solution().goodTriplets(intArrayOf(2, 0, 1, 3), intArrayOf(0, 1, 2, 3)),
-            equalTo(1L)
+            equalTo(1L),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun goodTriplets2() {
         assertThat(
             Solution().goodTriplets(intArrayOf(4, 0, 1, 3, 2), intArrayOf(4, 1, 0, 2, 3)),
-            equalTo(4L)
+            equalTo(4L),
         )
     }
 }
diff --git a/src/test/kotlin/g2101_2200/s2185_counting_words_with_a_given_prefix/SolutionTest.kt b/src/test/kotlin/g2101_2200/s2185_counting_words_with_a_given_prefix/SolutionTest.kt
index 0fa027115..e8addbbaa 100644
--- a/src/test/kotlin/g2101_2200/s2185_counting_words_with_a_given_prefix/SolutionTest.kt
+++ b/src/test/kotlin/g2101_2200/s2185_counting_words_with_a_given_prefix/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .prefixCount(arrayOf("pay", "attention", "practice", "attend"), "at"),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -19,7 +19,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .prefixCount(arrayOf("leetcode", "win", "loops", "success"), "code"),
-            equalTo(0)
+            equalTo(0),
         )
     }
 }
diff --git a/src/test/kotlin/g2101_2200/s2188_minimum_time_to_finish_the_race/SolutionTest.kt b/src/test/kotlin/g2101_2200/s2188_minimum_time_to_finish_the_race/SolutionTest.kt
index 7668f2dc7..84977c04c 100644
--- a/src/test/kotlin/g2101_2200/s2188_minimum_time_to_finish_the_race/SolutionTest.kt
+++ b/src/test/kotlin/g2101_2200/s2188_minimum_time_to_finish_the_race/SolutionTest.kt
@@ -8,7 +8,8 @@ internal class SolutionTest {
     @Test
     fun minimumFinishTime() {
         assertThat(
-            Solution().minimumFinishTime(arrayOf(intArrayOf(2, 3), intArrayOf(3, 4)), 5, 4), equalTo(21)
+            Solution().minimumFinishTime(arrayOf(intArrayOf(2, 3), intArrayOf(3, 4)), 5, 4),
+            equalTo(21),
         )
     }
 
@@ -16,7 +17,7 @@ internal class SolutionTest {
     fun minimumFinishTime2() {
         assertThat(
             Solution().minimumFinishTime(arrayOf(intArrayOf(1, 10), intArrayOf(2, 2), intArrayOf(3, 4)), 6, 5),
-            equalTo(25)
+            equalTo(25),
         )
     }
 }
diff --git a/src/test/kotlin/g2101_2200/s2191_sort_the_jumbled_numbers/SolutionTest.kt b/src/test/kotlin/g2101_2200/s2191_sort_the_jumbled_numbers/SolutionTest.kt
index f92873181..56c08c7a9 100644
--- a/src/test/kotlin/g2101_2200/s2191_sort_the_jumbled_numbers/SolutionTest.kt
+++ b/src/test/kotlin/g2101_2200/s2191_sort_the_jumbled_numbers/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .sortJumbled(intArrayOf(8, 9, 4, 0, 2, 1, 3, 5, 7, 6), intArrayOf(991, 338, 38)),
-            equalTo(intArrayOf(338, 38, 991))
+            equalTo(intArrayOf(338, 38, 991)),
         )
     }
 
@@ -19,7 +19,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .sortJumbled(intArrayOf(0, 1, 2, 3, 4, 5, 6, 7, 8, 9), intArrayOf(789, 456, 123)),
-            equalTo(intArrayOf(123, 456, 789))
+            equalTo(intArrayOf(123, 456, 789)),
         )
     }
 }
diff --git a/src/test/kotlin/g2101_2200/s2192_all_ancestors_of_a_node_in_a_directed_acyclic_graph/SolutionTest.kt b/src/test/kotlin/g2101_2200/s2192_all_ancestors_of_a_node_in_a_directed_acyclic_graph/SolutionTest.kt
index 0587c67ed..b795f4b85 100644
--- a/src/test/kotlin/g2101_2200/s2192_all_ancestors_of_a_node_in_a_directed_acyclic_graph/SolutionTest.kt
+++ b/src/test/kotlin/g2101_2200/s2192_all_ancestors_of_a_node_in_a_directed_acyclic_graph/SolutionTest.kt
@@ -17,7 +17,7 @@ internal class SolutionTest {
             intArrayOf(3, 5),
             intArrayOf(3, 6),
             intArrayOf(3, 7),
-            intArrayOf(4, 6)
+            intArrayOf(4, 6),
         )
         val expected = arrayOf(
             intArrayOf(),
@@ -27,11 +27,11 @@ internal class SolutionTest {
             intArrayOf(0, 2),
             intArrayOf(0, 1, 3),
             intArrayOf(0, 1, 2, 3, 4),
-            intArrayOf(0, 1, 2, 3)
+            intArrayOf(0, 1, 2, 3),
         )
         assertThat(
             Solution().getAncestors(8, edges),
-            equalTo(getLists(expected))
+            equalTo(getLists(expected)),
         )
     }
 
@@ -47,7 +47,7 @@ internal class SolutionTest {
             intArrayOf(1, 4),
             intArrayOf(2, 3),
             intArrayOf(2, 4),
-            intArrayOf(3, 4)
+            intArrayOf(3, 4),
         )
         val expected = arrayOf(
             intArrayOf(),
@@ -57,11 +57,11 @@ internal class SolutionTest {
             intArrayOf(0, 1, 2, 3),
             intArrayOf(),
             intArrayOf(),
-            intArrayOf()
+            intArrayOf(),
         )
         assertThat(
             Solution().getAncestors(8, edges),
-            equalTo(getLists(expected))
+            equalTo(getLists(expected)),
         )
     }
 }
diff --git a/src/test/kotlin/g2101_2200/s2193_minimum_number_of_moves_to_make_palindrome/SolutionTest.kt b/src/test/kotlin/g2101_2200/s2193_minimum_number_of_moves_to_make_palindrome/SolutionTest.kt
index a8a60c3d2..86d9e40d2 100644
--- a/src/test/kotlin/g2101_2200/s2193_minimum_number_of_moves_to_make_palindrome/SolutionTest.kt
+++ b/src/test/kotlin/g2101_2200/s2193_minimum_number_of_moves_to_make_palindrome/SolutionTest.kt
@@ -19,7 +19,7 @@ internal class SolutionTest {
     fun minMovesToMakePalindrome3() {
         assertThat(
             Solution().minMovesToMakePalindrome("skwhhaaunskegmdtutlgtteunmuuludii"),
-            equalTo(163)
+            equalTo(163),
         )
     }
 }
diff --git a/src/test/kotlin/g2101_2200/s2194_cells_in_a_range_on_an_excel_sheet/SolutionTest.kt b/src/test/kotlin/g2101_2200/s2194_cells_in_a_range_on_an_excel_sheet/SolutionTest.kt
index fe436b685..0f781f920 100644
--- a/src/test/kotlin/g2101_2200/s2194_cells_in_a_range_on_an_excel_sheet/SolutionTest.kt
+++ b/src/test/kotlin/g2101_2200/s2194_cells_in_a_range_on_an_excel_sheet/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun cellsInRange() {
         assertThat(
             Solution().cellsInRange("K1:L2"),
-            equalTo(mutableListOf("K1", "K2", "L1", "L2"))
+            equalTo(mutableListOf("K1", "K2", "L1", "L2")),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun cellsInRange2() {
         assertThat(
             Solution().cellsInRange("A1:F1"),
-            equalTo(mutableListOf("A1", "B1", "C1", "D1", "E1", "F1"))
+            equalTo(mutableListOf("A1", "B1", "C1", "D1", "E1", "F1")),
         )
     }
 }
diff --git a/src/test/kotlin/g2101_2200/s2196_create_binary_tree_from_descriptions/SolutionTest.kt b/src/test/kotlin/g2101_2200/s2196_create_binary_tree_from_descriptions/SolutionTest.kt
index 84166357b..d6d077b8c 100644
--- a/src/test/kotlin/g2101_2200/s2196_create_binary_tree_from_descriptions/SolutionTest.kt
+++ b/src/test/kotlin/g2101_2200/s2196_create_binary_tree_from_descriptions/SolutionTest.kt
@@ -15,11 +15,11 @@ internal class SolutionTest {
                         intArrayOf(20, 17, 0),
                         intArrayOf(50, 20, 1),
                         intArrayOf(50, 80, 0),
-                        intArrayOf(80, 19, 1)
-                    )
+                        intArrayOf(80, 19, 1),
+                    ),
                 )
                 .toString(),
-            equalTo("50,20,15,17,80,19,null")
+            equalTo("50,20,15,17,80,19,null"),
         )
     }
 
@@ -29,7 +29,7 @@ internal class SolutionTest {
             Solution()
                 .createBinaryTree(arrayOf(intArrayOf(1, 2, 1), intArrayOf(2, 3, 0), intArrayOf(3, 4, 1)))
                 .toString(),
-            equalTo("1,2,null,3,4,null,null")
+            equalTo("1,2,null,3,4,null,null"),
         )
     }
 }
diff --git a/src/test/kotlin/g2101_2200/s2197_replace_non_coprime_numbers_in_array/SolutionTest.kt b/src/test/kotlin/g2101_2200/s2197_replace_non_coprime_numbers_in_array/SolutionTest.kt
index 919bd472e..1c68279da 100644
--- a/src/test/kotlin/g2101_2200/s2197_replace_non_coprime_numbers_in_array/SolutionTest.kt
+++ b/src/test/kotlin/g2101_2200/s2197_replace_non_coprime_numbers_in_array/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun replaceNonCoprimes() {
         assertThat(
             Solution().replaceNonCoprimes(intArrayOf(6, 4, 3, 2, 7, 6, 2)),
-            equalTo(mutableListOf(12, 7, 6))
+            equalTo(mutableListOf(12, 7, 6)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun replaceNonCoprimes2() {
         assertThat(
             Solution().replaceNonCoprimes(intArrayOf(2, 2, 1, 1, 3, 3, 3)),
-            equalTo(mutableListOf(2, 1, 1, 3))
+            equalTo(mutableListOf(2, 1, 1, 3)),
         )
     }
 
@@ -26,7 +26,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .replaceNonCoprimes(intArrayOf(287, 41, 49, 287, 899, 23, 23, 20677, 5, 825)),
-            equalTo(mutableListOf(2009, 20677, 825))
+            equalTo(mutableListOf(2009, 20677, 825)),
         )
     }
 }
diff --git a/src/test/kotlin/g2101_2200/s2200_find_all_k_distant_indices_in_an_array/SolutionTest.kt b/src/test/kotlin/g2101_2200/s2200_find_all_k_distant_indices_in_an_array/SolutionTest.kt
index 2c38f79a4..18edaf4c1 100644
--- a/src/test/kotlin/g2101_2200/s2200_find_all_k_distant_indices_in_an_array/SolutionTest.kt
+++ b/src/test/kotlin/g2101_2200/s2200_find_all_k_distant_indices_in_an_array/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun findKDistantIndices() {
         assertThat(
             Solution().findKDistantIndices(intArrayOf(3, 4, 9, 1, 3, 9, 5), 9, 1),
-            equalTo(mutableListOf(1, 2, 3, 4, 5, 6))
+            equalTo(mutableListOf(1, 2, 3, 4, 5, 6)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun findKDistantIndices2() {
         assertThat(
             Solution().findKDistantIndices(intArrayOf(2, 2, 2, 2, 2), 2, 2),
-            equalTo(mutableListOf(0, 1, 2, 3, 4))
+            equalTo(mutableListOf(0, 1, 2, 3, 4)),
         )
     }
 }
diff --git a/src/test/kotlin/g2201_2300/s2201_count_artifacts_that_can_be_extracted/SolutionTest.kt b/src/test/kotlin/g2201_2300/s2201_count_artifacts_that_can_be_extracted/SolutionTest.kt
index 97211f61b..6bc596b7a 100644
--- a/src/test/kotlin/g2201_2300/s2201_count_artifacts_that_can_be_extracted/SolutionTest.kt
+++ b/src/test/kotlin/g2201_2300/s2201_count_artifacts_that_can_be_extracted/SolutionTest.kt
@@ -12,9 +12,9 @@ internal class SolutionTest {
                 .digArtifacts(
                     2,
                     arrayOf(intArrayOf(0, 0, 0, 0), intArrayOf(0, 1, 1, 1)),
-                    arrayOf(intArrayOf(0, 0), intArrayOf(0, 1))
+                    arrayOf(intArrayOf(0, 0), intArrayOf(0, 1)),
                 ),
-            equalTo(1)
+            equalTo(1),
         )
     }
 
@@ -25,9 +25,9 @@ internal class SolutionTest {
                 .digArtifacts(
                     2,
                     arrayOf(intArrayOf(0, 0, 0, 0), intArrayOf(0, 1, 1, 1)),
-                    arrayOf(intArrayOf(0, 0), intArrayOf(0, 1), intArrayOf(1, 1))
+                    arrayOf(intArrayOf(0, 0), intArrayOf(0, 1), intArrayOf(1, 1)),
                 ),
-            equalTo(2)
+            equalTo(2),
         )
     }
 }
diff --git a/src/test/kotlin/g2201_2300/s2203_minimum_weighted_subgraph_with_the_required_paths/SolutionTest.kt b/src/test/kotlin/g2201_2300/s2203_minimum_weighted_subgraph_with_the_required_paths/SolutionTest.kt
index 8e8b5137a..3d0be3334 100644
--- a/src/test/kotlin/g2201_2300/s2203_minimum_weighted_subgraph_with_the_required_paths/SolutionTest.kt
+++ b/src/test/kotlin/g2201_2300/s2203_minimum_weighted_subgraph_with_the_required_paths/SolutionTest.kt
@@ -20,13 +20,13 @@ internal class SolutionTest {
                         intArrayOf(2, 3, 3),
                         intArrayOf(2, 3, 4),
                         intArrayOf(3, 4, 2),
-                        intArrayOf(4, 5, 1)
+                        intArrayOf(4, 5, 1),
                     ),
                     0,
                     1,
-                    5
+                    5,
                 ),
-            equalTo(9L)
+            equalTo(9L),
         )
     }
 
@@ -34,7 +34,7 @@ internal class SolutionTest {
     fun minimumWeight2() {
         assertThat(
             Solution().minimumWeight(3, arrayOf(intArrayOf(0, 1, 1), intArrayOf(2, 1, 1)), 0, 1, 2),
-            equalTo(-1L)
+            equalTo(-1L),
         )
     }
 }
diff --git a/src/test/kotlin/g2201_2300/s2211_count_collisions_on_a_road/SolutionTest.kt b/src/test/kotlin/g2201_2300/s2211_count_collisions_on_a_road/SolutionTest.kt
index 57f055eb1..98f15523a 100644
--- a/src/test/kotlin/g2201_2300/s2211_count_collisions_on_a_road/SolutionTest.kt
+++ b/src/test/kotlin/g2201_2300/s2211_count_collisions_on_a_road/SolutionTest.kt
@@ -19,7 +19,7 @@ internal class SolutionTest {
     fun countCollisions3() {
         assertThat(
             Solution().countCollisions("SRRLRLRSRLRSSRRLSLRLLRSLSLLSSRRLSRSLSLRRS"),
-            equalTo(28)
+            equalTo(28),
         )
     }
 
@@ -27,7 +27,7 @@ internal class SolutionTest {
     fun countCollisions4() {
         assertThat(
             Solution().countCollisions("SSRSSRLLRSLLRSRSSRLRRRRLLRRLSSRR"),
-            equalTo(20)
+            equalTo(20),
         )
     }
 }
diff --git a/src/test/kotlin/g2201_2300/s2212_maximum_points_in_an_archery_competition/SolutionTest.kt b/src/test/kotlin/g2201_2300/s2212_maximum_points_in_an_archery_competition/SolutionTest.kt
index d4139a77a..d3855f706 100644
--- a/src/test/kotlin/g2201_2300/s2212_maximum_points_in_an_archery_competition/SolutionTest.kt
+++ b/src/test/kotlin/g2201_2300/s2212_maximum_points_in_an_archery_competition/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun maximumBobPoints() {
         assertThat(
             Solution().maximumBobPoints(9, intArrayOf(1, 1, 0, 1, 0, 0, 2, 1, 0, 1, 2, 0)),
-            equalTo(intArrayOf(0, 0, 0, 0, 1, 1, 0, 0, 1, 2, 3, 1))
+            equalTo(intArrayOf(0, 0, 0, 0, 1, 1, 0, 0, 1, 2, 3, 1)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun maximumBobPoints2() {
         assertThat(
             Solution().maximumBobPoints(3, intArrayOf(0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 2)),
-            equalTo(intArrayOf(0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0))
+            equalTo(intArrayOf(0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0)),
         )
     }
 }
diff --git a/src/test/kotlin/g2201_2300/s2213_longest_substring_of_one_repeating_character/SolutionTest.kt b/src/test/kotlin/g2201_2300/s2213_longest_substring_of_one_repeating_character/SolutionTest.kt
index 7f8704a4d..b2b053cf4 100644
--- a/src/test/kotlin/g2201_2300/s2213_longest_substring_of_one_repeating_character/SolutionTest.kt
+++ b/src/test/kotlin/g2201_2300/s2213_longest_substring_of_one_repeating_character/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun longestRepeating() {
         assertThat(
             Solution().longestRepeating("babacc", "bcb", intArrayOf(1, 3, 3)),
-            equalTo(intArrayOf(3, 3, 4))
+            equalTo(intArrayOf(3, 3, 4)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun longestRepeating2() {
         assertThat(
             Solution().longestRepeating("abyzz", "aa", intArrayOf(2, 1)),
-            equalTo(intArrayOf(2, 3))
+            equalTo(intArrayOf(2, 3)),
         )
     }
 }
diff --git a/src/test/kotlin/g2201_2300/s2215_find_the_difference_of_two_arrays/SolutionTest.kt b/src/test/kotlin/g2201_2300/s2215_find_the_difference_of_two_arrays/SolutionTest.kt
index 30ee3d2a9..0938c6a0b 100644
--- a/src/test/kotlin/g2201_2300/s2215_find_the_difference_of_two_arrays/SolutionTest.kt
+++ b/src/test/kotlin/g2201_2300/s2215_find_the_difference_of_two_arrays/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
     fun findDifference() {
         assertThat(
             Solution().findDifference(intArrayOf(1, 2, 3), intArrayOf(2, 4, 6)),
-            equalTo(getLists(arrayOf(intArrayOf(1, 3), intArrayOf(4, 6))))
+            equalTo(getLists(arrayOf(intArrayOf(1, 3), intArrayOf(4, 6)))),
         )
     }
 
@@ -18,7 +18,7 @@ internal class SolutionTest {
     fun findDifference2() {
         assertThat(
             Solution().findDifference(intArrayOf(1, 2, 3, 3), intArrayOf(1, 1, 2, 2)),
-            equalTo(getLists(arrayOf(intArrayOf(3), intArrayOf())))
+            equalTo(getLists(arrayOf(intArrayOf(3), intArrayOf()))),
         )
     }
 }
diff --git a/src/test/kotlin/g2201_2300/s2217_find_palindrome_with_fixed_length/SolutionTest.kt b/src/test/kotlin/g2201_2300/s2217_find_palindrome_with_fixed_length/SolutionTest.kt
index e1ef971f6..103129769 100644
--- a/src/test/kotlin/g2201_2300/s2217_find_palindrome_with_fixed_length/SolutionTest.kt
+++ b/src/test/kotlin/g2201_2300/s2217_find_palindrome_with_fixed_length/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun kthPalindrome() {
         assertThat(
             Solution().kthPalindrome(intArrayOf(1, 2, 3, 4, 5, 90), 3),
-            equalTo(longArrayOf(101, 111, 121, 131, 141, 999))
+            equalTo(longArrayOf(101, 111, 121, 131, 141, 999)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun kthPalindrome2() {
         assertThat(
             Solution().kthPalindrome(intArrayOf(2, 4, 6), 4),
-            equalTo(longArrayOf(1111, 1331, 1551))
+            equalTo(longArrayOf(1111, 1331, 1551)),
         )
     }
 }
diff --git a/src/test/kotlin/g2201_2300/s2218_maximum_value_of_k_coins_from_piles/SolutionTest.kt b/src/test/kotlin/g2201_2300/s2218_maximum_value_of_k_coins_from_piles/SolutionTest.kt
index 716788fc8..9cc75ff8f 100644
--- a/src/test/kotlin/g2201_2300/s2218_maximum_value_of_k_coins_from_piles/SolutionTest.kt
+++ b/src/test/kotlin/g2201_2300/s2218_maximum_value_of_k_coins_from_piles/SolutionTest.kt
@@ -10,9 +10,10 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .maxValueOfCoins(
-                    listOf(mutableListOf(1, 100, 3), mutableListOf(7, 8, 9)), 2
+                    listOf(mutableListOf(1, 100, 3), mutableListOf(7, 8, 9)),
+                    2,
                 ),
-            equalTo(101)
+            equalTo(101),
         )
     }
 
@@ -28,11 +29,11 @@ internal class SolutionTest {
                         listOf(100),
                         listOf(100),
                         listOf(100),
-                        mutableListOf(1, 1, 1, 1, 1, 1, 700)
+                        mutableListOf(1, 1, 1, 1, 1, 1, 700),
                     ),
-                    7
+                    7,
                 ),
-            equalTo(706)
+            equalTo(706),
         )
     }
 }
diff --git a/src/test/kotlin/g2201_2300/s2225_find_players_with_zero_or_one_losses/SolutionTest.kt b/src/test/kotlin/g2201_2300/s2225_find_players_with_zero_or_one_losses/SolutionTest.kt
index 15ef811d5..e8a8c6638 100644
--- a/src/test/kotlin/g2201_2300/s2225_find_players_with_zero_or_one_losses/SolutionTest.kt
+++ b/src/test/kotlin/g2201_2300/s2225_find_players_with_zero_or_one_losses/SolutionTest.kt
@@ -20,10 +20,10 @@ internal class SolutionTest {
                         intArrayOf(4, 8),
                         intArrayOf(4, 9),
                         intArrayOf(10, 4),
-                        intArrayOf(10, 9)
-                    )
+                        intArrayOf(10, 9),
+                    ),
                 ),
-            equalTo(listOf(mutableListOf(1, 2, 10), mutableListOf(4, 5, 7, 8)))
+            equalTo(listOf(mutableListOf(1, 2, 10), mutableListOf(4, 5, 7, 8))),
         )
     }
 
@@ -31,7 +31,7 @@ internal class SolutionTest {
     fun findWinners2() {
         assertThat(
             Solution().findWinners(arrayOf(intArrayOf(2, 3), intArrayOf(1, 3), intArrayOf(5, 4), intArrayOf(6, 4))),
-            equalTo(listOf(mutableListOf(1, 2, 5, 6), emptyList<Any>()))
+            equalTo(listOf(mutableListOf(1, 2, 5, 6), emptyList<Any>())),
         )
     }
 }
diff --git a/src/test/kotlin/g2201_2300/s2227_encrypt_and_decrypt_strings/EncrypterTest.kt b/src/test/kotlin/g2201_2300/s2227_encrypt_and_decrypt_strings/EncrypterTest.kt
index dc76de6a9..344877bd6 100644
--- a/src/test/kotlin/g2201_2300/s2227_encrypt_and_decrypt_strings/EncrypterTest.kt
+++ b/src/test/kotlin/g2201_2300/s2227_encrypt_and_decrypt_strings/EncrypterTest.kt
@@ -8,10 +8,18 @@ internal class EncrypterTest {
     @Test
     fun encrypterTest() {
         val encrypter = Encrypter(
-            charArrayOf('a', 'b', 'c', 'd'), arrayOf("ei", "zf", "ei", "am"),
+            charArrayOf('a', 'b', 'c', 'd'),
+            arrayOf("ei", "zf", "ei", "am"),
             arrayOf(
-                "abcd", "acbd", "adbc", "badc", "dacb", "cadb", "cbda", "abad"
-            )
+                "abcd",
+                "acbd",
+                "adbc",
+                "badc",
+                "dacb",
+                "cadb",
+                "cbda",
+                "abad",
+            ),
         )
         assertThat(encrypter.encrypt("abcd"), equalTo("eizfeiam"))
         assertThat(encrypter.decrypt("eizfeiam"), equalTo(2))
diff --git a/src/test/kotlin/g2201_2300/s2234_maximum_total_beauty_of_the_gardens/SolutionTest.kt b/src/test/kotlin/g2201_2300/s2234_maximum_total_beauty_of_the_gardens/SolutionTest.kt
index 3c0f8bae6..320d6be10 100644
--- a/src/test/kotlin/g2201_2300/s2234_maximum_total_beauty_of_the_gardens/SolutionTest.kt
+++ b/src/test/kotlin/g2201_2300/s2234_maximum_total_beauty_of_the_gardens/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun maximumBeauty() {
         assertThat(
             Solution().maximumBeauty(intArrayOf(1, 3, 1, 1), 7, 6, 12, 1),
-            equalTo(14L)
+            equalTo(14L),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun maximumBeauty2() {
         assertThat(
             Solution().maximumBeauty(intArrayOf(2, 4, 5, 3), 10, 5, 2, 6),
-            equalTo(30L)
+            equalTo(30L),
         )
     }
 }
diff --git a/src/test/kotlin/g2201_2300/s2236_root_equals_sum_of_children/SolutionTest.kt b/src/test/kotlin/g2201_2300/s2236_root_equals_sum_of_children/SolutionTest.kt
index ff04ed2d9..a7a484c6a 100644
--- a/src/test/kotlin/g2201_2300/s2236_root_equals_sum_of_children/SolutionTest.kt
+++ b/src/test/kotlin/g2201_2300/s2236_root_equals_sum_of_children/SolutionTest.kt
@@ -11,9 +11,9 @@ internal class SolutionTest {
         val treeNode = TreeNode.create(mutableListOf(10, 4, 6))
         assertThat(
             Solution().checkTree(
-                treeNode!!
+                treeNode!!,
             ),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
@@ -22,9 +22,9 @@ internal class SolutionTest {
         val treeNode = TreeNode.create(mutableListOf(5, 3, 1))
         assertThat(
             Solution().checkTree(
-                treeNode!!
+                treeNode!!,
             ),
-            equalTo(false)
+            equalTo(false),
         )
     }
 }
diff --git a/src/test/kotlin/g2201_2300/s2242_maximum_score_of_a_node_sequence/SolutionTest.kt b/src/test/kotlin/g2201_2300/s2242_maximum_score_of_a_node_sequence/SolutionTest.kt
index c4aba545b..8098999d5 100644
--- a/src/test/kotlin/g2201_2300/s2242_maximum_score_of_a_node_sequence/SolutionTest.kt
+++ b/src/test/kotlin/g2201_2300/s2242_maximum_score_of_a_node_sequence/SolutionTest.kt
@@ -17,10 +17,10 @@ internal class SolutionTest {
                         intArrayOf(2, 3),
                         intArrayOf(0, 2),
                         intArrayOf(1, 3),
-                        intArrayOf(2, 4)
-                    )
+                        intArrayOf(2, 4),
+                    ),
                 ),
-            equalTo(24)
+            equalTo(24),
         )
     }
 
@@ -30,9 +30,9 @@ internal class SolutionTest {
             Solution()
                 .maximumScore(
                     intArrayOf(9, 20, 6, 4, 11, 12),
-                    arrayOf(intArrayOf(0, 3), intArrayOf(5, 3), intArrayOf(2, 4), intArrayOf(1, 3))
+                    arrayOf(intArrayOf(0, 3), intArrayOf(5, 3), intArrayOf(2, 4), intArrayOf(1, 3)),
                 ),
-            equalTo(-1)
+            equalTo(-1),
         )
     }
 
@@ -50,10 +50,10 @@ internal class SolutionTest {
                         intArrayOf(5, 1),
                         intArrayOf(6, 1),
                         intArrayOf(7, 1),
-                        intArrayOf(2, 1)
-                    )
+                        intArrayOf(2, 1),
+                    ),
                 ),
-            equalTo(44)
+            equalTo(44),
         )
     }
 
@@ -82,10 +82,10 @@ internal class SolutionTest {
                         intArrayOf(4, 8),
                         intArrayOf(8, 0),
                         intArrayOf(0, 5),
-                        intArrayOf(1, 5)
-                    )
+                        intArrayOf(1, 5),
+                    ),
                 ),
-            equalTo(112)
+            equalTo(112),
         )
     }
 }
diff --git a/src/test/kotlin/g2201_2300/s2244_minimum_rounds_to_complete_all_tasks/SolutionTest.kt b/src/test/kotlin/g2201_2300/s2244_minimum_rounds_to_complete_all_tasks/SolutionTest.kt
index 79082a1ec..b31760b51 100644
--- a/src/test/kotlin/g2201_2300/s2244_minimum_rounds_to_complete_all_tasks/SolutionTest.kt
+++ b/src/test/kotlin/g2201_2300/s2244_minimum_rounds_to_complete_all_tasks/SolutionTest.kt
@@ -8,7 +8,8 @@ internal class SolutionTest {
     @Test
     fun minimumRounds() {
         assertThat(
-            Solution().minimumRounds(intArrayOf(2, 2, 3, 3, 2, 4, 4, 4, 4, 4)), equalTo(4)
+            Solution().minimumRounds(intArrayOf(2, 2, 3, 3, 2, 4, 4, 4, 4, 4)),
+            equalTo(4),
         )
     }
 
diff --git a/src/test/kotlin/g2201_2300/s2245_maximum_trailing_zeros_in_a_cornered_path/SolutionTest.kt b/src/test/kotlin/g2201_2300/s2245_maximum_trailing_zeros_in_a_cornered_path/SolutionTest.kt
index 1d6091765..75b1fe6d9 100644
--- a/src/test/kotlin/g2201_2300/s2245_maximum_trailing_zeros_in_a_cornered_path/SolutionTest.kt
+++ b/src/test/kotlin/g2201_2300/s2245_maximum_trailing_zeros_in_a_cornered_path/SolutionTest.kt
@@ -15,10 +15,10 @@ internal class SolutionTest {
                         intArrayOf(8, 1, 20, 27, 11),
                         intArrayOf(9, 4, 6, 2, 21),
                         intArrayOf(40, 9, 1, 10, 6),
-                        intArrayOf(22, 7, 4, 5, 3)
-                    )
+                        intArrayOf(22, 7, 4, 5, 3),
+                    ),
                 ),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
@@ -26,7 +26,7 @@ internal class SolutionTest {
     fun maxTrailingZeros2() {
         assertThat(
             Solution().maxTrailingZeros(arrayOf(intArrayOf(4, 3, 2), intArrayOf(7, 6, 1), intArrayOf(8, 8, 8))),
-            equalTo(0)
+            equalTo(0),
         )
     }
 }
diff --git a/src/test/kotlin/g2201_2300/s2246_longest_path_with_different_adjacent_characters/SolutionTest.kt b/src/test/kotlin/g2201_2300/s2246_longest_path_with_different_adjacent_characters/SolutionTest.kt
index 069b94ec1..cd844f307 100644
--- a/src/test/kotlin/g2201_2300/s2246_longest_path_with_different_adjacent_characters/SolutionTest.kt
+++ b/src/test/kotlin/g2201_2300/s2246_longest_path_with_different_adjacent_characters/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun longestPath() {
         assertThat(
             Solution().longestPath(intArrayOf(-1, 0, 0, 1, 1, 2), "abacbe"),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
@@ -34,14 +34,14 @@ internal class SolutionTest {
                         77, 15, 101, 138, 7, 153, 138, 56, 132, 37, 122, 43, 33, 62, 95,
                         91, 46, 103, 34, 63, 115, 2, 132, 86, 86, 9, 26, 110, 8, 87, 58,
                         30, 103, 93, 43, 45, 46, 143, 30, 87, 97, 115, 8, 58, 125, 10,
-                        152, 10, 2, 107, 141, 108, 37, 32, 43, 69, 100
+                        152, 10, 2, 107, 141, 108, 37, 32, 43, 69, 100,
                     ),
                     "ofarlvkejasusszlxapxqmpecaduhuogzltxuclafjrb" +
                         "rvqtsidmmrjjespdupikvyopweptnjteylnixcj" +
                         "jfsubmhcekgbdorwihftfbtrqhzinccijwbpj" +
-                        "aafkdplnjrydmkrluvdcmmoohwgkdmeuuqtsktbyl"
+                        "aafkdplnjrydmkrluvdcmmoohwgkdmeuuqtsktbyl",
                 ),
-            equalTo(18)
+            equalTo(18),
         )
     }
 }
diff --git a/src/test/kotlin/g2201_2300/s2248_intersection_of_multiple_arrays/SolutionTest.kt b/src/test/kotlin/g2201_2300/s2248_intersection_of_multiple_arrays/SolutionTest.kt
index 35d12b843..16d920696 100644
--- a/src/test/kotlin/g2201_2300/s2248_intersection_of_multiple_arrays/SolutionTest.kt
+++ b/src/test/kotlin/g2201_2300/s2248_intersection_of_multiple_arrays/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .intersection(arrayOf(intArrayOf(3, 1, 2, 4, 5), intArrayOf(1, 2, 3, 4), intArrayOf(3, 4, 5, 6))),
-            equalTo(mutableListOf(3, 4))
+            equalTo(mutableListOf(3, 4)),
         )
     }
 
@@ -18,7 +18,7 @@ internal class SolutionTest {
     fun intersection2() {
         assertThat(
             Solution().intersection(arrayOf(intArrayOf(1, 2, 3), intArrayOf(4, 5, 6))),
-            equalTo(mutableListOf<Any>())
+            equalTo(mutableListOf<Any>()),
         )
     }
 }
diff --git a/src/test/kotlin/g2201_2300/s2249_count_lattice_points_inside_a_circle/SolutionTest.kt b/src/test/kotlin/g2201_2300/s2249_count_lattice_points_inside_a_circle/SolutionTest.kt
index 6ef8b084c..3e061be3c 100644
--- a/src/test/kotlin/g2201_2300/s2249_count_lattice_points_inside_a_circle/SolutionTest.kt
+++ b/src/test/kotlin/g2201_2300/s2249_count_lattice_points_inside_a_circle/SolutionTest.kt
@@ -13,7 +13,8 @@ internal class SolutionTest {
     @Test
     fun countLatticePoints2() {
         assertThat(
-            Solution().countLatticePoints(arrayOf(intArrayOf(2, 2, 2), intArrayOf(3, 4, 1))), equalTo(16)
+            Solution().countLatticePoints(arrayOf(intArrayOf(2, 2, 2), intArrayOf(3, 4, 1))),
+            equalTo(16),
         )
     }
 }
diff --git a/src/test/kotlin/g2201_2300/s2250_count_number_of_rectangles_containing_each_point/SolutionTest.kt b/src/test/kotlin/g2201_2300/s2250_count_number_of_rectangles_containing_each_point/SolutionTest.kt
index f1437b8e0..6307e2f7f 100644
--- a/src/test/kotlin/g2201_2300/s2250_count_number_of_rectangles_containing_each_point/SolutionTest.kt
+++ b/src/test/kotlin/g2201_2300/s2250_count_number_of_rectangles_containing_each_point/SolutionTest.kt
@@ -11,9 +11,9 @@ internal class SolutionTest {
             Solution()
                 .countRectangles(
                     arrayOf(intArrayOf(1, 2), intArrayOf(2, 3), intArrayOf(2, 5)),
-                    arrayOf(intArrayOf(2, 1), intArrayOf(1, 4))
+                    arrayOf(intArrayOf(2, 1), intArrayOf(1, 4)),
                 ),
-            equalTo(intArrayOf(2, 1))
+            equalTo(intArrayOf(2, 1)),
         )
     }
 
@@ -23,9 +23,9 @@ internal class SolutionTest {
             Solution()
                 .countRectangles(
                     arrayOf(intArrayOf(1, 1), intArrayOf(2, 2), intArrayOf(3, 3)),
-                    arrayOf(intArrayOf(1, 3), intArrayOf(1, 1))
+                    arrayOf(intArrayOf(1, 3), intArrayOf(1, 1)),
                 ),
-            equalTo(intArrayOf(1, 3))
+            equalTo(intArrayOf(1, 3)),
         )
     }
 }
diff --git a/src/test/kotlin/g2201_2300/s2251_number_of_flowers_in_full_bloom/SolutionTest.kt b/src/test/kotlin/g2201_2300/s2251_number_of_flowers_in_full_bloom/SolutionTest.kt
index c72b4e815..4f661292f 100644
--- a/src/test/kotlin/g2201_2300/s2251_number_of_flowers_in_full_bloom/SolutionTest.kt
+++ b/src/test/kotlin/g2201_2300/s2251_number_of_flowers_in_full_bloom/SolutionTest.kt
@@ -11,9 +11,9 @@ internal class SolutionTest {
             Solution()
                 .fullBloomFlowers(
                     arrayOf(intArrayOf(1, 6), intArrayOf(3, 7), intArrayOf(9, 12), intArrayOf(4, 13)),
-                    intArrayOf(2, 3, 7, 11)
+                    intArrayOf(2, 3, 7, 11),
                 ),
-            equalTo(intArrayOf(1, 2, 2, 2))
+            equalTo(intArrayOf(1, 2, 2, 2)),
         )
     }
 
@@ -21,7 +21,7 @@ internal class SolutionTest {
     fun fullBloomFlowers2() {
         assertThat(
             Solution().fullBloomFlowers(arrayOf(intArrayOf(1, 10), intArrayOf(3, 3)), intArrayOf(3, 3, 2)),
-            equalTo(intArrayOf(2, 2, 1))
+            equalTo(intArrayOf(2, 2, 1)),
         )
     }
 }
diff --git a/src/test/kotlin/g2201_2300/s2255_count_prefixes_of_a_given_string/SolutionTest.kt b/src/test/kotlin/g2201_2300/s2255_count_prefixes_of_a_given_string/SolutionTest.kt
index d82b3d5b8..231b72d3d 100644
--- a/src/test/kotlin/g2201_2300/s2255_count_prefixes_of_a_given_string/SolutionTest.kt
+++ b/src/test/kotlin/g2201_2300/s2255_count_prefixes_of_a_given_string/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .countPrefixes(arrayOf("a", "b", "c", "ab", "bc", "abc"), "abc"),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
diff --git a/src/test/kotlin/g2201_2300/s2256_minimum_average_difference/SolutionTest.kt b/src/test/kotlin/g2201_2300/s2256_minimum_average_difference/SolutionTest.kt
index 77daaae1a..a84bf5f40 100644
--- a/src/test/kotlin/g2201_2300/s2256_minimum_average_difference/SolutionTest.kt
+++ b/src/test/kotlin/g2201_2300/s2256_minimum_average_difference/SolutionTest.kt
@@ -8,7 +8,8 @@ internal class SolutionTest {
     @Test
     fun minimumAverageDifference() {
         assertThat(
-            Solution().minimumAverageDifference(intArrayOf(2, 5, 3, 9, 5, 3)), equalTo(3)
+            Solution().minimumAverageDifference(intArrayOf(2, 5, 3, 9, 5, 3)),
+            equalTo(3),
         )
     }
 
diff --git a/src/test/kotlin/g2201_2300/s2257_count_unguarded_cells_in_the_grid/SolutionTest.kt b/src/test/kotlin/g2201_2300/s2257_count_unguarded_cells_in_the_grid/SolutionTest.kt
index 5d67e0242..4a84094df 100644
--- a/src/test/kotlin/g2201_2300/s2257_count_unguarded_cells_in_the_grid/SolutionTest.kt
+++ b/src/test/kotlin/g2201_2300/s2257_count_unguarded_cells_in_the_grid/SolutionTest.kt
@@ -13,9 +13,9 @@ internal class SolutionTest {
                     4,
                     6,
                     arrayOf(intArrayOf(0, 0), intArrayOf(1, 1), intArrayOf(2, 3)),
-                    arrayOf(intArrayOf(0, 1), intArrayOf(2, 2), intArrayOf(1, 4))
+                    arrayOf(intArrayOf(0, 1), intArrayOf(2, 2), intArrayOf(1, 4)),
                 ),
-            equalTo(7)
+            equalTo(7),
         )
     }
 
@@ -27,9 +27,9 @@ internal class SolutionTest {
                     3,
                     3,
                     arrayOf(intArrayOf(1, 1)),
-                    arrayOf(intArrayOf(0, 1), intArrayOf(1, 0), intArrayOf(2, 1), intArrayOf(1, 2))
+                    arrayOf(intArrayOf(0, 1), intArrayOf(1, 0), intArrayOf(2, 1), intArrayOf(1, 2)),
                 ),
-            equalTo(4)
+            equalTo(4),
         )
     }
 }
diff --git a/src/test/kotlin/g2201_2300/s2258_escape_the_spreading_fire/SolutionTest.kt b/src/test/kotlin/g2201_2300/s2258_escape_the_spreading_fire/SolutionTest.kt
index f4e514aaa..e9f93f03f 100644
--- a/src/test/kotlin/g2201_2300/s2258_escape_the_spreading_fire/SolutionTest.kt
+++ b/src/test/kotlin/g2201_2300/s2258_escape_the_spreading_fire/SolutionTest.kt
@@ -15,10 +15,10 @@ internal class SolutionTest {
                         intArrayOf(0, 0, 0, 2, 2, 1, 0),
                         intArrayOf(0, 2, 0, 0, 1, 2, 0),
                         intArrayOf(0, 0, 2, 2, 2, 0, 2),
-                        intArrayOf(0, 0, 0, 0, 0, 0, 0)
-                    )
+                        intArrayOf(0, 0, 0, 0, 0, 0, 0),
+                    ),
                 ),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
@@ -27,7 +27,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .maximumMinutes(arrayOf(intArrayOf(0, 0, 0, 0), intArrayOf(0, 1, 2, 0), intArrayOf(0, 2, 0, 0))),
-            equalTo(-1)
+            equalTo(-1),
         )
     }
 
@@ -35,7 +35,7 @@ internal class SolutionTest {
     fun maximumMinutes3() {
         assertThat(
             Solution().maximumMinutes(arrayOf(intArrayOf(0, 0, 0), intArrayOf(2, 2, 0), intArrayOf(1, 2, 0))),
-            equalTo(1000000000)
+            equalTo(1000000000),
         )
     }
 }
diff --git a/src/test/kotlin/g2201_2300/s2266_count_number_of_texts/SolutionTest.kt b/src/test/kotlin/g2201_2300/s2266_count_number_of_texts/SolutionTest.kt
index 4cfdb8b96..786840df3 100644
--- a/src/test/kotlin/g2201_2300/s2266_count_number_of_texts/SolutionTest.kt
+++ b/src/test/kotlin/g2201_2300/s2266_count_number_of_texts/SolutionTest.kt
@@ -14,7 +14,7 @@ internal class SolutionTest {
     fun countTexts2() {
         assertThat(
             Solution().countTexts("222222222222222222222222222222222222"),
-            equalTo(82876089)
+            equalTo(82876089),
         )
     }
 }
diff --git a/src/test/kotlin/g2201_2300/s2267_check_if_there_is_a_valid_parentheses_string_path/SolutionTest.kt b/src/test/kotlin/g2201_2300/s2267_check_if_there_is_a_valid_parentheses_string_path/SolutionTest.kt
index ed8cb2e07..d9eb3e608 100644
--- a/src/test/kotlin/g2201_2300/s2267_check_if_there_is_a_valid_parentheses_string_path/SolutionTest.kt
+++ b/src/test/kotlin/g2201_2300/s2267_check_if_there_is_a_valid_parentheses_string_path/SolutionTest.kt
@@ -14,17 +14,18 @@ internal class SolutionTest {
                         charArrayOf('(', '(', '('),
                         charArrayOf(')', '(', ')'),
                         charArrayOf('(', '(', ')'),
-                        charArrayOf('(', '(', ')')
-                    )
+                        charArrayOf('(', '(', ')'),
+                    ),
                 ),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
     @Test
     fun hasValidPath2() {
         assertThat(
-            Solution().hasValidPath(arrayOf(charArrayOf(')', ')'), charArrayOf('(', '('))), equalTo(false)
+            Solution().hasValidPath(arrayOf(charArrayOf(')', ')'), charArrayOf('(', '('))),
+            equalTo(false),
         )
     }
 }
diff --git a/src/test/kotlin/g2201_2300/s2271_maximum_white_tiles_covered_by_a_carpet/SolutionTest.kt b/src/test/kotlin/g2201_2300/s2271_maximum_white_tiles_covered_by_a_carpet/SolutionTest.kt
index f77cbdb09..570232982 100644
--- a/src/test/kotlin/g2201_2300/s2271_maximum_white_tiles_covered_by_a_carpet/SolutionTest.kt
+++ b/src/test/kotlin/g2201_2300/s2271_maximum_white_tiles_covered_by_a_carpet/SolutionTest.kt
@@ -15,11 +15,11 @@ internal class SolutionTest {
                         intArrayOf(10, 11),
                         intArrayOf(12, 18),
                         intArrayOf(20, 25),
-                        intArrayOf(30, 32)
+                        intArrayOf(30, 32),
                     ),
-                    10
+                    10,
                 ),
-            equalTo(9)
+            equalTo(9),
         )
     }
 
@@ -27,7 +27,7 @@ internal class SolutionTest {
     fun maximumWhiteTiles2() {
         assertThat(
             Solution().maximumWhiteTiles(arrayOf(intArrayOf(10, 11), intArrayOf(1, 1)), 2),
-            equalTo(2)
+            equalTo(2),
         )
     }
 }
diff --git a/src/test/kotlin/g2201_2300/s2273_find_resultant_array_after_removing_anagrams/SolutionTest.kt b/src/test/kotlin/g2201_2300/s2273_find_resultant_array_after_removing_anagrams/SolutionTest.kt
index c688c3466..8e9112415 100644
--- a/src/test/kotlin/g2201_2300/s2273_find_resultant_array_after_removing_anagrams/SolutionTest.kt
+++ b/src/test/kotlin/g2201_2300/s2273_find_resultant_array_after_removing_anagrams/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun removeAnagrams() {
         assertThat(
             Solution().removeAnagrams(arrayOf("abba", "baba", "bbaa", "cd", "cd")),
-            equalTo(mutableListOf("abba", "cd"))
+            equalTo(mutableListOf("abba", "cd")),
         )
     }
 
@@ -17,14 +17,15 @@ internal class SolutionTest {
     fun removeAnagrams2() {
         assertThat(
             Solution().removeAnagrams(arrayOf("a", "b", "c", "d", "e")),
-            equalTo(mutableListOf("a", "b", "c", "d", "e"))
+            equalTo(mutableListOf("a", "b", "c", "d", "e")),
         )
     }
 
     @Test
     fun removeAnagrams3() {
         assertThat(
-            Solution().removeAnagrams(arrayOf()), equalTo(emptyList<Any>())
+            Solution().removeAnagrams(arrayOf()),
+            equalTo(emptyList<Any>()),
         )
     }
 }
diff --git a/src/test/kotlin/g2201_2300/s2275_largest_combination_with_bitwise_and_greater_than_zero/SolutionTest.kt b/src/test/kotlin/g2201_2300/s2275_largest_combination_with_bitwise_and_greater_than_zero/SolutionTest.kt
index fe7a50be1..542948420 100644
--- a/src/test/kotlin/g2201_2300/s2275_largest_combination_with_bitwise_and_greater_than_zero/SolutionTest.kt
+++ b/src/test/kotlin/g2201_2300/s2275_largest_combination_with_bitwise_and_greater_than_zero/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun largestCombination() {
         assertThat(
             Solution().largestCombination(intArrayOf(16, 17, 71, 62, 12, 24, 14)),
-            equalTo(4)
+            equalTo(4),
         )
     }
 
diff --git a/src/test/kotlin/g2201_2300/s2279_maximum_bags_with_full_capacity_of_rocks/SolutionTest.kt b/src/test/kotlin/g2201_2300/s2279_maximum_bags_with_full_capacity_of_rocks/SolutionTest.kt
index be48fa18b..8e40a3134 100644
--- a/src/test/kotlin/g2201_2300/s2279_maximum_bags_with_full_capacity_of_rocks/SolutionTest.kt
+++ b/src/test/kotlin/g2201_2300/s2279_maximum_bags_with_full_capacity_of_rocks/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun maximumBags() {
         assertThat(
             Solution().maximumBags(intArrayOf(2, 3, 4, 5), intArrayOf(1, 2, 4, 4), 2),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun maximumBags2() {
         assertThat(
             Solution().maximumBags(intArrayOf(10, 2, 2), intArrayOf(2, 2, 0), 100),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
@@ -26,10 +26,11 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .maximumBags(
-                    intArrayOf(91, 54, 63, 99, 24, 45, 78), intArrayOf(35, 32, 45, 98, 6, 1, 25),
-                    17
+                    intArrayOf(91, 54, 63, 99, 24, 45, 78),
+                    intArrayOf(35, 32, 45, 98, 6, 1, 25),
+                    17,
                 ),
-            equalTo(1)
+            equalTo(1),
         )
     }
 }
diff --git a/src/test/kotlin/g2201_2300/s2280_minimum_lines_to_represent_a_line_chart/SolutionTest.kt b/src/test/kotlin/g2201_2300/s2280_minimum_lines_to_represent_a_line_chart/SolutionTest.kt
index 3fff11810..50d3299a3 100644
--- a/src/test/kotlin/g2201_2300/s2280_minimum_lines_to_represent_a_line_chart/SolutionTest.kt
+++ b/src/test/kotlin/g2201_2300/s2280_minimum_lines_to_represent_a_line_chart/SolutionTest.kt
@@ -18,10 +18,10 @@ internal class SolutionTest {
                         intArrayOf(5, 4),
                         intArrayOf(6, 3),
                         intArrayOf(7, 2),
-                        intArrayOf(8, 1)
-                    )
+                        intArrayOf(8, 1),
+                    ),
                 ),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
@@ -29,7 +29,7 @@ internal class SolutionTest {
     fun minimumLines2() {
         assertThat(
             Solution().minimumLines(arrayOf(intArrayOf(3, 4), intArrayOf(1, 2), intArrayOf(7, 8), intArrayOf(2, 3))),
-            equalTo(1)
+            equalTo(1),
         )
     }
 
diff --git a/src/test/kotlin/g2201_2300/s2284_sender_with_largest_word_count/SolutionTest.kt b/src/test/kotlin/g2201_2300/s2284_sender_with_largest_word_count/SolutionTest.kt
index 3b8c67e0b..b3388a070 100644
--- a/src/test/kotlin/g2201_2300/s2284_sender_with_largest_word_count/SolutionTest.kt
+++ b/src/test/kotlin/g2201_2300/s2284_sender_with_largest_word_count/SolutionTest.kt
@@ -14,11 +14,11 @@ internal class SolutionTest {
                         "Hello userTwooo",
                         "Hi userThree",
                         "Wonderful day Alice",
-                        "Nice day userThree"
+                        "Nice day userThree",
                     ),
-                    arrayOf("Alice", "userTwo", "userThree", "Alice")
+                    arrayOf("Alice", "userTwo", "userThree", "Alice"),
                 ),
-            equalTo("Alice")
+            equalTo("Alice"),
         )
     }
 
@@ -29,11 +29,11 @@ internal class SolutionTest {
                 .largestWordCount(
                     arrayOf(
                         "How is leetcode for everyone",
-                        "Leetcode is useful for practice"
+                        "Leetcode is useful for practice",
                     ),
-                    arrayOf("Bob", "Charlie")
+                    arrayOf("Bob", "Charlie"),
                 ),
-            equalTo("Charlie")
+            equalTo("Charlie"),
         )
     }
 }
diff --git a/src/test/kotlin/g2201_2300/s2285_maximum_total_importance_of_roads/SolutionTest.kt b/src/test/kotlin/g2201_2300/s2285_maximum_total_importance_of_roads/SolutionTest.kt
index a7ecae260..34a72133b 100644
--- a/src/test/kotlin/g2201_2300/s2285_maximum_total_importance_of_roads/SolutionTest.kt
+++ b/src/test/kotlin/g2201_2300/s2285_maximum_total_importance_of_roads/SolutionTest.kt
@@ -17,10 +17,10 @@ internal class SolutionTest {
                         intArrayOf(2, 3),
                         intArrayOf(0, 2),
                         intArrayOf(1, 3),
-                        intArrayOf(2, 4)
-                    )
+                        intArrayOf(2, 4),
+                    ),
                 ),
-            equalTo(43L)
+            equalTo(43L),
         )
     }
 
@@ -28,7 +28,7 @@ internal class SolutionTest {
     fun maximumImportance2() {
         assertThat(
             Solution().maximumImportance(5, arrayOf(intArrayOf(0, 3), intArrayOf(2, 4), intArrayOf(1, 3))),
-            equalTo(20L)
+            equalTo(20L),
         )
     }
 }
diff --git a/src/test/kotlin/g2201_2300/s2288_apply_discount_to_prices/SolutionTest.kt b/src/test/kotlin/g2201_2300/s2288_apply_discount_to_prices/SolutionTest.kt
index 55932604a..43dde0365 100644
--- a/src/test/kotlin/g2201_2300/s2288_apply_discount_to_prices/SolutionTest.kt
+++ b/src/test/kotlin/g2201_2300/s2288_apply_discount_to_prices/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun discountPrices() {
         assertThat(
             Solution().discountPrices("there are $1 $2 and 5$ candies in the shop", 50),
-            equalTo("there are $0.50 $1.00 and 5$ candies in the shop")
+            equalTo("there are $0.50 $1.00 and 5$ candies in the shop"),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun discountPrices2() {
         assertThat(
             Solution().discountPrices("1 2 $3 4 $5 $6 7 8$ $9 $10$", 100),
-            equalTo("1 2 $0.00 4 $0.00 $0.00 7 8$ $0.00 $10$")
+            equalTo("1 2 $0.00 4 $0.00 $0.00 7 8$ $0.00 $10$"),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun discountPrices3() {
         assertThat(
             Solution().discountPrices("$76111 ab $6 $", 48),
-            equalTo("$39577.72 ab $3.12 $")
+            equalTo("$39577.72 ab $3.12 $"),
         )
     }
 }
diff --git a/src/test/kotlin/g2201_2300/s2289_steps_to_make_array_non_decreasing/SolutionTest.kt b/src/test/kotlin/g2201_2300/s2289_steps_to_make_array_non_decreasing/SolutionTest.kt
index 48889383b..869440139 100644
--- a/src/test/kotlin/g2201_2300/s2289_steps_to_make_array_non_decreasing/SolutionTest.kt
+++ b/src/test/kotlin/g2201_2300/s2289_steps_to_make_array_non_decreasing/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun totalSteps() {
         assertThat(
             Solution().totalSteps(intArrayOf(5, 3, 4, 4, 7, 3, 6, 11, 8, 5, 11)),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
diff --git a/src/test/kotlin/g2201_2300/s2290_minimum_obstacle_removal_to_reach_corner/SolutionTest.kt b/src/test/kotlin/g2201_2300/s2290_minimum_obstacle_removal_to_reach_corner/SolutionTest.kt
index 9f537250d..35c047e43 100644
--- a/src/test/kotlin/g2201_2300/s2290_minimum_obstacle_removal_to_reach_corner/SolutionTest.kt
+++ b/src/test/kotlin/g2201_2300/s2290_minimum_obstacle_removal_to_reach_corner/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun minimumObstacles() {
         assertThat(
             Solution().minimumObstacles(arrayOf(intArrayOf(0, 1, 1), intArrayOf(1, 1, 0), intArrayOf(1, 1, 0))),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -21,10 +21,10 @@ internal class SolutionTest {
                     arrayOf(
                         intArrayOf(0, 1, 0, 0, 0),
                         intArrayOf(0, 1, 0, 1, 0),
-                        intArrayOf(0, 0, 0, 1, 0)
-                    )
+                        intArrayOf(0, 0, 0, 1, 0),
+                    ),
                 ),
-            equalTo(0)
+            equalTo(0),
         )
     }
 
diff --git a/src/test/kotlin/g2201_2300/s2295_replace_elements_in_an_array/SolutionTest.kt b/src/test/kotlin/g2201_2300/s2295_replace_elements_in_an_array/SolutionTest.kt
index f204e26e4..68cf4a1ff 100644
--- a/src/test/kotlin/g2201_2300/s2295_replace_elements_in_an_array/SolutionTest.kt
+++ b/src/test/kotlin/g2201_2300/s2295_replace_elements_in_an_array/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .arrayChange(intArrayOf(1, 2, 4, 6), arrayOf(intArrayOf(1, 3), intArrayOf(4, 7), intArrayOf(6, 1))),
-            equalTo(intArrayOf(3, 2, 7, 1))
+            equalTo(intArrayOf(3, 2, 7, 1)),
         )
     }
 
@@ -18,7 +18,7 @@ internal class SolutionTest {
     fun arrayChange2() {
         assertThat(
             Solution().arrayChange(intArrayOf(1, 2), arrayOf(intArrayOf(1, 3), intArrayOf(2, 1), intArrayOf(3, 2))),
-            equalTo(intArrayOf(2, 1))
+            equalTo(intArrayOf(2, 1)),
         )
     }
 }
diff --git a/src/test/kotlin/g2201_2300/s2299_strong_password_checker_ii/SolutionTest.kt b/src/test/kotlin/g2201_2300/s2299_strong_password_checker_ii/SolutionTest.kt
index c47e01542..a1f38c02f 100644
--- a/src/test/kotlin/g2201_2300/s2299_strong_password_checker_ii/SolutionTest.kt
+++ b/src/test/kotlin/g2201_2300/s2299_strong_password_checker_ii/SolutionTest.kt
@@ -25,9 +25,9 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .strongPasswordCheckerII(
-                    "ecuwcfoyajkolntovfniplayrxhzpmhrkhzonopcwxgupzhoupw"
+                    "ecuwcfoyajkolntovfniplayrxhzpmhrkhzonopcwxgupzhoupw",
                 ),
-            equalTo(false)
+            equalTo(false),
         )
     }
 
diff --git a/src/test/kotlin/g2201_2300/s2300_successful_pairs_of_spells_and_potions/SolutionTest.kt b/src/test/kotlin/g2201_2300/s2300_successful_pairs_of_spells_and_potions/SolutionTest.kt
index 4344d98b1..8dfcdb731 100644
--- a/src/test/kotlin/g2201_2300/s2300_successful_pairs_of_spells_and_potions/SolutionTest.kt
+++ b/src/test/kotlin/g2201_2300/s2300_successful_pairs_of_spells_and_potions/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun successfulPairs() {
         assertThat(
             Solution().successfulPairs(intArrayOf(5, 1, 3), intArrayOf(1, 2, 3, 4, 5), 7),
-            equalTo(intArrayOf(4, 0, 3))
+            equalTo(intArrayOf(4, 0, 3)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun successfulPairs2() {
         assertThat(
             Solution().successfulPairs(intArrayOf(3, 1, 2), intArrayOf(8, 5, 8), 16),
-            equalTo(intArrayOf(2, 0, 2))
+            equalTo(intArrayOf(2, 0, 2)),
         )
     }
 }
diff --git a/src/test/kotlin/g2301_2400/s2301_match_substring_after_replacement/SolutionTest.kt b/src/test/kotlin/g2301_2400/s2301_match_substring_after_replacement/SolutionTest.kt
index d105cbdd1..dc0fd2def 100644
--- a/src/test/kotlin/g2301_2400/s2301_match_substring_after_replacement/SolutionTest.kt
+++ b/src/test/kotlin/g2301_2400/s2301_match_substring_after_replacement/SolutionTest.kt
@@ -11,9 +11,10 @@ internal class SolutionTest {
             Solution()
                 .matchReplacement(
                     "fool3e7bar",
-                    "leet", arrayOf(charArrayOf('e', '3'), charArrayOf('t', '7'), charArrayOf('t', '8'))
+                    "leet",
+                    arrayOf(charArrayOf('e', '3'), charArrayOf('t', '7'), charArrayOf('t', '8')),
                 ),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
@@ -21,7 +22,7 @@ internal class SolutionTest {
     fun matchReplacement2() {
         assertThat(
             Solution().matchReplacement("fooleetbar", "f00l", arrayOf(charArrayOf('o', '0'))),
-            equalTo(false)
+            equalTo(false),
         )
     }
 
@@ -37,10 +38,10 @@ internal class SolutionTest {
                         charArrayOf('t', '7'),
                         charArrayOf('t', '8'),
                         charArrayOf('d', 'b'),
-                        charArrayOf('p', 'b')
-                    )
+                        charArrayOf('p', 'b'),
+                    ),
                 ),
-            equalTo(true)
+            equalTo(true),
         )
     }
 }
diff --git a/src/test/kotlin/g2301_2400/s2303_calculate_amount_paid_in_taxes/SolutionTest.kt b/src/test/kotlin/g2301_2400/s2303_calculate_amount_paid_in_taxes/SolutionTest.kt
index 85897a898..de118e115 100644
--- a/src/test/kotlin/g2301_2400/s2303_calculate_amount_paid_in_taxes/SolutionTest.kt
+++ b/src/test/kotlin/g2301_2400/s2303_calculate_amount_paid_in_taxes/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun calculateTax() {
         assertThat(
             Solution().calculateTax(arrayOf(intArrayOf(3, 50), intArrayOf(7, 10), intArrayOf(12, 25)), 10),
-            equalTo(2.65000)
+            equalTo(2.65000),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun calculateTax2() {
         assertThat(
             Solution().calculateTax(arrayOf(intArrayOf(1, 0), intArrayOf(4, 25), intArrayOf(5, 50)), 2),
-            equalTo(0.25000)
+            equalTo(0.25000),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun calculateTax3() {
         assertThat(
             Solution().calculateTax(arrayOf(intArrayOf(1, 0), intArrayOf(4, 25), intArrayOf(5, 50)), 0),
-            equalTo(0.0)
+            equalTo(0.0),
         )
     }
 }
diff --git a/src/test/kotlin/g2301_2400/s2304_minimum_path_cost_in_a_grid/SolutionTest.kt b/src/test/kotlin/g2301_2400/s2304_minimum_path_cost_in_a_grid/SolutionTest.kt
index 5f0281cc7..c3377ce0a 100644
--- a/src/test/kotlin/g2301_2400/s2304_minimum_path_cost_in_a_grid/SolutionTest.kt
+++ b/src/test/kotlin/g2301_2400/s2304_minimum_path_cost_in_a_grid/SolutionTest.kt
@@ -17,10 +17,10 @@ internal class SolutionTest {
                         intArrayOf(10, 12),
                         intArrayOf(18, 6),
                         intArrayOf(2, 4),
-                        intArrayOf(14, 3)
-                    )
+                        intArrayOf(14, 3),
+                    ),
                 ),
-            equalTo(17)
+            equalTo(17),
         )
     }
 
@@ -36,10 +36,10 @@ internal class SolutionTest {
                         intArrayOf(21, 7, 1),
                         intArrayOf(8, 1, 13),
                         intArrayOf(9, 10, 25),
-                        intArrayOf(5, 3, 2)
-                    )
+                        intArrayOf(5, 3, 2),
+                    ),
                 ),
-            equalTo(6)
+            equalTo(6),
         )
     }
 }
diff --git a/src/test/kotlin/g2301_2400/s2305_fair_distribution_of_cookies/SolutionTest.kt b/src/test/kotlin/g2301_2400/s2305_fair_distribution_of_cookies/SolutionTest.kt
index 14e3ffea2..f6a914f88 100644
--- a/src/test/kotlin/g2301_2400/s2305_fair_distribution_of_cookies/SolutionTest.kt
+++ b/src/test/kotlin/g2301_2400/s2305_fair_distribution_of_cookies/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun distributeCookies() {
         assertThat(
             Solution().distributeCookies(intArrayOf(8, 15, 10, 20, 8), 2),
-            equalTo(31)
+            equalTo(31),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun distributeCookies2() {
         assertThat(
             Solution().distributeCookies(intArrayOf(6, 1, 3, 2, 2, 4, 1, 2), 3),
-            equalTo(7)
+            equalTo(7),
         )
     }
 }
diff --git a/src/test/kotlin/g2301_2400/s2306_naming_a_company/SolutionTest.kt b/src/test/kotlin/g2301_2400/s2306_naming_a_company/SolutionTest.kt
index b885bde52..0a945e214 100644
--- a/src/test/kotlin/g2301_2400/s2306_naming_a_company/SolutionTest.kt
+++ b/src/test/kotlin/g2301_2400/s2306_naming_a_company/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun distinctNames() {
         assertThat(
             Solution().distinctNames(arrayOf("coffee", "donuts", "time", "toffee")),
-            equalTo(6L)
+            equalTo(6L),
         )
     }
 
diff --git a/src/test/kotlin/g2301_2400/s2309_greatest_english_letter_in_upper_and_lower_case/SolutionTest.kt b/src/test/kotlin/g2301_2400/s2309_greatest_english_letter_in_upper_and_lower_case/SolutionTest.kt
index 8b77b74b8..e920bece1 100644
--- a/src/test/kotlin/g2301_2400/s2309_greatest_english_letter_in_upper_and_lower_case/SolutionTest.kt
+++ b/src/test/kotlin/g2301_2400/s2309_greatest_english_letter_in_upper_and_lower_case/SolutionTest.kt
@@ -24,7 +24,7 @@ internal class SolutionTest {
     @Test
     fun greatestLetter4() {
         Assertions.assertThrows(
-            ArrayIndexOutOfBoundsException::class.java
+            ArrayIndexOutOfBoundsException::class.java,
         ) { Solution().greatestLetter("0|") }
     }
 }
diff --git a/src/test/kotlin/g2301_2400/s2312_selling_pieces_of_wood/SolutionTest.kt b/src/test/kotlin/g2301_2400/s2312_selling_pieces_of_wood/SolutionTest.kt
index 231c9721a..2210d669b 100644
--- a/src/test/kotlin/g2301_2400/s2312_selling_pieces_of_wood/SolutionTest.kt
+++ b/src/test/kotlin/g2301_2400/s2312_selling_pieces_of_wood/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun sellingWood() {
         assertThat(
             Solution().sellingWood(3, 5, arrayOf(intArrayOf(1, 4, 2), intArrayOf(2, 2, 7), intArrayOf(2, 1, 3))),
-            equalTo(19L)
+            equalTo(19L),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun sellingWood2() {
         assertThat(
             Solution().sellingWood(4, 6, arrayOf(intArrayOf(3, 2, 10), intArrayOf(1, 4, 2), intArrayOf(4, 1, 3))),
-            equalTo(32L)
+            equalTo(32L),
         )
     }
 }
diff --git a/src/test/kotlin/g2301_2400/s2316_count_unreachable_pairs_of_nodes_in_an_undirected_graph/SolutionTest.kt b/src/test/kotlin/g2301_2400/s2316_count_unreachable_pairs_of_nodes_in_an_undirected_graph/SolutionTest.kt
index b617bc8d7..da5578a85 100644
--- a/src/test/kotlin/g2301_2400/s2316_count_unreachable_pairs_of_nodes_in_an_undirected_graph/SolutionTest.kt
+++ b/src/test/kotlin/g2301_2400/s2316_count_unreachable_pairs_of_nodes_in_an_undirected_graph/SolutionTest.kt
@@ -10,9 +10,9 @@ internal class SolutionTest {
         assertThat(
             Solution().countPairs(
                 3,
-                arrayOf(intArrayOf(0, 1), intArrayOf(0, 2), intArrayOf(1, 2))
+                arrayOf(intArrayOf(0, 1), intArrayOf(0, 2), intArrayOf(1, 2)),
             ),
-            equalTo(0L)
+            equalTo(0L),
         )
     }
 
@@ -21,9 +21,9 @@ internal class SolutionTest {
         assertThat(
             Solution().countPairs(
                 7,
-                arrayOf(intArrayOf(0, 2), intArrayOf(0, 5), intArrayOf(2, 4), intArrayOf(1, 6), intArrayOf(5, 4))
+                arrayOf(intArrayOf(0, 2), intArrayOf(0, 5), intArrayOf(2, 4), intArrayOf(1, 6), intArrayOf(5, 4)),
             ),
-            equalTo(14L)
+            equalTo(14L),
         )
     }
 }
diff --git a/src/test/kotlin/g2301_2400/s2319_check_if_matrix_is_x_matrix/SolutionTest.kt b/src/test/kotlin/g2301_2400/s2319_check_if_matrix_is_x_matrix/SolutionTest.kt
index 37390f9f5..73059cccf 100644
--- a/src/test/kotlin/g2301_2400/s2319_check_if_matrix_is_x_matrix/SolutionTest.kt
+++ b/src/test/kotlin/g2301_2400/s2319_check_if_matrix_is_x_matrix/SolutionTest.kt
@@ -14,10 +14,10 @@ internal class SolutionTest {
                         intArrayOf(2, 0, 0, 1),
                         intArrayOf(0, 3, 1, 0),
                         intArrayOf(0, 5, 2, 0),
-                        intArrayOf(4, 0, 0, 2)
-                    )
+                        intArrayOf(4, 0, 0, 2),
+                    ),
                 ),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun checkXMatrix2() {
         assertThat(
             Solution().checkXMatrix(arrayOf(intArrayOf(5, 7, 0), intArrayOf(0, 3, 1), intArrayOf(0, 5, 0))),
-            equalTo(false)
+            equalTo(false),
         )
     }
 
@@ -39,10 +39,10 @@ internal class SolutionTest {
                         intArrayOf(0, 4, 0, 1, 0),
                         intArrayOf(0, 0, 5, 0, 0),
                         intArrayOf(0, 5, 0, 2, 0),
-                        intArrayOf(4, 0, 0, 0, 2)
-                    )
+                        intArrayOf(4, 0, 0, 0, 2),
+                    ),
                 ),
-            equalTo(false)
+            equalTo(false),
         )
     }
 }
diff --git a/src/test/kotlin/g2301_2400/s2321_maximum_score_of_spliced_array/SolutionTest.kt b/src/test/kotlin/g2301_2400/s2321_maximum_score_of_spliced_array/SolutionTest.kt
index 00d24e6fb..25f0a66dc 100644
--- a/src/test/kotlin/g2301_2400/s2321_maximum_score_of_spliced_array/SolutionTest.kt
+++ b/src/test/kotlin/g2301_2400/s2321_maximum_score_of_spliced_array/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun maximumsSplicedArray() {
         assertThat(
             Solution().maximumsSplicedArray(intArrayOf(60, 60, 60), intArrayOf(10, 90, 10)),
-            equalTo(210)
+            equalTo(210),
         )
     }
 
@@ -18,7 +18,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .maximumsSplicedArray(intArrayOf(20, 40, 20, 70, 30), intArrayOf(50, 20, 50, 40, 20)),
-            equalTo(220)
+            equalTo(220),
         )
     }
 
@@ -26,7 +26,7 @@ internal class SolutionTest {
     fun maximumsSplicedArray3() {
         assertThat(
             Solution().maximumsSplicedArray(intArrayOf(7, 11, 13), intArrayOf(1, 1, 1)),
-            equalTo(31)
+            equalTo(31),
         )
     }
 
@@ -34,7 +34,7 @@ internal class SolutionTest {
     fun maximumsSplicedArray4() {
         assertThat(
             Solution().maximumsSplicedArray(intArrayOf(1, 1, 1), intArrayOf(7, 11, 13)),
-            equalTo(31)
+            equalTo(31),
         )
     }
 }
diff --git a/src/test/kotlin/g2301_2400/s2322_minimum_score_after_removals_on_a_tree/SolutionTest.kt b/src/test/kotlin/g2301_2400/s2322_minimum_score_after_removals_on_a_tree/SolutionTest.kt
index bb8d5ba6f..9125ae06a 100644
--- a/src/test/kotlin/g2301_2400/s2322_minimum_score_after_removals_on_a_tree/SolutionTest.kt
+++ b/src/test/kotlin/g2301_2400/s2322_minimum_score_after_removals_on_a_tree/SolutionTest.kt
@@ -11,9 +11,9 @@ internal class SolutionTest {
             Solution()
                 .minimumScore(
                     intArrayOf(1, 5, 5, 4, 11),
-                    arrayOf(intArrayOf(0, 1), intArrayOf(1, 2), intArrayOf(1, 3), intArrayOf(3, 4))
+                    arrayOf(intArrayOf(0, 1), intArrayOf(1, 2), intArrayOf(1, 3), intArrayOf(3, 4)),
                 ),
-            equalTo(9)
+            equalTo(9),
         )
     }
 
@@ -23,9 +23,9 @@ internal class SolutionTest {
             Solution()
                 .minimumScore(
                     intArrayOf(5, 5, 2, 4, 4, 2),
-                    arrayOf(intArrayOf(0, 1), intArrayOf(1, 2), intArrayOf(5, 2), intArrayOf(4, 3), intArrayOf(1, 3))
+                    arrayOf(intArrayOf(0, 1), intArrayOf(1, 2), intArrayOf(5, 2), intArrayOf(4, 3), intArrayOf(1, 3)),
                 ),
-            equalTo(0)
+            equalTo(0),
         )
     }
 }
diff --git a/src/test/kotlin/g2301_2400/s2325_decode_the_message/SolutionTest.kt b/src/test/kotlin/g2301_2400/s2325_decode_the_message/SolutionTest.kt
index 9933bf820..6b4b59eaf 100644
--- a/src/test/kotlin/g2301_2400/s2325_decode_the_message/SolutionTest.kt
+++ b/src/test/kotlin/g2301_2400/s2325_decode_the_message/SolutionTest.kt
@@ -10,9 +10,10 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .decodeMessage(
-                    "the quick brown fox jumps over the lazy dog", "vkbs bs t suepuv"
+                    "the quick brown fox jumps over the lazy dog",
+                    "vkbs bs t suepuv",
                 ),
-            equalTo("this is a secret")
+            equalTo("this is a secret"),
         )
     }
 
@@ -22,9 +23,9 @@ internal class SolutionTest {
             Solution()
                 .decodeMessage(
                     "eljuxhpwnyrdgtqkviszcfmabo",
-                    "zwx hnfx lqantp mnoeius ycgk vcnjrdb"
+                    "zwx hnfx lqantp mnoeius ycgk vcnjrdb",
                 ),
-            equalTo("the five boxing wizards jump quickly")
+            equalTo("the five boxing wizards jump quickly"),
         )
     }
 }
diff --git a/src/test/kotlin/g2301_2400/s2326_spiral_matrix_iv/SolutionTest.kt b/src/test/kotlin/g2301_2400/s2326_spiral_matrix_iv/SolutionTest.kt
index 20edfc5bc..4d97a4578 100644
--- a/src/test/kotlin/g2301_2400/s2326_spiral_matrix_iv/SolutionTest.kt
+++ b/src/test/kotlin/g2301_2400/s2326_spiral_matrix_iv/SolutionTest.kt
@@ -15,9 +15,9 @@ internal class SolutionTest {
                 arrayOf(
                     intArrayOf(3, 0, 2, 6, 8),
                     intArrayOf(5, 0, -1, -1, 1),
-                    intArrayOf(5, 2, 4, 9, 7)
-                )
-            )
+                    intArrayOf(5, 2, 4, 9, 7),
+                ),
+            ),
         )
     }
 
@@ -25,7 +25,8 @@ internal class SolutionTest {
     fun spiralMatrix2() {
         val listNode = contructLinkedList(intArrayOf(0, 1, 2))
         assertThat(
-            Solution().spiralMatrix(1, 4, listNode), equalTo(arrayOf(intArrayOf(0, 1, 2, -1)))
+            Solution().spiralMatrix(1, 4, listNode),
+            equalTo(arrayOf(intArrayOf(0, 1, 2, -1))),
         )
     }
 }
diff --git a/src/test/kotlin/g2301_2400/s2328_number_of_increasing_paths_in_a_grid/SolutionTest.kt b/src/test/kotlin/g2301_2400/s2328_number_of_increasing_paths_in_a_grid/SolutionTest.kt
index d90f9b306..0473deb14 100644
--- a/src/test/kotlin/g2301_2400/s2328_number_of_increasing_paths_in_a_grid/SolutionTest.kt
+++ b/src/test/kotlin/g2301_2400/s2328_number_of_increasing_paths_in_a_grid/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun countPaths() {
         assertThat(
             Solution().countPaths(arrayOf(intArrayOf(1, 1), intArrayOf(3, 4))),
-            equalTo(8)
+            equalTo(8),
         )
     }
 
@@ -26,47 +26,47 @@ internal class SolutionTest {
                     arrayOf(
                         intArrayOf(
                             73884, 15322, 92124, 16515, 54702, 88526, 61879, 14125,
-                            21161, 42701, 35686, 75932, 8696
+                            21161, 42701, 35686, 75932, 8696,
                         ),
                         intArrayOf(
                             59537, 80396, 65708, 32310, 46753, 39759, 4746, 71413,
-                            84723, 13233, 23640, 62230, 11825
+                            84723, 13233, 23640, 62230, 11825,
                         ),
                         intArrayOf(
                             6414, 96122, 64501, 32523, 55259, 2935, 44772, 48912, 26516,
-                            56256, 69201, 21079, 52979
+                            56256, 69201, 21079, 52979,
                         ),
                         intArrayOf(
                             50951, 1748, 42645, 73435, 81511, 21445, 26066, 27605,
-                            40388, 43702, 47233, 15333, 86291
+                            40388, 43702, 47233, 15333, 86291,
                         ),
                         intArrayOf(
                             87914, 90237, 95947, 97341, 93670, 79822, 32591, 44096,
-                            55112, 89104, 36097, 82759, 15504
+                            55112, 89104, 36097, 82759, 15504,
                         ),
                         intArrayOf(
                             3604, 74013, 74414, 68295, 58798, 7050, 71657, 33463, 38040,
-                            46180, 61730, 82754, 57179
+                            46180, 61730, 82754, 57179,
                         ),
                         intArrayOf(
                             86867, 1972, 13704, 11581, 99042, 24825, 77747, 38671,
-                            40628, 38626, 54719, 7366, 36309
+                            40628, 38626, 54719, 7366, 36309,
                         ),
                         intArrayOf(
                             69272, 98273, 16474, 15204, 40263, 99956, 36072, 68173,
-                            77076, 18094, 97439, 61968, 7435
+                            77076, 18094, 97439, 61968, 7435,
                         ),
                         intArrayOf(
                             95263, 39616, 37983, 61376, 256, 7169, 45149, 94957, 66151,
-                            13256, 37776, 25331, 29659
+                            13256, 37776, 25331, 29659,
                         ),
                         intArrayOf(
                             90001, 12571, 31093, 46714, 52347, 44882, 76055, 53662,
-                            69928, 37486, 44020, 2211, 67466
-                        )
-                    )
+                            69928, 37486, 44020, 2211, 67466,
+                        ),
+                    ),
                 ),
-            equalTo(925)
+            equalTo(925),
         )
     }
 
@@ -83,11 +83,11 @@ internal class SolutionTest {
                             31759, 78612, 19776, 43160, 86915, 74498, 38366, 28228,
                             23687, 40729, 42613, 61154, 22726, 51028, 45603, 53586,
                             44657, 97573, 61067, 27187, 4619, 6135, 24668, 69634, 24564,
-                            30255, 51939, 67573, 87012, 4106, 76312, 28737, 7704, 35798
-                        )
-                    )
+                            30255, 51939, 67573, 87012, 4106, 76312, 28737, 7704, 35798,
+                        ),
+                    ),
                 ),
-            equalTo(148)
+            equalTo(148),
         )
     }
 }
diff --git a/src/test/kotlin/g2301_2400/s2331_evaluate_boolean_binary_tree/SolutionTest.kt b/src/test/kotlin/g2301_2400/s2331_evaluate_boolean_binary_tree/SolutionTest.kt
index b4a9d85e9..a846bbd7e 100644
--- a/src/test/kotlin/g2301_2400/s2331_evaluate_boolean_binary_tree/SolutionTest.kt
+++ b/src/test/kotlin/g2301_2400/s2331_evaluate_boolean_binary_tree/SolutionTest.kt
@@ -11,7 +11,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .evaluateTree(TreeNode.create(listOf(2, 1, 3, null, null, 0, 1))),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
@@ -19,7 +19,7 @@ internal class SolutionTest {
     fun evaluateTree2() {
         assertThat(
             Solution().evaluateTree(TreeNode.create(listOf(0))),
-            equalTo(false)
+            equalTo(false),
         )
     }
 
@@ -36,11 +36,11 @@ internal class SolutionTest {
                             1, 0, 3, null, null, null, null, null, null, null,
                             null, null, null, 3, 0, 3, 3, null, null, 0, 0, 1,
                             0, null, null, null, null, null, null, null,
-                            null
-                        )
-                    )
+                            null,
+                        ),
+                    ),
                 ),
-            equalTo(true)
+            equalTo(true),
         )
     }
 }
diff --git a/src/test/kotlin/g2301_2400/s2332_the_latest_time_to_catch_a_bus/SolutionTest.kt b/src/test/kotlin/g2301_2400/s2332_the_latest_time_to_catch_a_bus/SolutionTest.kt
index ffcaf8149..80a0d1f29 100644
--- a/src/test/kotlin/g2301_2400/s2332_the_latest_time_to_catch_a_bus/SolutionTest.kt
+++ b/src/test/kotlin/g2301_2400/s2332_the_latest_time_to_catch_a_bus/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .latestTimeCatchTheBus(intArrayOf(10, 20), intArrayOf(2, 17, 18, 19), 2),
-            equalTo(16)
+            equalTo(16),
         )
     }
 
@@ -19,7 +19,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .latestTimeCatchTheBus(intArrayOf(20, 30, 10), intArrayOf(19, 13, 26, 4, 25, 11, 21), 2),
-            equalTo(20)
+            equalTo(20),
         )
     }
 
@@ -27,7 +27,7 @@ internal class SolutionTest {
     fun latestTimeCatchTheBus3() {
         assertThat(
             Solution().latestTimeCatchTheBus(intArrayOf(3), intArrayOf(2, 4), 2),
-            equalTo(3)
+            equalTo(3),
         )
     }
 }
diff --git a/src/test/kotlin/g2301_2400/s2333_minimum_sum_of_squared_difference/SolutionTest.kt b/src/test/kotlin/g2301_2400/s2333_minimum_sum_of_squared_difference/SolutionTest.kt
index fcae13846..fd3d696d7 100644
--- a/src/test/kotlin/g2301_2400/s2333_minimum_sum_of_squared_difference/SolutionTest.kt
+++ b/src/test/kotlin/g2301_2400/s2333_minimum_sum_of_squared_difference/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .minSumSquareDiff(intArrayOf(1, 2, 3, 4), intArrayOf(2, 10, 20, 19), 0, 0),
-            equalTo(579L)
+            equalTo(579L),
         )
     }
 
@@ -19,7 +19,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .minSumSquareDiff(intArrayOf(1, 4, 10, 12), intArrayOf(5, 8, 6, 9), 1, 1),
-            equalTo(43L)
+            equalTo(43L),
         )
     }
 
@@ -28,11 +28,12 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .minSumSquareDiff(
-                    intArrayOf(7, 11, 4, 19, 11, 5, 6, 1, 8), intArrayOf(4, 7, 6, 16, 12, 9, 10, 2, 10),
+                    intArrayOf(7, 11, 4, 19, 11, 5, 6, 1, 8),
+                    intArrayOf(4, 7, 6, 16, 12, 9, 10, 2, 10),
                     3,
-                    6
+                    6,
                 ),
-            equalTo(27L)
+            equalTo(27L),
         )
     }
 }
diff --git a/src/test/kotlin/g2301_2400/s2334_subarray_with_elements_greater_than_varying_threshold/SolutionTest.kt b/src/test/kotlin/g2301_2400/s2334_subarray_with_elements_greater_than_varying_threshold/SolutionTest.kt
index c40253590..eb9225031 100644
--- a/src/test/kotlin/g2301_2400/s2334_subarray_with_elements_greater_than_varying_threshold/SolutionTest.kt
+++ b/src/test/kotlin/g2301_2400/s2334_subarray_with_elements_greater_than_varying_threshold/SolutionTest.kt
@@ -22,11 +22,11 @@ internal class SolutionTest {
                 .validSubarraySize(
                     intArrayOf(
                         818, 232, 595, 418, 608, 229, 37, 330, 876, 774, 931, 939, 479,
-                        884, 354, 328
+                        884, 354, 328,
                     ),
-                    3790
+                    3790,
                 ),
-            equalTo(-1)
+            equalTo(-1),
         )
     }
 }
diff --git a/src/test/kotlin/g2301_2400/s2341_maximum_number_of_pairs_in_array/SolutionTest.kt b/src/test/kotlin/g2301_2400/s2341_maximum_number_of_pairs_in_array/SolutionTest.kt
index 94ebe2292..02cfa6c09 100644
--- a/src/test/kotlin/g2301_2400/s2341_maximum_number_of_pairs_in_array/SolutionTest.kt
+++ b/src/test/kotlin/g2301_2400/s2341_maximum_number_of_pairs_in_array/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun numberOfPairs() {
         assertThat(
             Solution().numberOfPairs(intArrayOf(1, 3, 2, 1, 3, 2, 2)),
-            equalTo(intArrayOf(3, 1))
+            equalTo(intArrayOf(3, 1)),
         )
     }
 
diff --git a/src/test/kotlin/g2301_2400/s2343_query_kth_smallest_trimmed_number/SolutionTest.kt b/src/test/kotlin/g2301_2400/s2343_query_kth_smallest_trimmed_number/SolutionTest.kt
index cac251fd5..c98082ca6 100644
--- a/src/test/kotlin/g2301_2400/s2343_query_kth_smallest_trimmed_number/SolutionTest.kt
+++ b/src/test/kotlin/g2301_2400/s2343_query_kth_smallest_trimmed_number/SolutionTest.kt
@@ -11,9 +11,9 @@ internal class SolutionTest {
             Solution()
                 .smallestTrimmedNumbers(
                     arrayOf("102", "473", "251", "814"),
-                    arrayOf(intArrayOf(1, 1), intArrayOf(2, 3), intArrayOf(4, 2), intArrayOf(1, 2))
+                    arrayOf(intArrayOf(1, 1), intArrayOf(2, 3), intArrayOf(4, 2), intArrayOf(1, 2)),
                 ),
-            equalTo(intArrayOf(2, 2, 1, 0))
+            equalTo(intArrayOf(2, 2, 1, 0)),
         )
     }
 
@@ -22,7 +22,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .smallestTrimmedNumbers(arrayOf("24", "37", "96", "04"), arrayOf(intArrayOf(2, 1), intArrayOf(2, 2))),
-            equalTo(intArrayOf(3, 0))
+            equalTo(intArrayOf(3, 0)),
         )
     }
 }
diff --git a/src/test/kotlin/g2301_2400/s2344_minimum_deletions_to_make_array_divisible/SolutionTest.kt b/src/test/kotlin/g2301_2400/s2344_minimum_deletions_to_make_array_divisible/SolutionTest.kt
index 98d9c78ed..22dae0e1d 100644
--- a/src/test/kotlin/g2301_2400/s2344_minimum_deletions_to_make_array_divisible/SolutionTest.kt
+++ b/src/test/kotlin/g2301_2400/s2344_minimum_deletions_to_make_array_divisible/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun minOperations() {
         assertThat(
             Solution().minOperations(intArrayOf(2, 3, 2, 4, 3), intArrayOf(9, 6, 9, 3, 15)),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun minOperations2() {
         assertThat(
             Solution().minOperations(intArrayOf(4, 3, 6), intArrayOf(8, 2, 6, 10)),
-            equalTo(-1)
+            equalTo(-1),
         )
     }
 }
diff --git a/src/test/kotlin/g2301_2400/s2347_best_poker_hand/SolutionTest.kt b/src/test/kotlin/g2301_2400/s2347_best_poker_hand/SolutionTest.kt
index edd75bbe8..0d82cf198 100644
--- a/src/test/kotlin/g2301_2400/s2347_best_poker_hand/SolutionTest.kt
+++ b/src/test/kotlin/g2301_2400/s2347_best_poker_hand/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .bestHand(intArrayOf(13, 2, 3, 1, 9), charArrayOf('a', 'a', 'a', 'a', 'a')),
-            equalTo("Flush")
+            equalTo("Flush"),
         )
     }
 
@@ -19,7 +19,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .bestHand(intArrayOf(4, 4, 2, 4, 4), charArrayOf('d', 'a', 'a', 'b', 'c')),
-            equalTo("Three of a Kind")
+            equalTo("Three of a Kind"),
         )
     }
 
@@ -28,7 +28,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .bestHand(intArrayOf(10, 10, 2, 12, 9), charArrayOf('a', 'b', 'c', 'a', 'd')),
-            equalTo("Pair")
+            equalTo("Pair"),
         )
     }
 
@@ -37,7 +37,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .bestHand(intArrayOf(13, 12, 3, 4, 7), charArrayOf('a', 'd', 'c', 'b', 'c')),
-            equalTo("High Card")
+            equalTo("High Card"),
         )
     }
 }
diff --git a/src/test/kotlin/g2301_2400/s2348_number_of_zero_filled_subarrays/SolutionTest.kt b/src/test/kotlin/g2301_2400/s2348_number_of_zero_filled_subarrays/SolutionTest.kt
index dfa496e8a..ca90082e3 100644
--- a/src/test/kotlin/g2301_2400/s2348_number_of_zero_filled_subarrays/SolutionTest.kt
+++ b/src/test/kotlin/g2301_2400/s2348_number_of_zero_filled_subarrays/SolutionTest.kt
@@ -8,7 +8,8 @@ internal class SolutionTest {
     @Test
     fun zeroFilledSubarray() {
         assertThat(
-            Solution().zeroFilledSubarray(intArrayOf(1, 3, 0, 0, 2, 0, 0, 4)), equalTo(6L)
+            Solution().zeroFilledSubarray(intArrayOf(1, 3, 0, 0, 2, 0, 0, 4)),
+            equalTo(6L),
         )
     }
 
diff --git a/src/test/kotlin/g2301_2400/s2350_shortest_impossible_sequence_of_rolls/SolutionTest.kt b/src/test/kotlin/g2301_2400/s2350_shortest_impossible_sequence_of_rolls/SolutionTest.kt
index 4f15b32d0..b676b44cf 100644
--- a/src/test/kotlin/g2301_2400/s2350_shortest_impossible_sequence_of_rolls/SolutionTest.kt
+++ b/src/test/kotlin/g2301_2400/s2350_shortest_impossible_sequence_of_rolls/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun shortestSequence() {
         assertThat(
             Solution().shortestSequence(intArrayOf(4, 2, 1, 2, 3, 3, 2, 4, 1), 4),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
@@ -21,7 +21,8 @@ internal class SolutionTest {
     @Test
     fun shortestSequence3() {
         assertThat(
-            Solution().shortestSequence(intArrayOf(1, 1, 3, 2, 2, 2, 3, 3), 4), equalTo(1)
+            Solution().shortestSequence(intArrayOf(1, 1, 3, 2, 2, 2, 3, 3), 4),
+            equalTo(1),
         )
     }
 }
diff --git a/src/test/kotlin/g2301_2400/s2352_equal_row_and_column_pairs/SolutionTest.kt b/src/test/kotlin/g2301_2400/s2352_equal_row_and_column_pairs/SolutionTest.kt
index 8d21a0599..dc4c7e1b9 100644
--- a/src/test/kotlin/g2301_2400/s2352_equal_row_and_column_pairs/SolutionTest.kt
+++ b/src/test/kotlin/g2301_2400/s2352_equal_row_and_column_pairs/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun equalPairs() {
         assertThat(
             Solution().equalPairs(arrayOf(intArrayOf(3, 2, 1), intArrayOf(1, 7, 6), intArrayOf(2, 7, 7))),
-            equalTo(1)
+            equalTo(1),
         )
     }
 
@@ -22,10 +22,10 @@ internal class SolutionTest {
                         intArrayOf(3, 1, 2, 2),
                         intArrayOf(1, 4, 4, 5),
                         intArrayOf(2, 4, 2, 2),
-                        intArrayOf(2, 4, 2, 2)
-                    )
+                        intArrayOf(2, 4, 2, 2),
+                    ),
                 ),
-            equalTo(3)
+            equalTo(3),
         )
     }
 }
diff --git a/src/test/kotlin/g2301_2400/s2353_design_a_food_rating_system/FoodRatingsTest.kt b/src/test/kotlin/g2301_2400/s2353_design_a_food_rating_system/FoodRatingsTest.kt
index b59db8a29..8ea94baea 100644
--- a/src/test/kotlin/g2301_2400/s2353_design_a_food_rating_system/FoodRatingsTest.kt
+++ b/src/test/kotlin/g2301_2400/s2353_design_a_food_rating_system/FoodRatingsTest.kt
@@ -10,9 +10,14 @@ internal class FoodRatingsTest {
         val foodRatings = FoodRatings(
             arrayOf("kimchi", "miso", "sushi", "moussaka", "ramen", "bulgogi"),
             arrayOf(
-                "korean", "japanese", "japanese", "greek", "japanese", "korean"
+                "korean",
+                "japanese",
+                "japanese",
+                "greek",
+                "japanese",
+                "korean",
             ),
-            intArrayOf(9, 12, 8, 15, 14, 7)
+            intArrayOf(9, 12, 8, 15, 14, 7),
         )
         // return "kimchi"
         assertThat(foodRatings.highestRated("korean"), equalTo("kimchi"))
diff --git a/src/test/kotlin/g2301_2400/s2356_number_of_unique_subjects_taught_by_each_teacher/MysqlTest.kt b/src/test/kotlin/g2301_2400/s2356_number_of_unique_subjects_taught_by_each_teacher/MysqlTest.kt
index 1f82b92cd..9d0b36bd6 100644
--- a/src/test/kotlin/g2301_2400/s2356_number_of_unique_subjects_taught_by_each_teacher/MysqlTest.kt
+++ b/src/test/kotlin/g2301_2400/s2356_number_of_unique_subjects_taught_by_each_teacher/MysqlTest.kt
@@ -31,8 +31,8 @@ import javax.sql.DataSource
             "INSERT INTO Teacher(teacher_id, subject_id, dept_id)" +
             " VALUES (2, 3, 1); " +
             "INSERT INTO Teacher(teacher_id, subject_id, dept_id)" +
-            " VALUES (2, 4, 1); "
-    ]
+            " VALUES (2, 4, 1); ",
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -44,12 +44,12 @@ internal class MysqlTest {
                     BufferedReader(
                         FileReader(
                             "src/main/kotlin/g2301_2400/" +
-                                "s2356_number_of_unique_subjects_taught_by_each_teacher/script.sql"
-                        )
+                                "s2356_number_of_unique_subjects_taught_by_each_teacher/script.sql",
+                        ),
                     )
                         .lines()
                         .collect(Collectors.joining("\n"))
-                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace("#.*?\\r?\\n".toRegex(), ""),
                 ).use { resultSet ->
                     assertThat(resultSet.next(), equalTo(true))
                     assertThat(resultSet.getInt(1), equalTo(1))
diff --git a/src/test/kotlin/g2301_2400/s2363_merge_similar_items/SolutionTest.kt b/src/test/kotlin/g2301_2400/s2363_merge_similar_items/SolutionTest.kt
index caaa17072..d4368f67c 100644
--- a/src/test/kotlin/g2301_2400/s2363_merge_similar_items/SolutionTest.kt
+++ b/src/test/kotlin/g2301_2400/s2363_merge_similar_items/SolutionTest.kt
@@ -11,14 +11,15 @@ internal class SolutionTest {
             Solution()
                 .mergeSimilarItems(
                     arrayOf(intArrayOf(1, 1), intArrayOf(4, 5), intArrayOf(3, 8)),
-                    arrayOf(intArrayOf(3, 1), intArrayOf(1, 5))
+                    arrayOf(intArrayOf(3, 1), intArrayOf(1, 5)),
                 ),
             equalTo(
                 listOf(
-                    mutableListOf(1, 6), mutableListOf(3, 9),
-                    mutableListOf(4, 5)
-                )
-            )
+                    mutableListOf(1, 6),
+                    mutableListOf(3, 9),
+                    mutableListOf(4, 5),
+                ),
+            ),
         )
     }
 
@@ -28,14 +29,15 @@ internal class SolutionTest {
             Solution()
                 .mergeSimilarItems(
                     arrayOf(intArrayOf(1, 1), intArrayOf(3, 2), intArrayOf(2, 3)),
-                    arrayOf(intArrayOf(2, 1), intArrayOf(3, 2), intArrayOf(1, 3))
+                    arrayOf(intArrayOf(2, 1), intArrayOf(3, 2), intArrayOf(1, 3)),
                 ),
             equalTo(
                 listOf(
-                    mutableListOf(1, 4), mutableListOf(2, 4),
-                    mutableListOf(3, 4)
-                )
-            )
+                    mutableListOf(1, 4),
+                    mutableListOf(2, 4),
+                    mutableListOf(3, 4),
+                ),
+            ),
         )
     }
 
@@ -45,11 +47,11 @@ internal class SolutionTest {
             Solution()
                 .mergeSimilarItems(
                     arrayOf(intArrayOf(1, 3), intArrayOf(2, 2)),
-                    arrayOf(intArrayOf(7, 1), intArrayOf(2, 2), intArrayOf(1, 4))
+                    arrayOf(intArrayOf(7, 1), intArrayOf(2, 2), intArrayOf(1, 4)),
                 ),
             equalTo(
-                listOf(mutableListOf(1, 7), mutableListOf(2, 4), mutableListOf(7, 1))
-            )
+                listOf(mutableListOf(1, 7), mutableListOf(2, 4), mutableListOf(7, 1)),
+            ),
         )
     }
 }
diff --git a/src/test/kotlin/g2301_2400/s2367_number_of_arithmetic_triplets/SolutionTest.kt b/src/test/kotlin/g2301_2400/s2367_number_of_arithmetic_triplets/SolutionTest.kt
index e6082f5f5..399e37f2d 100644
--- a/src/test/kotlin/g2301_2400/s2367_number_of_arithmetic_triplets/SolutionTest.kt
+++ b/src/test/kotlin/g2301_2400/s2367_number_of_arithmetic_triplets/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun arithmeticTriplets() {
         assertThat(
             Solution().arithmeticTriplets(intArrayOf(0, 1, 4, 6, 7, 10), 3),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun arithmeticTriplets2() {
         assertThat(
             Solution().arithmeticTriplets(intArrayOf(4, 5, 6, 7, 8, 9), 2),
-            equalTo(2)
+            equalTo(2),
         )
     }
 }
diff --git a/src/test/kotlin/g2301_2400/s2368_reachable_nodes_with_restrictions/SolutionTest.kt b/src/test/kotlin/g2301_2400/s2368_reachable_nodes_with_restrictions/SolutionTest.kt
index e90c131c8..1a772984a 100644
--- a/src/test/kotlin/g2301_2400/s2368_reachable_nodes_with_restrictions/SolutionTest.kt
+++ b/src/test/kotlin/g2301_2400/s2368_reachable_nodes_with_restrictions/SolutionTest.kt
@@ -17,11 +17,11 @@ internal class SolutionTest {
                         intArrayOf(3, 1),
                         intArrayOf(4, 0),
                         intArrayOf(0, 5),
-                        intArrayOf(5, 6)
+                        intArrayOf(5, 6),
                     ),
-                    intArrayOf(4, 5)
+                    intArrayOf(4, 5),
                 ),
-            equalTo(4)
+            equalTo(4),
         )
     }
 
@@ -37,11 +37,11 @@ internal class SolutionTest {
                         intArrayOf(0, 5),
                         intArrayOf(0, 4),
                         intArrayOf(3, 2),
-                        intArrayOf(6, 5)
+                        intArrayOf(6, 5),
                     ),
-                    intArrayOf(4, 2, 1)
+                    intArrayOf(4, 2, 1),
                 ),
-            equalTo(3)
+            equalTo(3),
         )
     }
 }
diff --git a/src/test/kotlin/g2301_2400/s2373_largest_local_values_in_a_matrix/SolutionTest.kt b/src/test/kotlin/g2301_2400/s2373_largest_local_values_in_a_matrix/SolutionTest.kt
index de3d4caaa..001c77f92 100644
--- a/src/test/kotlin/g2301_2400/s2373_largest_local_values_in_a_matrix/SolutionTest.kt
+++ b/src/test/kotlin/g2301_2400/s2373_largest_local_values_in_a_matrix/SolutionTest.kt
@@ -14,10 +14,10 @@ internal class SolutionTest {
                         intArrayOf(9, 9, 8, 1),
                         intArrayOf(5, 6, 2, 6),
                         intArrayOf(8, 2, 6, 4),
-                        intArrayOf(6, 2, 2, 2)
-                    )
+                        intArrayOf(6, 2, 2, 2),
+                    ),
                 ),
-            equalTo(arrayOf(intArrayOf(9, 9), intArrayOf(8, 6)))
+            equalTo(arrayOf(intArrayOf(9, 9), intArrayOf(8, 6))),
         )
     }
 
@@ -31,10 +31,10 @@ internal class SolutionTest {
                         intArrayOf(1, 1, 1, 1, 1),
                         intArrayOf(1, 1, 2, 1, 1),
                         intArrayOf(1, 1, 1, 1, 1),
-                        intArrayOf(1, 1, 1, 1, 1)
-                    )
+                        intArrayOf(1, 1, 1, 1, 1),
+                    ),
                 ),
-            equalTo(arrayOf(intArrayOf(2, 2, 2), intArrayOf(2, 2, 2), intArrayOf(2, 2, 2)))
+            equalTo(arrayOf(intArrayOf(2, 2, 2), intArrayOf(2, 2, 2), intArrayOf(2, 2, 2))),
         )
     }
 }
diff --git a/src/test/kotlin/g2301_2400/s2381_shifting_letters_ii/SolutionTest.kt b/src/test/kotlin/g2301_2400/s2381_shifting_letters_ii/SolutionTest.kt
index 7cd68fd8f..cb5a6b531 100644
--- a/src/test/kotlin/g2301_2400/s2381_shifting_letters_ii/SolutionTest.kt
+++ b/src/test/kotlin/g2301_2400/s2381_shifting_letters_ii/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .shiftingLetters("abc", arrayOf(intArrayOf(0, 1, 0), intArrayOf(1, 2, 1), intArrayOf(0, 2, 1))),
-            equalTo("ace")
+            equalTo("ace"),
         )
     }
 
@@ -18,7 +18,7 @@ internal class SolutionTest {
     fun shiftingLetters2() {
         assertThat(
             Solution().shiftingLetters("dztz", arrayOf(intArrayOf(0, 0, 0), intArrayOf(1, 1, 1))),
-            equalTo("catz")
+            equalTo("catz"),
         )
     }
 }
diff --git a/src/test/kotlin/g2301_2400/s2382_maximum_segment_sum_after_removals/SolutionTest.kt b/src/test/kotlin/g2301_2400/s2382_maximum_segment_sum_after_removals/SolutionTest.kt
index cdd9e5a0b..88cb36f99 100644
--- a/src/test/kotlin/g2301_2400/s2382_maximum_segment_sum_after_removals/SolutionTest.kt
+++ b/src/test/kotlin/g2301_2400/s2382_maximum_segment_sum_after_removals/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .maximumSegmentSum(intArrayOf(1, 2, 5, 6, 1), intArrayOf(0, 3, 2, 4, 1)),
-            equalTo(longArrayOf(14, 7, 2, 2, 0))
+            equalTo(longArrayOf(14, 7, 2, 2, 0)),
         )
     }
 
@@ -18,7 +18,7 @@ internal class SolutionTest {
     fun maximumSegmentSum2() {
         assertThat(
             Solution().maximumSegmentSum(intArrayOf(3, 2, 11, 1), intArrayOf(3, 2, 1, 0)),
-            equalTo(longArrayOf(16, 5, 3, 0))
+            equalTo(longArrayOf(16, 5, 3, 0)),
         )
     }
 }
diff --git a/src/test/kotlin/g2301_2400/s2383_minimum_hours_of_training_to_win_a_competition/SolutionTest.kt b/src/test/kotlin/g2301_2400/s2383_minimum_hours_of_training_to_win_a_competition/SolutionTest.kt
index 58ffafe22..a8ab83847 100644
--- a/src/test/kotlin/g2301_2400/s2383_minimum_hours_of_training_to_win_a_competition/SolutionTest.kt
+++ b/src/test/kotlin/g2301_2400/s2383_minimum_hours_of_training_to_win_a_competition/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .minNumberOfHours(5, 3, intArrayOf(1, 4, 3, 2), intArrayOf(2, 6, 3, 1)),
-            equalTo(8)
+            equalTo(8),
         )
     }
 
@@ -18,7 +18,7 @@ internal class SolutionTest {
     fun minNumberOfHours2() {
         assertThat(
             Solution().minNumberOfHours(2, 4, intArrayOf(1), intArrayOf(3)),
-            equalTo(0)
+            equalTo(0),
         )
     }
 }
diff --git a/src/test/kotlin/g2301_2400/s2385_amount_of_time_for_binary_tree_to_be_infected/SolutionTest.kt b/src/test/kotlin/g2301_2400/s2385_amount_of_time_for_binary_tree_to_be_infected/SolutionTest.kt
index f929aced7..07a750586 100644
--- a/src/test/kotlin/g2301_2400/s2385_amount_of_time_for_binary_tree_to_be_infected/SolutionTest.kt
+++ b/src/test/kotlin/g2301_2400/s2385_amount_of_time_for_binary_tree_to_be_infected/SolutionTest.kt
@@ -11,9 +11,10 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .amountOfTime(
-                    TreeNode.create(mutableListOf(1, 5, 3, null, 4, 10, 6, 9, 2)), 3
+                    TreeNode.create(mutableListOf(1, 5, 3, null, 4, 10, 6, 9, 2)),
+                    3,
                 ),
-            equalTo(4)
+            equalTo(4),
         )
     }
 
@@ -27,9 +28,10 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .amountOfTime(
-                    TreeNode.create(mutableListOf(1, 2, null, 3, null, 4, null, 5)), 4
+                    TreeNode.create(mutableListOf(1, 2, null, 3, null, 4, null, 5)),
+                    4,
                 ),
-            equalTo(3)
+            equalTo(3),
         )
     }
 }
diff --git a/src/test/kotlin/g2301_2400/s2386_find_the_k_sum_of_an_array/SolutionTest.kt b/src/test/kotlin/g2301_2400/s2386_find_the_k_sum_of_an_array/SolutionTest.kt
index 4eedc6d79..ce8b25188 100644
--- a/src/test/kotlin/g2301_2400/s2386_find_the_k_sum_of_an_array/SolutionTest.kt
+++ b/src/test/kotlin/g2301_2400/s2386_find_the_k_sum_of_an_array/SolutionTest.kt
@@ -19,7 +19,7 @@ internal class SolutionTest {
     fun kSum3() {
         assertThat(
             Solution().kSum(intArrayOf(-530219056, 353285209, 493533664), 6),
-            equalTo(-36685392L)
+            equalTo(-36685392L),
         )
     }
 }
diff --git a/src/test/kotlin/g2301_2400/s2389_longest_subsequence_with_limited_sum/SolutionTest.kt b/src/test/kotlin/g2301_2400/s2389_longest_subsequence_with_limited_sum/SolutionTest.kt
index 3c094acb6..2679f8130 100644
--- a/src/test/kotlin/g2301_2400/s2389_longest_subsequence_with_limited_sum/SolutionTest.kt
+++ b/src/test/kotlin/g2301_2400/s2389_longest_subsequence_with_limited_sum/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun answerQueries() {
         assertThat(
             Solution().answerQueries(intArrayOf(4, 5, 2, 1), intArrayOf(3, 10, 21)),
-            equalTo(intArrayOf(2, 3, 4))
+            equalTo(intArrayOf(2, 3, 4)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun answerQueries2() {
         assertThat(
             Solution().answerQueries(intArrayOf(2, 3, 4, 5), intArrayOf(1)),
-            equalTo(intArrayOf(0))
+            equalTo(intArrayOf(0)),
         )
     }
 }
diff --git a/src/test/kotlin/g2301_2400/s2391_minimum_amount_of_time_to_collect_garbage/SolutionTest.kt b/src/test/kotlin/g2301_2400/s2391_minimum_amount_of_time_to_collect_garbage/SolutionTest.kt
index e0707511d..4e3ca782c 100644
--- a/src/test/kotlin/g2301_2400/s2391_minimum_amount_of_time_to_collect_garbage/SolutionTest.kt
+++ b/src/test/kotlin/g2301_2400/s2391_minimum_amount_of_time_to_collect_garbage/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .garbageCollection(arrayOf("G", "P", "GP", "GG"), intArrayOf(2, 4, 3)),
-            equalTo(21)
+            equalTo(21),
         )
     }
 
@@ -19,7 +19,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .garbageCollection(arrayOf("MMM", "PGM", "GP"), intArrayOf(3, 10)),
-            equalTo(37)
+            equalTo(37),
         )
     }
 }
diff --git a/src/test/kotlin/g2301_2400/s2392_build_a_matrix_with_conditions/SolutionTest.kt b/src/test/kotlin/g2301_2400/s2392_build_a_matrix_with_conditions/SolutionTest.kt
index b4fa241c8..07f0c606d 100644
--- a/src/test/kotlin/g2301_2400/s2392_build_a_matrix_with_conditions/SolutionTest.kt
+++ b/src/test/kotlin/g2301_2400/s2392_build_a_matrix_with_conditions/SolutionTest.kt
@@ -12,9 +12,9 @@ internal class SolutionTest {
                 .buildMatrix(
                     3,
                     arrayOf(intArrayOf(1, 2), intArrayOf(3, 2)),
-                    arrayOf(intArrayOf(2, 1), intArrayOf(3, 2))
+                    arrayOf(intArrayOf(2, 1), intArrayOf(3, 2)),
                 ),
-            equalTo(arrayOf(intArrayOf(0, 0, 1), intArrayOf(3, 0, 0), intArrayOf(0, 2, 0)))
+            equalTo(arrayOf(intArrayOf(0, 0, 1), intArrayOf(3, 0, 0), intArrayOf(0, 2, 0))),
         )
     }
 
@@ -25,9 +25,9 @@ internal class SolutionTest {
                 .buildMatrix(
                     3,
                     arrayOf(intArrayOf(1, 2), intArrayOf(2, 3), intArrayOf(3, 1), intArrayOf(2, 3)),
-                    arrayOf(intArrayOf(2, 1))
+                    arrayOf(intArrayOf(2, 1)),
                 ),
-            equalTo(arrayOf())
+            equalTo(arrayOf()),
         )
     }
 }
diff --git a/src/test/kotlin/g2301_2400/s2397_maximum_rows_covered_by_columns/SolutionTest.kt b/src/test/kotlin/g2301_2400/s2397_maximum_rows_covered_by_columns/SolutionTest.kt
index cd06ab99e..02e61b965 100644
--- a/src/test/kotlin/g2301_2400/s2397_maximum_rows_covered_by_columns/SolutionTest.kt
+++ b/src/test/kotlin/g2301_2400/s2397_maximum_rows_covered_by_columns/SolutionTest.kt
@@ -14,11 +14,11 @@ internal class SolutionTest {
                         intArrayOf(0, 0, 0),
                         intArrayOf(1, 0, 1),
                         intArrayOf(0, 1, 1),
-                        intArrayOf(0, 0, 1)
+                        intArrayOf(0, 0, 1),
                     ),
-                    2
+                    2,
                 ),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
@@ -26,7 +26,7 @@ internal class SolutionTest {
     fun maximumRows2() {
         assertThat(
             Solution().maximumRows(arrayOf(intArrayOf(1), intArrayOf(0)), 1),
-            equalTo(2)
+            equalTo(2),
         )
     }
 }
diff --git a/src/test/kotlin/g2301_2400/s2398_maximum_number_of_robots_within_budget/SolutionTest.kt b/src/test/kotlin/g2301_2400/s2398_maximum_number_of_robots_within_budget/SolutionTest.kt
index f6d830a54..9d7d86078 100644
--- a/src/test/kotlin/g2301_2400/s2398_maximum_number_of_robots_within_budget/SolutionTest.kt
+++ b/src/test/kotlin/g2301_2400/s2398_maximum_number_of_robots_within_budget/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .maximumRobots(intArrayOf(3, 6, 1, 3, 4), intArrayOf(2, 1, 3, 4, 5), 25),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
@@ -18,7 +18,7 @@ internal class SolutionTest {
     fun maximumRobots2() {
         assertThat(
             Solution().maximumRobots(intArrayOf(11, 12, 19), intArrayOf(10, 8, 7), 19),
-            equalTo(0)
+            equalTo(0),
         )
     }
 }
diff --git a/src/test/kotlin/g2301_2400/s2399_check_distances_between_same_letters/SolutionTest.kt b/src/test/kotlin/g2301_2400/s2399_check_distances_between_same_letters/SolutionTest.kt
index f96cd205c..150e1c6cd 100644
--- a/src/test/kotlin/g2301_2400/s2399_check_distances_between_same_letters/SolutionTest.kt
+++ b/src/test/kotlin/g2301_2400/s2399_check_distances_between_same_letters/SolutionTest.kt
@@ -13,10 +13,10 @@ internal class SolutionTest {
                     "abaccb",
                     intArrayOf(
                         1, 3, 0, 5, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-                        0, 0, 0, 0, 0
-                    )
+                        0, 0, 0, 0, 0,
+                    ),
                 ),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
@@ -28,10 +28,10 @@ internal class SolutionTest {
                     "aa",
                     intArrayOf(
                         1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-                        0, 0, 0, 0, 0
-                    )
+                        0, 0, 0, 0, 0,
+                    ),
                 ),
-            equalTo(false)
+            equalTo(false),
         )
     }
 }
diff --git a/src/test/kotlin/g2401_2500/s2402_meeting_rooms_iii/SolutionTest.kt b/src/test/kotlin/g2401_2500/s2402_meeting_rooms_iii/SolutionTest.kt
index 025f81476..9add4cd36 100644
--- a/src/test/kotlin/g2401_2500/s2402_meeting_rooms_iii/SolutionTest.kt
+++ b/src/test/kotlin/g2401_2500/s2402_meeting_rooms_iii/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun mostBooked() {
         assertThat(
             Solution().mostBooked(2, arrayOf(intArrayOf(0, 10), intArrayOf(1, 5), intArrayOf(2, 7), intArrayOf(3, 4))),
-            equalTo(0)
+            equalTo(0),
         )
     }
 
@@ -19,9 +19,9 @@ internal class SolutionTest {
             Solution()
                 .mostBooked(
                     3,
-                    arrayOf(intArrayOf(1, 20), intArrayOf(2, 10), intArrayOf(3, 5), intArrayOf(4, 9), intArrayOf(6, 8))
+                    arrayOf(intArrayOf(1, 20), intArrayOf(2, 10), intArrayOf(3, 5), intArrayOf(4, 9), intArrayOf(6, 8)),
                 ),
-            equalTo(1)
+            equalTo(1),
         )
     }
 }
diff --git a/src/test/kotlin/g2401_2500/s2404_most_frequent_even_element/SolutionTest.kt b/src/test/kotlin/g2401_2500/s2404_most_frequent_even_element/SolutionTest.kt
index eab94435a..b6067ee8c 100644
--- a/src/test/kotlin/g2401_2500/s2404_most_frequent_even_element/SolutionTest.kt
+++ b/src/test/kotlin/g2401_2500/s2404_most_frequent_even_element/SolutionTest.kt
@@ -19,7 +19,7 @@ internal class SolutionTest {
     fun mostFrequentEven3() {
         assertThat(
             Solution().mostFrequentEven(intArrayOf(29, 47, 21, 41, 13, 37, 25, 7)),
-            equalTo(-1)
+            equalTo(-1),
         )
     }
 }
diff --git a/src/test/kotlin/g2401_2500/s2406_divide_intervals_into_minimum_number_of_groups/SolutionTest.kt b/src/test/kotlin/g2401_2500/s2406_divide_intervals_into_minimum_number_of_groups/SolutionTest.kt
index c90b58a44..9ba449bf4 100644
--- a/src/test/kotlin/g2401_2500/s2406_divide_intervals_into_minimum_number_of_groups/SolutionTest.kt
+++ b/src/test/kotlin/g2401_2500/s2406_divide_intervals_into_minimum_number_of_groups/SolutionTest.kt
@@ -14,10 +14,10 @@ internal class SolutionTest {
                     intArrayOf(6, 8),
                     intArrayOf(1, 5),
                     intArrayOf(2, 3),
-                    intArrayOf(1, 10)
-                )
+                    intArrayOf(1, 10),
+                ),
             ),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun minGroups2() {
         assertThat(
             Solution().minGroups(arrayOf(intArrayOf(1, 3), intArrayOf(5, 6), intArrayOf(8, 10), intArrayOf(11, 13))),
-            equalTo(1)
+            equalTo(1),
         )
     }
 }
diff --git a/src/test/kotlin/g2401_2500/s2407_longest_increasing_subsequence_ii/SolutionTest.kt b/src/test/kotlin/g2401_2500/s2407_longest_increasing_subsequence_ii/SolutionTest.kt
index 1bd882c92..0511e9acf 100644
--- a/src/test/kotlin/g2401_2500/s2407_longest_increasing_subsequence_ii/SolutionTest.kt
+++ b/src/test/kotlin/g2401_2500/s2407_longest_increasing_subsequence_ii/SolutionTest.kt
@@ -8,7 +8,8 @@ internal class SolutionTest {
     @Test
     fun lengthOfLIS() {
         assertThat(
-            Solution().lengthOfLIS(intArrayOf(4, 2, 1, 4, 3, 4, 5, 8, 15), 3), equalTo(5)
+            Solution().lengthOfLIS(intArrayOf(4, 2, 1, 4, 3, 4, 5, 8, 15), 3),
+            equalTo(5),
         )
     }
 
@@ -16,7 +17,7 @@ internal class SolutionTest {
     fun lengthOfLIS2() {
         assertThat(
             Solution().lengthOfLIS(intArrayOf(7, 4, 5, 1, 8, 12, 4, 7), 5),
-            equalTo(4)
+            equalTo(4),
         )
     }
 
diff --git a/src/test/kotlin/g2401_2500/s2409_count_days_spent_together/SolutionTest.kt b/src/test/kotlin/g2401_2500/s2409_count_days_spent_together/SolutionTest.kt
index 723fb0425..40de68e4e 100644
--- a/src/test/kotlin/g2401_2500/s2409_count_days_spent_together/SolutionTest.kt
+++ b/src/test/kotlin/g2401_2500/s2409_count_days_spent_together/SolutionTest.kt
@@ -8,35 +8,40 @@ internal class SolutionTest {
     @Test
     fun countDaysTogether() {
         assertThat(
-            Solution().countDaysTogether("08-15", "08-18", "08-16", "08-19"), equalTo(3)
+            Solution().countDaysTogether("08-15", "08-18", "08-16", "08-19"),
+            equalTo(3),
         )
     }
 
     @Test
     fun countDaysTogether2() {
         assertThat(
-            Solution().countDaysTogether("10-01", "10-31", "11-01", "12-31"), equalTo(0)
+            Solution().countDaysTogether("10-01", "10-31", "11-01", "12-31"),
+            equalTo(0),
         )
     }
 
     @Test
     fun countDaysTogether3() {
         assertThat(
-            Solution().countDaysTogether("09-01", "10-19", "06-19", "10-20"), equalTo(49)
+            Solution().countDaysTogether("09-01", "10-19", "06-19", "10-20"),
+            equalTo(49),
         )
     }
 
     @Test
     fun countDaysTogether4() {
         assertThat(
-            Solution().countDaysTogether("08-06", "12-08", "02-04", "09-01"), equalTo(27)
+            Solution().countDaysTogether("08-06", "12-08", "02-04", "09-01"),
+            equalTo(27),
         )
     }
 
     @Test
     fun countDaysTogether5() {
         assertThat(
-            Solution().countDaysTogether("03-05", "07-14", "04-14", "09-21"), equalTo(92)
+            Solution().countDaysTogether("03-05", "07-14", "04-14", "09-21"),
+            equalTo(92),
         )
     }
 }
diff --git a/src/test/kotlin/g2401_2500/s2410_maximum_matching_of_players_with_trainers/SolutionTest.kt b/src/test/kotlin/g2401_2500/s2410_maximum_matching_of_players_with_trainers/SolutionTest.kt
index 93191df09..8b1393bab 100644
--- a/src/test/kotlin/g2401_2500/s2410_maximum_matching_of_players_with_trainers/SolutionTest.kt
+++ b/src/test/kotlin/g2401_2500/s2410_maximum_matching_of_players_with_trainers/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun matchPlayersAndTrainers() {
         assertThat(
             Solution().matchPlayersAndTrainers(intArrayOf(4, 7, 9), intArrayOf(8, 2, 5, 8)),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun matchPlayersAndTrainers2() {
         assertThat(
             Solution().matchPlayersAndTrainers(intArrayOf(1, 1, 1), intArrayOf(10)),
-            equalTo(1)
+            equalTo(1),
         )
     }
 }
diff --git a/src/test/kotlin/g2401_2500/s2411_smallest_subarrays_with_maximum_bitwise_or/SolutionTest.kt b/src/test/kotlin/g2401_2500/s2411_smallest_subarrays_with_maximum_bitwise_or/SolutionTest.kt
index 0c526415b..0b197f04a 100644
--- a/src/test/kotlin/g2401_2500/s2411_smallest_subarrays_with_maximum_bitwise_or/SolutionTest.kt
+++ b/src/test/kotlin/g2401_2500/s2411_smallest_subarrays_with_maximum_bitwise_or/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun smallestSubarrays() {
         assertThat(
             Solution().smallestSubarrays(intArrayOf(1, 0, 2, 1, 3)),
-            equalTo(intArrayOf(3, 3, 2, 2, 1))
+            equalTo(intArrayOf(3, 3, 2, 2, 1)),
         )
     }
 
diff --git a/src/test/kotlin/g2401_2500/s2412_minimum_money_required_before_transactions/SolutionTest.kt b/src/test/kotlin/g2401_2500/s2412_minimum_money_required_before_transactions/SolutionTest.kt
index 000fca071..68ea14324 100644
--- a/src/test/kotlin/g2401_2500/s2412_minimum_money_required_before_transactions/SolutionTest.kt
+++ b/src/test/kotlin/g2401_2500/s2412_minimum_money_required_before_transactions/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun minimumMoney() {
         assertThat(
             Solution().minimumMoney(arrayOf(intArrayOf(2, 1), intArrayOf(5, 0), intArrayOf(4, 2))),
-            equalTo(10L)
+            equalTo(10L),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun minimumMoney2() {
         assertThat(
             Solution().minimumMoney(arrayOf(intArrayOf(3, 0), intArrayOf(0, 3))),
-            equalTo(3L)
+            equalTo(3L),
         )
     }
 }
diff --git a/src/test/kotlin/g2401_2500/s2415_reverse_odd_levels_of_binary_tree/SolutionTest.kt b/src/test/kotlin/g2401_2500/s2415_reverse_odd_levels_of_binary_tree/SolutionTest.kt
index 2ad742ac9..a490675a3 100644
--- a/src/test/kotlin/g2401_2500/s2415_reverse_odd_levels_of_binary_tree/SolutionTest.kt
+++ b/src/test/kotlin/g2401_2500/s2415_reverse_odd_levels_of_binary_tree/SolutionTest.kt
@@ -12,7 +12,7 @@ internal class SolutionTest {
             Solution()
                 .reverseOddLevels(TreeNode.create(listOf(2, 3, 5, 8, 13, 21, 34))!!)
                 .toString(),
-            equalTo("2,5,8,13,3,21,34")
+            equalTo("2,5,8,13,3,21,34"),
         )
     }
 
@@ -22,7 +22,7 @@ internal class SolutionTest {
             Solution()
                 .reverseOddLevels(TreeNode.create(listOf(7, 13, 11))!!)
                 .toString(),
-            equalTo("7,11,13")
+            equalTo("7,11,13"),
         )
     }
 }
diff --git a/src/test/kotlin/g2401_2500/s2416_sum_of_prefix_scores_of_strings/SolutionTest.kt b/src/test/kotlin/g2401_2500/s2416_sum_of_prefix_scores_of_strings/SolutionTest.kt
index ecc52c6fa..7bfd3152c 100644
--- a/src/test/kotlin/g2401_2500/s2416_sum_of_prefix_scores_of_strings/SolutionTest.kt
+++ b/src/test/kotlin/g2401_2500/s2416_sum_of_prefix_scores_of_strings/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun sumPrefixScores() {
         assertThat(
             Solution().sumPrefixScores(arrayOf("abc", "ab", "bc", "b")),
-            equalTo(intArrayOf(5, 4, 3, 2))
+            equalTo(intArrayOf(5, 4, 3, 2)),
         )
     }
 
diff --git a/src/test/kotlin/g2401_2500/s2418_sort_the_people/SolutionTest.kt b/src/test/kotlin/g2401_2500/s2418_sort_the_people/SolutionTest.kt
index 71e1dd6dd..40e27dd64 100644
--- a/src/test/kotlin/g2401_2500/s2418_sort_the_people/SolutionTest.kt
+++ b/src/test/kotlin/g2401_2500/s2418_sort_the_people/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .sortPeople(arrayOf("Mary", "John", "Emma"), intArrayOf(180, 165, 170)),
-            equalTo(arrayOf("Mary", "Emma", "John"))
+            equalTo(arrayOf("Mary", "Emma", "John")),
         )
     }
 
@@ -19,7 +19,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .sortPeople(arrayOf("Alice", "Bob", "Bob"), intArrayOf(155, 185, 150)),
-            equalTo(arrayOf("Bob", "Alice", "Bob"))
+            equalTo(arrayOf("Bob", "Alice", "Bob")),
         )
     }
 }
diff --git a/src/test/kotlin/g2401_2500/s2420_find_all_good_indices/SolutionTest.kt b/src/test/kotlin/g2401_2500/s2420_find_all_good_indices/SolutionTest.kt
index 260f5e122..10948d16a 100644
--- a/src/test/kotlin/g2401_2500/s2420_find_all_good_indices/SolutionTest.kt
+++ b/src/test/kotlin/g2401_2500/s2420_find_all_good_indices/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun goodIndices() {
         assertThat(
             Solution().goodIndices(intArrayOf(2, 1, 1, 1, 3, 4, 1), 2),
-            equalTo(listOf(2, 3))
+            equalTo(listOf(2, 3)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun goodIndices2() {
         assertThat(
             Solution().goodIndices(intArrayOf(2, 1, 1, 2), 2),
-            equalTo(emptyList<Any>())
+            equalTo(emptyList<Any>()),
         )
     }
 }
diff --git a/src/test/kotlin/g2401_2500/s2421_number_of_good_paths/SolutionTest.kt b/src/test/kotlin/g2401_2500/s2421_number_of_good_paths/SolutionTest.kt
index 1ec18e56b..592815274 100644
--- a/src/test/kotlin/g2401_2500/s2421_number_of_good_paths/SolutionTest.kt
+++ b/src/test/kotlin/g2401_2500/s2421_number_of_good_paths/SolutionTest.kt
@@ -11,9 +11,9 @@ internal class SolutionTest {
             Solution()
                 .numberOfGoodPaths(
                     intArrayOf(1, 3, 2, 1, 3),
-                    arrayOf(intArrayOf(0, 1), intArrayOf(0, 2), intArrayOf(2, 3), intArrayOf(2, 4))
+                    arrayOf(intArrayOf(0, 1), intArrayOf(0, 2), intArrayOf(2, 3), intArrayOf(2, 4)),
                 ),
-            equalTo(6)
+            equalTo(6),
         )
     }
 
@@ -23,9 +23,9 @@ internal class SolutionTest {
             Solution()
                 .numberOfGoodPaths(
                     intArrayOf(1, 1, 2, 2, 3),
-                    arrayOf(intArrayOf(0, 1), intArrayOf(1, 2), intArrayOf(2, 3), intArrayOf(2, 4))
+                    arrayOf(intArrayOf(0, 1), intArrayOf(1, 2), intArrayOf(2, 3), intArrayOf(2, 4)),
                 ),
-            equalTo(7)
+            equalTo(7),
         )
     }
 }
diff --git a/src/test/kotlin/g2401_2500/s2425_bitwise_xor_of_all_pairings/SolutionTest.kt b/src/test/kotlin/g2401_2500/s2425_bitwise_xor_of_all_pairings/SolutionTest.kt
index 02fab6627..69d968197 100644
--- a/src/test/kotlin/g2401_2500/s2425_bitwise_xor_of_all_pairings/SolutionTest.kt
+++ b/src/test/kotlin/g2401_2500/s2425_bitwise_xor_of_all_pairings/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun xorAllNums() {
         assertThat(
             Solution().xorAllNums(intArrayOf(2, 1, 3), intArrayOf(10, 2, 5, 0)),
-            equalTo(13)
+            equalTo(13),
         )
     }
 
diff --git a/src/test/kotlin/g2401_2500/s2426_number_of_pairs_satisfying_inequality/SolutionTest.kt b/src/test/kotlin/g2401_2500/s2426_number_of_pairs_satisfying_inequality/SolutionTest.kt
index bbe407105..cf74deed1 100644
--- a/src/test/kotlin/g2401_2500/s2426_number_of_pairs_satisfying_inequality/SolutionTest.kt
+++ b/src/test/kotlin/g2401_2500/s2426_number_of_pairs_satisfying_inequality/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun numberOfPairs() {
         assertThat(
             Solution().numberOfPairs(intArrayOf(3, 2, 5), intArrayOf(2, 2, 1), 1),
-            equalTo(3L)
+            equalTo(3L),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun numberOfPairs2() {
         assertThat(
             Solution().numberOfPairs(intArrayOf(3, -1), intArrayOf(-2, 2), -1),
-            equalTo(0L)
+            equalTo(0L),
         )
     }
 }
diff --git a/src/test/kotlin/g2401_2500/s2428_maximum_sum_of_an_hourglass/SolutionTest.kt b/src/test/kotlin/g2401_2500/s2428_maximum_sum_of_an_hourglass/SolutionTest.kt
index a0a16a5cd..1fa1ef30d 100644
--- a/src/test/kotlin/g2401_2500/s2428_maximum_sum_of_an_hourglass/SolutionTest.kt
+++ b/src/test/kotlin/g2401_2500/s2428_maximum_sum_of_an_hourglass/SolutionTest.kt
@@ -14,10 +14,10 @@ internal class SolutionTest {
                         intArrayOf(6, 2, 1, 3),
                         intArrayOf(4, 2, 1, 5),
                         intArrayOf(9, 2, 8, 7),
-                        intArrayOf(4, 1, 2, 9)
-                    )
+                        intArrayOf(4, 1, 2, 9),
+                    ),
                 ),
-            equalTo(30)
+            equalTo(30),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun maxSum2() {
         assertThat(
             Solution().maxSum(arrayOf(intArrayOf(1, 2, 3), intArrayOf(4, 5, 6), intArrayOf(7, 8, 9))),
-            equalTo(35)
+            equalTo(35),
         )
     }
 }
diff --git a/src/test/kotlin/g2401_2500/s2432_the_employee_that_worked_on_the_longest_task/SolutionTest.kt b/src/test/kotlin/g2401_2500/s2432_the_employee_that_worked_on_the_longest_task/SolutionTest.kt
index a06ee3b7f..bd6b7dd0a 100644
--- a/src/test/kotlin/g2401_2500/s2432_the_employee_that_worked_on_the_longest_task/SolutionTest.kt
+++ b/src/test/kotlin/g2401_2500/s2432_the_employee_that_worked_on_the_longest_task/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun hardestWorker() {
         assertThat(
             Solution().hardestWorker(arrayOf(intArrayOf(0, 3), intArrayOf(2, 5), intArrayOf(0, 9), intArrayOf(1, 15))),
-            equalTo(1)
+            equalTo(1),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun hardestWorker2() {
         assertThat(
             Solution().hardestWorker(arrayOf(intArrayOf(1, 1), intArrayOf(3, 7), intArrayOf(2, 12), intArrayOf(7, 17))),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun hardestWorker3() {
         assertThat(
             Solution().hardestWorker(arrayOf(intArrayOf(0, 10), intArrayOf(10, 20))),
-            equalTo(0)
+            equalTo(0),
         )
     }
 }
diff --git a/src/test/kotlin/g2401_2500/s2433_find_the_original_array_of_prefix_xor/SolutionTest.kt b/src/test/kotlin/g2401_2500/s2433_find_the_original_array_of_prefix_xor/SolutionTest.kt
index 02057d11e..e85cccad3 100644
--- a/src/test/kotlin/g2401_2500/s2433_find_the_original_array_of_prefix_xor/SolutionTest.kt
+++ b/src/test/kotlin/g2401_2500/s2433_find_the_original_array_of_prefix_xor/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun findArray() {
         assertThat(
             Solution().findArray(intArrayOf(5, 2, 0, 3, 1)),
-            equalTo(intArrayOf(5, 7, 2, 3, 2))
+            equalTo(intArrayOf(5, 7, 2, 3, 2)),
         )
     }
 
diff --git a/src/test/kotlin/g2401_2500/s2435_paths_in_matrix_whose_sum_is_divisible_by_k/SolutionTest.kt b/src/test/kotlin/g2401_2500/s2435_paths_in_matrix_whose_sum_is_divisible_by_k/SolutionTest.kt
index 9b5126bc2..49c042740 100644
--- a/src/test/kotlin/g2401_2500/s2435_paths_in_matrix_whose_sum_is_divisible_by_k/SolutionTest.kt
+++ b/src/test/kotlin/g2401_2500/s2435_paths_in_matrix_whose_sum_is_divisible_by_k/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun numberOfPaths() {
         assertThat(
             Solution().numberOfPaths(arrayOf(intArrayOf(5, 2, 4), intArrayOf(3, 0, 5), intArrayOf(0, 7, 2)), 3),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -23,7 +23,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .numberOfPaths(arrayOf(intArrayOf(7, 3, 4, 9), intArrayOf(2, 3, 6, 2), intArrayOf(2, 3, 7, 0)), 1),
-            equalTo(10)
+            equalTo(10),
         )
     }
 }
diff --git a/src/test/kotlin/g2401_2500/s2438_range_product_queries_of_powers/SolutionTest.kt b/src/test/kotlin/g2401_2500/s2438_range_product_queries_of_powers/SolutionTest.kt
index 55c753c6e..7ff884c8c 100644
--- a/src/test/kotlin/g2401_2500/s2438_range_product_queries_of_powers/SolutionTest.kt
+++ b/src/test/kotlin/g2401_2500/s2438_range_product_queries_of_powers/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun productQueries() {
         assertThat(
             Solution().productQueries(15, arrayOf(intArrayOf(0, 1), intArrayOf(2, 2), intArrayOf(0, 3))),
-            equalTo(intArrayOf(2, 4, 64))
+            equalTo(intArrayOf(2, 4, 64)),
         )
     }
 
@@ -18,8 +18,8 @@ internal class SolutionTest {
         assertThat(
             Solution().productQueries(2, arrayOf(intArrayOf(0, 0))),
             equalTo(
-                intArrayOf(2)
-            )
+                intArrayOf(2),
+            ),
         )
     }
 }
diff --git a/src/test/kotlin/g2401_2500/s2440_create_components_with_same_value/SolutionTest.kt b/src/test/kotlin/g2401_2500/s2440_create_components_with_same_value/SolutionTest.kt
index f670ec783..c2fff8e97 100644
--- a/src/test/kotlin/g2401_2500/s2440_create_components_with_same_value/SolutionTest.kt
+++ b/src/test/kotlin/g2401_2500/s2440_create_components_with_same_value/SolutionTest.kt
@@ -11,9 +11,9 @@ internal class SolutionTest {
             Solution()
                 .componentValue(
                     intArrayOf(6, 2, 2, 2, 6),
-                    arrayOf(intArrayOf(0, 1), intArrayOf(1, 2), intArrayOf(1, 3), intArrayOf(3, 4))
+                    arrayOf(intArrayOf(0, 1), intArrayOf(1, 2), intArrayOf(1, 3), intArrayOf(3, 4)),
                 ),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
diff --git a/src/test/kotlin/g2401_2500/s2442_count_number_of_distinct_integers_after_reverse_operations/SolutionTest.kt b/src/test/kotlin/g2401_2500/s2442_count_number_of_distinct_integers_after_reverse_operations/SolutionTest.kt
index f53c2b3c0..46e60c3db 100644
--- a/src/test/kotlin/g2401_2500/s2442_count_number_of_distinct_integers_after_reverse_operations/SolutionTest.kt
+++ b/src/test/kotlin/g2401_2500/s2442_count_number_of_distinct_integers_after_reverse_operations/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun countDistinctIntegers() {
         assertThat(
             Solution().countDistinctIntegers(intArrayOf(1, 13, 10, 12, 31)),
-            equalTo(6)
+            equalTo(6),
         )
     }
 
diff --git a/src/test/kotlin/g2401_2500/s2444_count_subarrays_with_fixed_bounds/SolutionTest.kt b/src/test/kotlin/g2401_2500/s2444_count_subarrays_with_fixed_bounds/SolutionTest.kt
index fde55067a..a764a9b6f 100644
--- a/src/test/kotlin/g2401_2500/s2444_count_subarrays_with_fixed_bounds/SolutionTest.kt
+++ b/src/test/kotlin/g2401_2500/s2444_count_subarrays_with_fixed_bounds/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun countSubarrays() {
         assertThat(
             Solution().countSubarrays(intArrayOf(1, 3, 5, 2, 7, 5), 1, 5),
-            equalTo(2L)
+            equalTo(2L),
         )
     }
 
diff --git a/src/test/kotlin/g2401_2500/s2446_determine_if_two_events_have_conflict/SolutionTest.kt b/src/test/kotlin/g2401_2500/s2446_determine_if_two_events_have_conflict/SolutionTest.kt
index 8afa3fdd7..e7df7110b 100644
--- a/src/test/kotlin/g2401_2500/s2446_determine_if_two_events_have_conflict/SolutionTest.kt
+++ b/src/test/kotlin/g2401_2500/s2446_determine_if_two_events_have_conflict/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .haveConflict(arrayOf("01:15", "02:00"), arrayOf("02:00", "03:00")),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
@@ -19,7 +19,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .haveConflict(arrayOf("01:00", "02:00"), arrayOf("01:20", "03:00")),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
@@ -28,7 +28,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .haveConflict(arrayOf("10:00", "11:00"), arrayOf("14:00", "15:00")),
-            equalTo(false)
+            equalTo(false),
         )
     }
 }
diff --git a/src/test/kotlin/g2401_2500/s2448_minimum_cost_to_make_array_equal/SolutionTest.kt b/src/test/kotlin/g2401_2500/s2448_minimum_cost_to_make_array_equal/SolutionTest.kt
index 903428121..7fe2fce1c 100644
--- a/src/test/kotlin/g2401_2500/s2448_minimum_cost_to_make_array_equal/SolutionTest.kt
+++ b/src/test/kotlin/g2401_2500/s2448_minimum_cost_to_make_array_equal/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun minCost() {
         assertThat(
             Solution().minCost(intArrayOf(1, 3, 5, 2), intArrayOf(2, 3, 1, 14)),
-            equalTo(8L)
+            equalTo(8L),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun minCost2() {
         assertThat(
             Solution().minCost(intArrayOf(2, 2, 2, 2, 2), intArrayOf(4, 2, 8, 1, 3)),
-            equalTo(0L)
+            equalTo(0L),
         )
     }
 }
diff --git a/src/test/kotlin/g2401_2500/s2449_minimum_number_of_operations_to_make_arrays_similar/SolutionTest.kt b/src/test/kotlin/g2401_2500/s2449_minimum_number_of_operations_to_make_arrays_similar/SolutionTest.kt
index 65c74ddab..9b907b32d 100644
--- a/src/test/kotlin/g2401_2500/s2449_minimum_number_of_operations_to_make_arrays_similar/SolutionTest.kt
+++ b/src/test/kotlin/g2401_2500/s2449_minimum_number_of_operations_to_make_arrays_similar/SolutionTest.kt
@@ -9,14 +9,15 @@ internal class SolutionTest {
     fun makeSimilar() {
         assertThat(
             Solution().makeSimilar(intArrayOf(8, 12, 6), intArrayOf(2, 14, 10)),
-            equalTo(2L)
+            equalTo(2L),
         )
     }
 
     @Test
     fun makeSimilar2() {
         assertThat(
-            Solution().makeSimilar(intArrayOf(1, 2, 5), intArrayOf(4, 1, 3)), equalTo(1L)
+            Solution().makeSimilar(intArrayOf(1, 2, 5), intArrayOf(4, 1, 3)),
+            equalTo(1L),
         )
     }
 
@@ -24,7 +25,7 @@ internal class SolutionTest {
     fun makeSimilar3() {
         assertThat(
             Solution().makeSimilar(intArrayOf(1, 1, 1, 1, 1), intArrayOf(1, 1, 1, 1, 1)),
-            equalTo(0L)
+            equalTo(0L),
         )
     }
 }
diff --git a/src/test/kotlin/g2401_2500/s2451_odd_string_difference/SolutionTest.kt b/src/test/kotlin/g2401_2500/s2451_odd_string_difference/SolutionTest.kt
index ea03ad1c8..396295e88 100644
--- a/src/test/kotlin/g2401_2500/s2451_odd_string_difference/SolutionTest.kt
+++ b/src/test/kotlin/g2401_2500/s2451_odd_string_difference/SolutionTest.kt
@@ -14,7 +14,7 @@ internal class SolutionTest {
     fun oddString2() {
         assertThat(
             Solution().oddString(arrayOf("aaa", "bob", "ccc", "ddd")),
-            equalTo("bob")
+            equalTo("bob"),
         )
     }
 }
diff --git a/src/test/kotlin/g2401_2500/s2452_words_within_two_edits_of_dictionary/SolutionTest.kt b/src/test/kotlin/g2401_2500/s2452_words_within_two_edits_of_dictionary/SolutionTest.kt
index d09c79073..d90c529f3 100644
--- a/src/test/kotlin/g2401_2500/s2452_words_within_two_edits_of_dictionary/SolutionTest.kt
+++ b/src/test/kotlin/g2401_2500/s2452_words_within_two_edits_of_dictionary/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .twoEditWords(arrayOf("word", "note", "ants", "wood"), arrayOf("wood", "joke", "moat")),
-            equalTo(mutableListOf("word", "note", "wood"))
+            equalTo(mutableListOf("word", "note", "wood")),
         )
     }
 
@@ -18,7 +18,7 @@ internal class SolutionTest {
     fun twoEditWords2() {
         assertThat(
             Solution().twoEditWords(arrayOf("yes"), arrayOf("not")),
-            equalTo(emptyList<Any>())
+            equalTo(emptyList<Any>()),
         )
     }
 }
diff --git a/src/test/kotlin/g2401_2500/s2454_next_greater_element_iv/SolutionTest.kt b/src/test/kotlin/g2401_2500/s2454_next_greater_element_iv/SolutionTest.kt
index 189b912e6..b4e26a68c 100644
--- a/src/test/kotlin/g2401_2500/s2454_next_greater_element_iv/SolutionTest.kt
+++ b/src/test/kotlin/g2401_2500/s2454_next_greater_element_iv/SolutionTest.kt
@@ -9,14 +9,15 @@ internal class SolutionTest {
     fun secondGreaterElement() {
         assertThat(
             Solution().secondGreaterElement(intArrayOf(2, 4, 0, 9, 6)),
-            equalTo(intArrayOf(9, 6, 6, -1, -1))
+            equalTo(intArrayOf(9, 6, 6, -1, -1)),
         )
     }
 
     @Test
     fun secondGreaterElement2() {
         assertThat(
-            Solution().secondGreaterElement(intArrayOf(3, 3)), equalTo(intArrayOf(-1, -1))
+            Solution().secondGreaterElement(intArrayOf(3, 3)),
+            equalTo(intArrayOf(-1, -1)),
         )
     }
 }
diff --git a/src/test/kotlin/g2401_2500/s2456_most_popular_video_creator/SolutionTest.kt b/src/test/kotlin/g2401_2500/s2456_most_popular_video_creator/SolutionTest.kt
index 92e9e0729..1fea7f242 100644
--- a/src/test/kotlin/g2401_2500/s2456_most_popular_video_creator/SolutionTest.kt
+++ b/src/test/kotlin/g2401_2500/s2456_most_popular_video_creator/SolutionTest.kt
@@ -12,14 +12,14 @@ internal class SolutionTest {
                 .mostPopularCreator(
                     arrayOf("alice", "bob", "alice", "chris"),
                     arrayOf("one", "two", "three", "four"),
-                    intArrayOf(5, 10, 5, 4)
+                    intArrayOf(5, 10, 5, 4),
                 ),
             equalTo(
                 listOf(
                     mutableListOf("bob", "two"),
-                    mutableListOf("alice", "one")
-                )
-            )
+                    mutableListOf("alice", "one"),
+                ),
+            ),
         )
     }
 
@@ -28,7 +28,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .mostPopularCreator(arrayOf("alice", "alice", "alice"), arrayOf("a", "b", "c"), intArrayOf(1, 2, 2)),
-            equalTo(listOf<List<String>>(mutableListOf("alice", "b")))
+            equalTo(listOf<List<String>>(mutableListOf("alice", "b"))),
         )
     }
 }
diff --git a/src/test/kotlin/g2401_2500/s2458_height_of_binary_tree_after_subtree_removal_queries/SolutionTest.kt b/src/test/kotlin/g2401_2500/s2458_height_of_binary_tree_after_subtree_removal_queries/SolutionTest.kt
index a59d1e31c..d84079354 100644
--- a/src/test/kotlin/g2401_2500/s2458_height_of_binary_tree_after_subtree_removal_queries/SolutionTest.kt
+++ b/src/test/kotlin/g2401_2500/s2458_height_of_binary_tree_after_subtree_removal_queries/SolutionTest.kt
@@ -14,12 +14,12 @@ internal class SolutionTest {
                     TreeNode.create(
                         mutableListOf(
                             1, 3, 4, 2, null, 6, 5, null, null, null, null,
-                            null, 7
-                        )
+                            null, 7,
+                        ),
                     ),
-                    intArrayOf(4)
+                    intArrayOf(4),
                 ),
-            equalTo(intArrayOf(2))
+            equalTo(intArrayOf(2)),
         )
     }
 
@@ -28,9 +28,10 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .treeQueries(
-                    TreeNode.create(mutableListOf(5, 8, 9, 2, 1, 3, 7, 4, 6)), intArrayOf(3, 2, 4, 8)
+                    TreeNode.create(mutableListOf(5, 8, 9, 2, 1, 3, 7, 4, 6)),
+                    intArrayOf(3, 2, 4, 8),
                 ),
-            equalTo(intArrayOf(3, 2, 3, 2))
+            equalTo(intArrayOf(3, 2, 3, 2)),
         )
     }
 }
diff --git a/src/test/kotlin/g2401_2500/s2460_apply_operations_to_an_array/SolutionTest.kt b/src/test/kotlin/g2401_2500/s2460_apply_operations_to_an_array/SolutionTest.kt
index fb83111e0..45c3bac14 100644
--- a/src/test/kotlin/g2401_2500/s2460_apply_operations_to_an_array/SolutionTest.kt
+++ b/src/test/kotlin/g2401_2500/s2460_apply_operations_to_an_array/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun applyOperations() {
         assertThat(
             Solution().applyOperations(intArrayOf(1, 2, 2, 1, 1, 0)),
-            equalTo(intArrayOf(1, 4, 2, 0, 0, 0))
+            equalTo(intArrayOf(1, 4, 2, 0, 0, 0)),
         )
     }
 
diff --git a/src/test/kotlin/g2401_2500/s2461_maximum_sum_of_distinct_subarrays_with_length_k/SolutionTest.kt b/src/test/kotlin/g2401_2500/s2461_maximum_sum_of_distinct_subarrays_with_length_k/SolutionTest.kt
index 8b3539ead..4ed414c78 100644
--- a/src/test/kotlin/g2401_2500/s2461_maximum_sum_of_distinct_subarrays_with_length_k/SolutionTest.kt
+++ b/src/test/kotlin/g2401_2500/s2461_maximum_sum_of_distinct_subarrays_with_length_k/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun maximumSubarraySum() {
         assertThat(
             Solution().maximumSubarraySum(intArrayOf(1, 5, 4, 2, 9, 9, 9), 3),
-            equalTo(15L)
+            equalTo(15L),
         )
     }
 
diff --git a/src/test/kotlin/g2401_2500/s2462_total_cost_to_hire_k_workers/SolutionTest.kt b/src/test/kotlin/g2401_2500/s2462_total_cost_to_hire_k_workers/SolutionTest.kt
index 77c52c382..e609ffdc1 100644
--- a/src/test/kotlin/g2401_2500/s2462_total_cost_to_hire_k_workers/SolutionTest.kt
+++ b/src/test/kotlin/g2401_2500/s2462_total_cost_to_hire_k_workers/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun totalCost() {
         assertThat(
             Solution().totalCost(intArrayOf(17, 12, 10, 2, 7, 2, 11, 20, 8), 3, 4),
-            equalTo(11L)
+            equalTo(11L),
         )
     }
 
diff --git a/src/test/kotlin/g2401_2500/s2463_minimum_total_distance_traveled/SolutionTest.kt b/src/test/kotlin/g2401_2500/s2463_minimum_total_distance_traveled/SolutionTest.kt
index e431a1e77..68546a308 100644
--- a/src/test/kotlin/g2401_2500/s2463_minimum_total_distance_traveled/SolutionTest.kt
+++ b/src/test/kotlin/g2401_2500/s2463_minimum_total_distance_traveled/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .minimumTotalDistance(mutableListOf(0, 4, 6), arrayOf(intArrayOf(2, 2), intArrayOf(6, 2))),
-            equalTo(4L)
+            equalTo(4L),
         )
     }
 
@@ -19,7 +19,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .minimumTotalDistance(listOf(1, -1), arrayOf(intArrayOf(-2, 1), intArrayOf(2, 1))),
-            equalTo(2L)
+            equalTo(2L),
         )
     }
 }
diff --git a/src/test/kotlin/g2401_2500/s2467_most_profitable_path_in_a_tree/SolutionTest.kt b/src/test/kotlin/g2401_2500/s2467_most_profitable_path_in_a_tree/SolutionTest.kt
index 016d5adc8..4a641f945 100644
--- a/src/test/kotlin/g2401_2500/s2467_most_profitable_path_in_a_tree/SolutionTest.kt
+++ b/src/test/kotlin/g2401_2500/s2467_most_profitable_path_in_a_tree/SolutionTest.kt
@@ -11,9 +11,10 @@ internal class SolutionTest {
             Solution()
                 .mostProfitablePath(
                     arrayOf(intArrayOf(0, 1), intArrayOf(1, 2), intArrayOf(1, 3), intArrayOf(3, 4)),
-                    3, intArrayOf(-2, 4, 2, -4, 6)
+                    3,
+                    intArrayOf(-2, 4, 2, -4, 6),
                 ),
-            equalTo(6)
+            equalTo(6),
         )
     }
 
@@ -21,7 +22,7 @@ internal class SolutionTest {
     fun mostProfitablePath2() {
         assertThat(
             Solution().mostProfitablePath(arrayOf(intArrayOf(0, 1)), 1, intArrayOf(-7280, 2350)),
-            equalTo(-7280)
+            equalTo(-7280),
         )
     }
 }
diff --git a/src/test/kotlin/g2401_2500/s2468_split_message_based_on_limit/SolutionTest.kt b/src/test/kotlin/g2401_2500/s2468_split_message_based_on_limit/SolutionTest.kt
index 613b6a878..e968b8b09 100644
--- a/src/test/kotlin/g2401_2500/s2468_split_message_based_on_limit/SolutionTest.kt
+++ b/src/test/kotlin/g2401_2500/s2468_split_message_based_on_limit/SolutionTest.kt
@@ -24,9 +24,9 @@ internal class SolutionTest {
                     " m<11/14>",
                     "es<12/14>",
                     "sa<13/14>",
-                    "ge<14/14>"
-                )
-            )
+                    "ge<14/14>",
+                ),
+            ),
         )
     }
 
@@ -34,7 +34,7 @@ internal class SolutionTest {
     fun splitMessage2() {
         assertThat(
             Solution().splitMessage("short message", 15),
-            equalTo(arrayOf<String?>("short mess<1/2>", "age<2/2>"))
+            equalTo(arrayOf<String?>("short mess<1/2>", "age<2/2>")),
         )
     }
 }
diff --git a/src/test/kotlin/g2401_2500/s2469_convert_the_temperature/SolutionTest.kt b/src/test/kotlin/g2401_2500/s2469_convert_the_temperature/SolutionTest.kt
index fd15999e5..84e0f08dc 100644
--- a/src/test/kotlin/g2401_2500/s2469_convert_the_temperature/SolutionTest.kt
+++ b/src/test/kotlin/g2401_2500/s2469_convert_the_temperature/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun convertTemperature() {
         assertThat(
             Solution().convertTemperature(36.50),
-            equalTo(doubleArrayOf(309.65000, 97.70000))
+            equalTo(doubleArrayOf(309.65000, 97.70000)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun convertTemperature2() {
         assertThat(
             Solution().convertTemperature(122.11),
-            equalTo(doubleArrayOf(395.26000, 251.79800))
+            equalTo(doubleArrayOf(395.26000, 251.79800)),
         )
     }
 }
diff --git a/src/test/kotlin/g2401_2500/s2471_minimum_number_of_operations_to_sort_a_binary_tree_by_level/SolutionTest.kt b/src/test/kotlin/g2401_2500/s2471_minimum_number_of_operations_to_sort_a_binary_tree_by_level/SolutionTest.kt
index 46128bab6..b2d8bda8b 100644
--- a/src/test/kotlin/g2401_2500/s2471_minimum_number_of_operations_to_sort_a_binary_tree_by_level/SolutionTest.kt
+++ b/src/test/kotlin/g2401_2500/s2471_minimum_number_of_operations_to_sort_a_binary_tree_by_level/SolutionTest.kt
@@ -14,11 +14,11 @@ internal class SolutionTest {
                     TreeNode.create(
                         mutableListOf(
                             1, 4, 3, 7, 6, 8, 5, null, null, null, null, 9,
-                            null, 10
-                        )
-                    )!!
+                            null, 10,
+                        ),
+                    )!!,
                 ),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
@@ -27,7 +27,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .minimumOperations(TreeNode.create(mutableListOf(1, 3, 2, 7, 6, 5, 4))!!),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
@@ -35,9 +35,9 @@ internal class SolutionTest {
     fun minimumOperations3() {
         assertThat(
             Solution().minimumOperations(
-                TreeNode.create(mutableListOf(1, 2, 3, 4, 5, 6))!!
+                TreeNode.create(mutableListOf(1, 2, 3, 4, 5, 6))!!,
             ),
-            equalTo(0)
+            equalTo(0),
         )
     }
 }
diff --git a/src/test/kotlin/g2401_2500/s2476_closest_nodes_queries_in_a_binary_search_tree/SolutionTest.kt b/src/test/kotlin/g2401_2500/s2476_closest_nodes_queries_in_a_binary_search_tree/SolutionTest.kt
index cc015578d..3afd9d73d 100644
--- a/src/test/kotlin/g2401_2500/s2476_closest_nodes_queries_in_a_binary_search_tree/SolutionTest.kt
+++ b/src/test/kotlin/g2401_2500/s2476_closest_nodes_queries_in_a_binary_search_tree/SolutionTest.kt
@@ -14,14 +14,14 @@ internal class SolutionTest {
                     TreeNode.create(
                         mutableListOf(
                             6, 2, 13, 1, 4, 9, 15, null, null, null, null, null,
-                            null, 14
-                        )
+                            null, 14,
+                        ),
                     ),
-                    mutableListOf(2, 5, 16)
+                    mutableListOf(2, 5, 16),
                 ),
             equalTo(
-                listOf(mutableListOf(2, 2), mutableListOf(4, 6), listOf(15, -1))
-            )
+                listOf(mutableListOf(2, 2), mutableListOf(4, 6), listOf(15, -1)),
+            ),
         )
     }
 
@@ -30,9 +30,10 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .closestNodes(
-                    TreeNode.create(mutableListOf(4, null, 9)), listOf(3)
+                    TreeNode.create(mutableListOf(4, null, 9)),
+                    listOf(3),
                 ),
-            equalTo(listOf(listOf(-1, 4)))
+            equalTo(listOf(listOf(-1, 4))),
         )
     }
 }
diff --git a/src/test/kotlin/g2401_2500/s2477_minimum_fuel_cost_to_report_to_the_capital/SolutionTest.kt b/src/test/kotlin/g2401_2500/s2477_minimum_fuel_cost_to_report_to_the_capital/SolutionTest.kt
index 9201aa310..c64c6f4f0 100644
--- a/src/test/kotlin/g2401_2500/s2477_minimum_fuel_cost_to_report_to_the_capital/SolutionTest.kt
+++ b/src/test/kotlin/g2401_2500/s2477_minimum_fuel_cost_to_report_to_the_capital/SolutionTest.kt
@@ -12,11 +12,11 @@ internal class SolutionTest {
             Solution()
                 .minimumFuelCost(
                     CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
-                        "[0,1],[0,2],[0,3]"
+                        "[0,1],[0,2],[0,3]",
                     ),
-                    5
+                    5,
                 ),
-            equalTo(3L)
+            equalTo(3L),
         )
     }
 
@@ -26,11 +26,11 @@ internal class SolutionTest {
             Solution()
                 .minimumFuelCost(
                     CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
-                        "[3,1],[3,2],[1,0],[0,4],[0,5],[4,6]"
+                        "[3,1],[3,2],[1,0],[0,4],[0,5],[4,6]",
                     ),
-                    2
+                    2,
                 ),
-            equalTo(7L)
+            equalTo(7L),
         )
     }
 
diff --git a/src/test/kotlin/g2401_2500/s2482_difference_between_ones_and_zeros_in_row_and_column/SolutionTest.kt b/src/test/kotlin/g2401_2500/s2482_difference_between_ones_and_zeros_in_row_and_column/SolutionTest.kt
index f777cd9bf..8b1838b66 100644
--- a/src/test/kotlin/g2401_2500/s2482_difference_between_ones_and_zeros_in_row_and_column/SolutionTest.kt
+++ b/src/test/kotlin/g2401_2500/s2482_difference_between_ones_and_zeros_in_row_and_column/SolutionTest.kt
@@ -12,14 +12,14 @@ internal class SolutionTest {
             Solution()
                 .onesMinusZeros(
                     CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
-                        "[0,1,1],[1,0,1],[0,0,1]"
-                    )
+                        "[0,1,1],[1,0,1],[0,0,1]",
+                    ),
                 ),
             equalTo(
                 CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
-                    "[0,0,4],[0,0,4],[-2,-2,2]"
-                )
-            )
+                    "[0,0,4],[0,0,4],[-2,-2,2]",
+                ),
+            ),
         )
     }
 
@@ -29,14 +29,14 @@ internal class SolutionTest {
             Solution()
                 .onesMinusZeros(
                     CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
-                        "[1,1,1],[1,1,1]"
-                    )
+                        "[1,1,1],[1,1,1]",
+                    ),
                 ),
             equalTo(
                 CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
-                    "[5,5,5],[5,5,5]"
-                )
-            )
+                    "[5,5,5],[5,5,5]",
+                ),
+            ),
         )
     }
 }
diff --git a/src/test/kotlin/g2401_2500/s2487_remove_nodes_from_linked_list/SolutionTest.kt b/src/test/kotlin/g2401_2500/s2487_remove_nodes_from_linked_list/SolutionTest.kt
index 3b16e5a94..634b38929 100644
--- a/src/test/kotlin/g2401_2500/s2487_remove_nodes_from_linked_list/SolutionTest.kt
+++ b/src/test/kotlin/g2401_2500/s2487_remove_nodes_from_linked_list/SolutionTest.kt
@@ -12,7 +12,7 @@ internal class SolutionTest {
             Solution()
                 .removeNodes(contructLinkedList(intArrayOf(5, 2, 13, 3, 8)))
                 .toString(),
-            equalTo(contructLinkedList(intArrayOf(13, 8)).toString())
+            equalTo(contructLinkedList(intArrayOf(13, 8)).toString()),
         )
     }
 
@@ -22,7 +22,7 @@ internal class SolutionTest {
             Solution()
                 .removeNodes(contructLinkedList(intArrayOf(1, 1, 1, 1)))
                 .toString(),
-            equalTo(contructLinkedList(intArrayOf(1, 1, 1, 1)).toString())
+            equalTo(contructLinkedList(intArrayOf(1, 1, 1, 1)).toString()),
         )
     }
 }
diff --git a/src/test/kotlin/g2401_2500/s2490_circular_sentence/SolutionTest.kt b/src/test/kotlin/g2401_2500/s2490_circular_sentence/SolutionTest.kt
index 876886c2f..a777a623d 100644
--- a/src/test/kotlin/g2401_2500/s2490_circular_sentence/SolutionTest.kt
+++ b/src/test/kotlin/g2401_2500/s2490_circular_sentence/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun isCircularSentence() {
         assertThat(
             Solution().isCircularSentence("leetcode exercises sound delightful"),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
diff --git a/src/test/kotlin/g2401_2500/s2492_minimum_score_of_a_path_between_two_cities/SolutionTest.kt b/src/test/kotlin/g2401_2500/s2492_minimum_score_of_a_path_between_two_cities/SolutionTest.kt
index 97d093263..6b62404bd 100644
--- a/src/test/kotlin/g2401_2500/s2492_minimum_score_of_a_path_between_two_cities/SolutionTest.kt
+++ b/src/test/kotlin/g2401_2500/s2492_minimum_score_of_a_path_between_two_cities/SolutionTest.kt
@@ -13,10 +13,10 @@ internal class SolutionTest {
                 .minScore(
                     4,
                     CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
-                        "[1,2,9],[2,3,6],[2,4,5],[1,4,7]"
-                    )
+                        "[1,2,9],[2,3,6],[2,4,5],[1,4,7]",
+                    ),
                 ),
-            equalTo(5)
+            equalTo(5),
         )
     }
 
@@ -27,10 +27,10 @@ internal class SolutionTest {
                 .minScore(
                     4,
                     CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
-                        "[1,2,2],[1,3,4],[3,4,7]"
-                    )
+                        "[1,2,2],[1,3,4],[3,4,7]",
+                    ),
                 ),
-            equalTo(2)
+            equalTo(2),
         )
     }
 }
diff --git a/src/test/kotlin/g2401_2500/s2493_divide_nodes_into_the_maximum_number_of_groups/SolutionTest.kt b/src/test/kotlin/g2401_2500/s2493_divide_nodes_into_the_maximum_number_of_groups/SolutionTest.kt
index 5355d291c..b4ba599db 100644
--- a/src/test/kotlin/g2401_2500/s2493_divide_nodes_into_the_maximum_number_of_groups/SolutionTest.kt
+++ b/src/test/kotlin/g2401_2500/s2493_divide_nodes_into_the_maximum_number_of_groups/SolutionTest.kt
@@ -13,10 +13,10 @@ internal class SolutionTest {
                 .magnificentSets(
                     6,
                     CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
-                        "[1,2],[1,4],[1,5],[2,6],[2,3],[4,6]"
-                    )
+                        "[1,2],[1,4],[1,5],[2,6],[2,3],[4,6]",
+                    ),
                 ),
-            equalTo(4)
+            equalTo(4),
         )
     }
 
@@ -27,10 +27,10 @@ internal class SolutionTest {
                 .magnificentSets(
                     3,
                     CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
-                        "[1,2],[2,3],[3,1]"
-                    )
+                        "[1,2],[2,3],[3,1]",
+                    ),
                 ),
-            equalTo(-1)
+            equalTo(-1),
         )
     }
 }
diff --git a/src/test/kotlin/g2401_2500/s2496_maximum_value_of_a_string_in_an_array/SolutionTest.kt b/src/test/kotlin/g2401_2500/s2496_maximum_value_of_a_string_in_an_array/SolutionTest.kt
index 3246e698f..d5837ac34 100644
--- a/src/test/kotlin/g2401_2500/s2496_maximum_value_of_a_string_in_an_array/SolutionTest.kt
+++ b/src/test/kotlin/g2401_2500/s2496_maximum_value_of_a_string_in_an_array/SolutionTest.kt
@@ -9,14 +9,15 @@ internal class SolutionTest {
     fun maximumValue() {
         assertThat(
             Solution().maximumValue(arrayOf("alic3", "bob", "3", "4", "00000")),
-            equalTo(5)
+            equalTo(5),
         )
     }
 
     @Test
     fun maximumValue2() {
         assertThat(
-            Solution().maximumValue(arrayOf("1", "01", "001", "0001")), equalTo(1)
+            Solution().maximumValue(arrayOf("1", "01", "001", "0001")),
+            equalTo(1),
         )
     }
 }
diff --git a/src/test/kotlin/g2401_2500/s2497_maximum_star_sum_of_a_graph/SolutionTest.kt b/src/test/kotlin/g2401_2500/s2497_maximum_star_sum_of_a_graph/SolutionTest.kt
index dc4837053..c4b4d24e2 100644
--- a/src/test/kotlin/g2401_2500/s2497_maximum_star_sum_of_a_graph/SolutionTest.kt
+++ b/src/test/kotlin/g2401_2500/s2497_maximum_star_sum_of_a_graph/SolutionTest.kt
@@ -17,11 +17,11 @@ internal class SolutionTest {
                         intArrayOf(1, 3),
                         intArrayOf(3, 4),
                         intArrayOf(3, 5),
-                        intArrayOf(3, 6)
+                        intArrayOf(3, 6),
                     ),
-                    2
+                    2,
                 ),
-            equalTo(16)
+            equalTo(16),
         )
     }
 
diff --git a/src/test/kotlin/g2401_2500/s2499_minimum_total_cost_to_make_arrays_unequal/SolutionTest.kt b/src/test/kotlin/g2401_2500/s2499_minimum_total_cost_to_make_arrays_unequal/SolutionTest.kt
index 66c8bec9a..33f93d142 100644
--- a/src/test/kotlin/g2401_2500/s2499_minimum_total_cost_to_make_arrays_unequal/SolutionTest.kt
+++ b/src/test/kotlin/g2401_2500/s2499_minimum_total_cost_to_make_arrays_unequal/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .minimumTotalCost(intArrayOf(1, 2, 3, 4, 5), intArrayOf(1, 2, 3, 4, 5)),
-            equalTo(10L)
+            equalTo(10L),
         )
     }
 
@@ -19,7 +19,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .minimumTotalCost(intArrayOf(2, 2, 2, 1, 3), intArrayOf(1, 2, 2, 3, 3)),
-            equalTo(10L)
+            equalTo(10L),
         )
     }
 
@@ -27,7 +27,7 @@ internal class SolutionTest {
     fun minimumTotalCost3() {
         assertThat(
             Solution().minimumTotalCost(intArrayOf(1, 2, 2), intArrayOf(1, 2, 2)),
-            equalTo(-1L)
+            equalTo(-1L),
         )
     }
 }
diff --git a/src/test/kotlin/g2401_2500/s2500_delete_greatest_value_in_each_row/SolutionTest.kt b/src/test/kotlin/g2401_2500/s2500_delete_greatest_value_in_each_row/SolutionTest.kt
index 59a6f294c..ba5dad3be 100644
--- a/src/test/kotlin/g2401_2500/s2500_delete_greatest_value_in_each_row/SolutionTest.kt
+++ b/src/test/kotlin/g2401_2500/s2500_delete_greatest_value_in_each_row/SolutionTest.kt
@@ -8,7 +8,8 @@ internal class SolutionTest {
     @Test
     fun deleteGreatestValue() {
         assertThat(
-            Solution().deleteGreatestValue(arrayOf(intArrayOf(1, 2, 4), intArrayOf(3, 3, 1))), equalTo(8)
+            Solution().deleteGreatestValue(arrayOf(intArrayOf(1, 2, 4), intArrayOf(3, 3, 1))),
+            equalTo(8),
         )
     }
 
diff --git a/src/test/kotlin/g2501_2600/s2503_maximum_number_of_points_from_grid_queries/SolutionTest.kt b/src/test/kotlin/g2501_2600/s2503_maximum_number_of_points_from_grid_queries/SolutionTest.kt
index 6f6041a26..431f6fd51 100644
--- a/src/test/kotlin/g2501_2600/s2503_maximum_number_of_points_from_grid_queries/SolutionTest.kt
+++ b/src/test/kotlin/g2501_2600/s2503_maximum_number_of_points_from_grid_queries/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .maxPoints(arrayOf(intArrayOf(1, 2, 3), intArrayOf(2, 5, 7), intArrayOf(3, 5, 1)), intArrayOf(5, 6, 2)),
-            equalTo(intArrayOf(5, 8, 1))
+            equalTo(intArrayOf(5, 8, 1)),
         )
     }
 
@@ -18,7 +18,7 @@ internal class SolutionTest {
     fun maxPoints2() {
         assertThat(
             Solution().maxPoints(arrayOf(intArrayOf(5, 2, 1), intArrayOf(1, 1, 2)), intArrayOf(3)),
-            equalTo(intArrayOf(0))
+            equalTo(intArrayOf(0)),
         )
     }
 }
diff --git a/src/test/kotlin/g2501_2600/s2506_count_pairs_of_similar_strings/SolutionTest.kt b/src/test/kotlin/g2501_2600/s2506_count_pairs_of_similar_strings/SolutionTest.kt
index 4846de0ea..47f147d41 100644
--- a/src/test/kotlin/g2501_2600/s2506_count_pairs_of_similar_strings/SolutionTest.kt
+++ b/src/test/kotlin/g2501_2600/s2506_count_pairs_of_similar_strings/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun similarPairs() {
         assertThat(
             Solution().similarPairs(arrayOf("aba", "aabb", "abcd", "bac", "aabc")),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
diff --git a/src/test/kotlin/g2501_2600/s2508_add_edges_to_make_degrees_of_all_nodes_even/SolutionTest.kt b/src/test/kotlin/g2501_2600/s2508_add_edges_to_make_degrees_of_all_nodes_even/SolutionTest.kt
index 938137bc2..5eb71cf25 100644
--- a/src/test/kotlin/g2501_2600/s2508_add_edges_to_make_degrees_of_all_nodes_even/SolutionTest.kt
+++ b/src/test/kotlin/g2501_2600/s2508_add_edges_to_make_degrees_of_all_nodes_even/SolutionTest.kt
@@ -19,11 +19,11 @@ internal class SolutionTest {
                             intArrayOf(3, 4),
                             intArrayOf(4, 2),
                             intArrayOf(1, 4),
-                            intArrayOf(2, 5)
-                        )
-                    )
+                            intArrayOf(2, 5),
+                        ),
+                    ),
                 ),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
@@ -31,7 +31,7 @@ internal class SolutionTest {
     fun isPossible2() {
         assertThat(
             Solution().isPossible(4, getLists(arrayOf(intArrayOf(1, 2), intArrayOf(3, 4)))),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
@@ -40,7 +40,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .isPossible(4, getLists(arrayOf(intArrayOf(1, 2), intArrayOf(1, 3), intArrayOf(1, 4)))),
-            equalTo(false)
+            equalTo(false),
         )
     }
 
@@ -259,11 +259,11 @@ internal class SolutionTest {
                             intArrayOf(2, 7),
                             intArrayOf(8, 20),
                             intArrayOf(5, 14),
-                            intArrayOf(4, 16)
-                        )
-                    )
+                            intArrayOf(4, 16),
+                        ),
+                    ),
                 ),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
@@ -279,11 +279,11 @@ internal class SolutionTest {
                             intArrayOf(1, 3),
                             intArrayOf(1, 4),
                             intArrayOf(4, 5),
-                            intArrayOf(5, 2)
-                        )
-                    )
+                            intArrayOf(5, 2),
+                        ),
+                    ),
                 ),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
@@ -293,9 +293,9 @@ internal class SolutionTest {
             Solution()
                 .isPossible(
                     4,
-                    getLists(arrayOf(intArrayOf(4, 1), intArrayOf(3, 2), intArrayOf(2, 4), intArrayOf(1, 3)))
+                    getLists(arrayOf(intArrayOf(4, 1), intArrayOf(3, 2), intArrayOf(2, 4), intArrayOf(1, 3))),
                 ),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
@@ -305,9 +305,9 @@ internal class SolutionTest {
             Solution()
                 .isPossible(
                     4,
-                    getLists(arrayOf(intArrayOf(1, 2), intArrayOf(2, 3), intArrayOf(2, 4), intArrayOf(3, 4)))
+                    getLists(arrayOf(intArrayOf(1, 2), intArrayOf(2, 3), intArrayOf(2, 4), intArrayOf(3, 4))),
                 ),
-            equalTo(false)
+            equalTo(false),
         )
     }
 }
diff --git a/src/test/kotlin/g2501_2600/s2509_cycle_length_queries_in_a_tree/SolutionTest.kt b/src/test/kotlin/g2501_2600/s2509_cycle_length_queries_in_a_tree/SolutionTest.kt
index 036a847fe..0a95c6dbb 100644
--- a/src/test/kotlin/g2501_2600/s2509_cycle_length_queries_in_a_tree/SolutionTest.kt
+++ b/src/test/kotlin/g2501_2600/s2509_cycle_length_queries_in_a_tree/SolutionTest.kt
@@ -9,14 +9,15 @@ internal class SolutionTest {
     fun cycleLengthQueries() {
         assertThat(
             Solution().cycleLengthQueries(3, arrayOf(intArrayOf(5, 3), intArrayOf(4, 7), intArrayOf(2, 3))),
-            equalTo(intArrayOf(4, 5, 3))
+            equalTo(intArrayOf(4, 5, 3)),
         )
     }
 
     @Test
     fun cycleLengthQueries2() {
         assertThat(
-            Solution().cycleLengthQueries(2, arrayOf(intArrayOf(1, 2))), equalTo(intArrayOf(2))
+            Solution().cycleLengthQueries(2, arrayOf(intArrayOf(1, 2))),
+            equalTo(intArrayOf(2)),
         )
     }
 }
diff --git a/src/test/kotlin/g2501_2600/s2511_maximum_enemy_forts_that_can_be_captured/SolutionTest.kt b/src/test/kotlin/g2501_2600/s2511_maximum_enemy_forts_that_can_be_captured/SolutionTest.kt
index 12c4b8289..211741ac0 100644
--- a/src/test/kotlin/g2501_2600/s2511_maximum_enemy_forts_that_can_be_captured/SolutionTest.kt
+++ b/src/test/kotlin/g2501_2600/s2511_maximum_enemy_forts_that_can_be_captured/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun captureForts() {
         assertThat(
             Solution().captureForts(intArrayOf(1, 0, 0, -1, 0, 0, 0, 0, 1)),
-            equalTo(4)
+            equalTo(4),
         )
     }
 
diff --git a/src/test/kotlin/g2501_2600/s2512_reward_top_k_students/SolutionTest.kt b/src/test/kotlin/g2501_2600/s2512_reward_top_k_students/SolutionTest.kt
index f3c59f22e..c16100ac8 100644
--- a/src/test/kotlin/g2501_2600/s2512_reward_top_k_students/SolutionTest.kt
+++ b/src/test/kotlin/g2501_2600/s2512_reward_top_k_students/SolutionTest.kt
@@ -14,9 +14,9 @@ internal class SolutionTest {
                     arrayOf("not"),
                     arrayOf("this student is studious", "the student is smart"),
                     intArrayOf(1, 2),
-                    2
+                    2,
                 ),
-            equalTo(mutableListOf(1, 2))
+            equalTo(mutableListOf(1, 2)),
         )
     }
 
@@ -25,14 +25,16 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .topStudents(
-                    arrayOf("smart", "brilliant", "studious"), arrayOf("not"),
+                    arrayOf("smart", "brilliant", "studious"),
+                    arrayOf("not"),
                     arrayOf(
-                        "this student is not studious", "the student is smart"
+                        "this student is not studious",
+                        "the student is smart",
                     ),
                     intArrayOf(1, 2),
-                    2
+                    2,
                 ),
-            equalTo(mutableListOf(2, 1))
+            equalTo(mutableListOf(2, 1)),
         )
     }
 }
diff --git a/src/test/kotlin/g2501_2600/s2515_shortest_distance_to_target_string_in_a_circular_array/SolutionTest.kt b/src/test/kotlin/g2501_2600/s2515_shortest_distance_to_target_string_in_a_circular_array/SolutionTest.kt
index bc436dca2..5790e1685 100644
--- a/src/test/kotlin/g2501_2600/s2515_shortest_distance_to_target_string_in_a_circular_array/SolutionTest.kt
+++ b/src/test/kotlin/g2501_2600/s2515_shortest_distance_to_target_string_in_a_circular_array/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .closetTarget(arrayOf("hello", "i", "am", "leetcode", "hello"), "hello", 1),
-            equalTo(1)
+            equalTo(1),
         )
     }
 
@@ -18,7 +18,7 @@ internal class SolutionTest {
     fun closetTarget2() {
         assertThat(
             Solution().closetTarget(arrayOf("a", "b", "leetcode"), "leetcode", 0),
-            equalTo(1)
+            equalTo(1),
         )
     }
 
@@ -26,7 +26,7 @@ internal class SolutionTest {
     fun closetTarget3() {
         assertThat(
             Solution().closetTarget(arrayOf("i", "eat", "leetcode"), "ate", 0),
-            equalTo(-1)
+            equalTo(-1),
         )
     }
 }
diff --git a/src/test/kotlin/g2501_2600/s2517_maximum_tastiness_of_candy_basket/SolutionTest.kt b/src/test/kotlin/g2501_2600/s2517_maximum_tastiness_of_candy_basket/SolutionTest.kt
index 271ce85c4..4a5420040 100644
--- a/src/test/kotlin/g2501_2600/s2517_maximum_tastiness_of_candy_basket/SolutionTest.kt
+++ b/src/test/kotlin/g2501_2600/s2517_maximum_tastiness_of_candy_basket/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun maximumTastiness() {
         assertThat(
             Solution().maximumTastiness(intArrayOf(13, 5, 1, 8, 21, 2), 3),
-            equalTo(8)
+            equalTo(8),
         )
     }
 
diff --git a/src/test/kotlin/g2501_2600/s2521_distinct_prime_factors_of_product_of_array/SolutionTest.kt b/src/test/kotlin/g2501_2600/s2521_distinct_prime_factors_of_product_of_array/SolutionTest.kt
index bb4a173f6..d5b35409f 100644
--- a/src/test/kotlin/g2501_2600/s2521_distinct_prime_factors_of_product_of_array/SolutionTest.kt
+++ b/src/test/kotlin/g2501_2600/s2521_distinct_prime_factors_of_product_of_array/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun distinctPrimeFactors() {
         assertThat(
             Solution().distinctPrimeFactors(intArrayOf(2, 4, 3, 7, 10, 6)),
-            equalTo(4)
+            equalTo(4),
         )
     }
 
diff --git a/src/test/kotlin/g2501_2600/s2527_find_xor_beauty_of_array/SolutionTest.kt b/src/test/kotlin/g2501_2600/s2527_find_xor_beauty_of_array/SolutionTest.kt
index 9972cca8d..6ee959d4a 100644
--- a/src/test/kotlin/g2501_2600/s2527_find_xor_beauty_of_array/SolutionTest.kt
+++ b/src/test/kotlin/g2501_2600/s2527_find_xor_beauty_of_array/SolutionTest.kt
@@ -14,7 +14,7 @@ internal class SolutionTest {
     fun xorBeauty2() {
         assertThat(
             Solution().xorBeauty(intArrayOf(15, 45, 20, 2, 34, 35, 5, 44, 32, 30)),
-            equalTo(34)
+            equalTo(34),
         )
     }
 }
diff --git a/src/test/kotlin/g2501_2600/s2532_time_to_cross_a_bridge/SolutionTest.kt b/src/test/kotlin/g2501_2600/s2532_time_to_cross_a_bridge/SolutionTest.kt
index 6643fe9de..a328ac79a 100644
--- a/src/test/kotlin/g2501_2600/s2532_time_to_cross_a_bridge/SolutionTest.kt
+++ b/src/test/kotlin/g2501_2600/s2532_time_to_cross_a_bridge/SolutionTest.kt
@@ -10,9 +10,11 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .findCrossingTime(
-                    1, 3, arrayOf(intArrayOf(1, 1, 2, 1), intArrayOf(1, 1, 3, 1), intArrayOf(1, 1, 4, 1))
+                    1,
+                    3,
+                    arrayOf(intArrayOf(1, 1, 2, 1), intArrayOf(1, 1, 3, 1), intArrayOf(1, 1, 4, 1)),
                 ),
-            equalTo(6)
+            equalTo(6),
         )
     }
 
@@ -20,7 +22,7 @@ internal class SolutionTest {
     fun findCrossingTime2() {
         assertThat(
             Solution().findCrossingTime(3, 2, arrayOf(intArrayOf(1, 9, 1, 8), intArrayOf(10, 10, 10, 10))),
-            equalTo(50)
+            equalTo(50),
         )
     }
 }
diff --git a/src/test/kotlin/g2501_2600/s2536_increment_submatrices_by_one/SolutionTest.kt b/src/test/kotlin/g2501_2600/s2536_increment_submatrices_by_one/SolutionTest.kt
index 9e5833e3e..e814c3ffa 100644
--- a/src/test/kotlin/g2501_2600/s2536_increment_submatrices_by_one/SolutionTest.kt
+++ b/src/test/kotlin/g2501_2600/s2536_increment_submatrices_by_one/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun rangeAddQueries() {
         assertThat(
             Solution().rangeAddQueries(3, arrayOf(intArrayOf(1, 1, 2, 2), intArrayOf(0, 0, 1, 1))),
-            equalTo(arrayOf(intArrayOf(1, 1, 0), intArrayOf(1, 2, 1), intArrayOf(0, 1, 1)))
+            equalTo(arrayOf(intArrayOf(1, 1, 0), intArrayOf(1, 2, 1), intArrayOf(0, 1, 1))),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun rangeAddQueries2() {
         assertThat(
             Solution().rangeAddQueries(2, arrayOf(intArrayOf(0, 0, 1, 1))),
-            equalTo(arrayOf(intArrayOf(1, 1), intArrayOf(1, 1)))
+            equalTo(arrayOf(intArrayOf(1, 1), intArrayOf(1, 1))),
         )
     }
 }
diff --git a/src/test/kotlin/g2501_2600/s2538_difference_between_maximum_and_minimum_price_sum/SolutionTest.kt b/src/test/kotlin/g2501_2600/s2538_difference_between_maximum_and_minimum_price_sum/SolutionTest.kt
index 759c68a73..46968ae3f 100644
--- a/src/test/kotlin/g2501_2600/s2538_difference_between_maximum_and_minimum_price_sum/SolutionTest.kt
+++ b/src/test/kotlin/g2501_2600/s2538_difference_between_maximum_and_minimum_price_sum/SolutionTest.kt
@@ -13,11 +13,11 @@ internal class SolutionTest {
                 .maxOutput(
                     6,
                     CommonUtils.convertLeetCodeRegularRectangleArrayInputIntoJavaArray(
-                        "[0,1],[1,2],[1,3],[3,4],[3,5]"
+                        "[0,1],[1,2],[1,3],[3,4],[3,5]",
                     ),
-                    intArrayOf(9, 8, 7, 6, 10, 5)
+                    intArrayOf(9, 8, 7, 6, 10, 5),
                 ),
-            equalTo(24L)
+            equalTo(24L),
         )
     }
 
@@ -28,11 +28,11 @@ internal class SolutionTest {
                 .maxOutput(
                     3,
                     CommonUtils.convertLeetCodeRegularRectangleArrayInputIntoJavaArray(
-                        "[0,1],[1,2]"
+                        "[0,1],[1,2]",
                     ),
-                    intArrayOf(1, 1, 1)
+                    intArrayOf(1, 1, 1),
                 ),
-            equalTo(2L)
+            equalTo(2L),
         )
     }
 }
diff --git a/src/test/kotlin/g2501_2600/s2540_minimum_common_value/SolutionTest.kt b/src/test/kotlin/g2501_2600/s2540_minimum_common_value/SolutionTest.kt
index a0ee6abbe..758c6f944 100644
--- a/src/test/kotlin/g2501_2600/s2540_minimum_common_value/SolutionTest.kt
+++ b/src/test/kotlin/g2501_2600/s2540_minimum_common_value/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun common() {
         assertThat(
             Solution().getCommon(intArrayOf(1, 2, 3), intArrayOf(2, 4)),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun common2() {
         assertThat(
             Solution().getCommon(intArrayOf(1, 2, 3, 6), intArrayOf(2, 3, 4, 5)),
-            equalTo(2)
+            equalTo(2),
         )
     }
 }
diff --git a/src/test/kotlin/g2501_2600/s2541_minimum_operations_to_make_array_equal_ii/SolutionTest.kt b/src/test/kotlin/g2501_2600/s2541_minimum_operations_to_make_array_equal_ii/SolutionTest.kt
index 4cd9072c8..8845c2fdb 100644
--- a/src/test/kotlin/g2501_2600/s2541_minimum_operations_to_make_array_equal_ii/SolutionTest.kt
+++ b/src/test/kotlin/g2501_2600/s2541_minimum_operations_to_make_array_equal_ii/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun minOperations() {
         assertThat(
             Solution().minOperations(intArrayOf(4, 3, 1, 4), intArrayOf(1, 3, 7, 1), 3),
-            equalTo(2L)
+            equalTo(2L),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun minOperations2() {
         assertThat(
             Solution().minOperations(intArrayOf(3, 8, 5, 2), intArrayOf(2, 4, 1, 6), 1),
-            equalTo(-1L)
+            equalTo(-1L),
         )
     }
 }
diff --git a/src/test/kotlin/g2501_2600/s2542_maximum_subsequence_score/SolutionTest.kt b/src/test/kotlin/g2501_2600/s2542_maximum_subsequence_score/SolutionTest.kt
index 1a511d0af..9550b3afa 100644
--- a/src/test/kotlin/g2501_2600/s2542_maximum_subsequence_score/SolutionTest.kt
+++ b/src/test/kotlin/g2501_2600/s2542_maximum_subsequence_score/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun maxScore() {
         assertThat(
             Solution().maxScore(intArrayOf(1, 3, 3, 2), intArrayOf(2, 1, 3, 4), 3),
-            equalTo(12L)
+            equalTo(12L),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun maxScore2() {
         assertThat(
             Solution().maxScore(intArrayOf(4, 2, 3, 1, 1), intArrayOf(7, 5, 10, 9, 6), 1),
-            equalTo(30L)
+            equalTo(30L),
         )
     }
 }
diff --git a/src/test/kotlin/g2501_2600/s2545_sort_the_students_by_their_kth_score/SolutionTest.kt b/src/test/kotlin/g2501_2600/s2545_sort_the_students_by_their_kth_score/SolutionTest.kt
index 86228f1cf..025c582de 100644
--- a/src/test/kotlin/g2501_2600/s2545_sort_the_students_by_their_kth_score/SolutionTest.kt
+++ b/src/test/kotlin/g2501_2600/s2545_sort_the_students_by_their_kth_score/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .sortTheStudents(arrayOf(intArrayOf(10, 6, 9, 1), intArrayOf(7, 5, 11, 2), intArrayOf(4, 8, 3, 15)), 2),
-            equalTo(arrayOf(intArrayOf(7, 5, 11, 2), intArrayOf(10, 6, 9, 1), intArrayOf(4, 8, 3, 15)))
+            equalTo(arrayOf(intArrayOf(7, 5, 11, 2), intArrayOf(10, 6, 9, 1), intArrayOf(4, 8, 3, 15))),
         )
     }
 
@@ -18,7 +18,7 @@ internal class SolutionTest {
     fun sortTheStudents2() {
         assertThat(
             Solution().sortTheStudents(arrayOf(intArrayOf(3, 4), intArrayOf(5, 6)), 0),
-            equalTo(arrayOf(intArrayOf(5, 6), intArrayOf(3, 4)))
+            equalTo(arrayOf(intArrayOf(5, 6), intArrayOf(3, 4))),
         )
     }
 }
diff --git a/src/test/kotlin/g2501_2600/s2546_apply_bitwise_operations_to_make_strings_equal/SolutionTest.kt b/src/test/kotlin/g2501_2600/s2546_apply_bitwise_operations_to_make_strings_equal/SolutionTest.kt
index 24e8aeec1..d857b5caf 100644
--- a/src/test/kotlin/g2501_2600/s2546_apply_bitwise_operations_to_make_strings_equal/SolutionTest.kt
+++ b/src/test/kotlin/g2501_2600/s2546_apply_bitwise_operations_to_make_strings_equal/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun makeStringsEqual() {
         assertThat(
             Solution().makeStringsEqual("1010", "0110"),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun makeStringsEqual2() {
         assertThat(
             Solution().makeStringsEqual("11", "00"),
-            equalTo(false)
+            equalTo(false),
         )
     }
 }
diff --git a/src/test/kotlin/g2501_2600/s2547_minimum_cost_to_split_an_array/SolutionTest.kt b/src/test/kotlin/g2501_2600/s2547_minimum_cost_to_split_an_array/SolutionTest.kt
index 977742248..eb9a8e3fa 100644
--- a/src/test/kotlin/g2501_2600/s2547_minimum_cost_to_split_an_array/SolutionTest.kt
+++ b/src/test/kotlin/g2501_2600/s2547_minimum_cost_to_split_an_array/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun minCost() {
         assertThat(
             Solution().minCost(intArrayOf(1, 2, 1, 2, 1, 3, 3), 2),
-            equalTo(8)
+            equalTo(8),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun minCost2() {
         assertThat(
             Solution().minCost(intArrayOf(1, 2, 1, 2, 1), 2),
-            equalTo(6)
+            equalTo(6),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun minCost3() {
         assertThat(
             Solution().minCost(intArrayOf(1, 2, 1, 2, 1), 5),
-            equalTo(10)
+            equalTo(10),
         )
     }
 }
diff --git a/src/test/kotlin/g2501_2600/s2549_count_distinct_numbers_on_board/SolutionTest.kt b/src/test/kotlin/g2501_2600/s2549_count_distinct_numbers_on_board/SolutionTest.kt
index ce14b97f4..e145585b6 100644
--- a/src/test/kotlin/g2501_2600/s2549_count_distinct_numbers_on_board/SolutionTest.kt
+++ b/src/test/kotlin/g2501_2600/s2549_count_distinct_numbers_on_board/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun distinctIntegers() {
         assertThat(
             Solution().distinctIntegers(5),
-            equalTo(4)
+            equalTo(4),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun distinctIntegers2() {
         assertThat(
             Solution().distinctIntegers(3),
-            equalTo(2)
+            equalTo(2),
         )
     }
 }
diff --git a/src/test/kotlin/g2501_2600/s2550_count_collisions_of_monkeys_on_a_polygon/SolutionTest.kt b/src/test/kotlin/g2501_2600/s2550_count_collisions_of_monkeys_on_a_polygon/SolutionTest.kt
index ae03dd12c..6a3fb1ced 100644
--- a/src/test/kotlin/g2501_2600/s2550_count_collisions_of_monkeys_on_a_polygon/SolutionTest.kt
+++ b/src/test/kotlin/g2501_2600/s2550_count_collisions_of_monkeys_on_a_polygon/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun monkeyMove() {
         assertThat(
             Solution().monkeyMove(3),
-            equalTo(6)
+            equalTo(6),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun monkeyMove2() {
         assertThat(
             Solution().monkeyMove(4),
-            equalTo(14)
+            equalTo(14),
         )
     }
 }
diff --git a/src/test/kotlin/g2501_2600/s2551_put_marbles_in_bags/SolutionTest.kt b/src/test/kotlin/g2501_2600/s2551_put_marbles_in_bags/SolutionTest.kt
index 68b0682bb..5a1d56b2b 100644
--- a/src/test/kotlin/g2501_2600/s2551_put_marbles_in_bags/SolutionTest.kt
+++ b/src/test/kotlin/g2501_2600/s2551_put_marbles_in_bags/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun putMarbles() {
         assertThat(
             Solution().putMarbles(intArrayOf(1, 3, 5, 1), 2),
-            equalTo(4)
+            equalTo(4),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun putMarbles2() {
         assertThat(
             Solution().putMarbles(intArrayOf(1, 3), 2),
-            equalTo(0)
+            equalTo(0),
         )
     }
 }
diff --git a/src/test/kotlin/g2501_2600/s2556_disconnect_path_in_a_binary_matrix_by_at_most_one_flip/SolutionTest.kt b/src/test/kotlin/g2501_2600/s2556_disconnect_path_in_a_binary_matrix_by_at_most_one_flip/SolutionTest.kt
index 408bdb743..6b01aaa21 100644
--- a/src/test/kotlin/g2501_2600/s2556_disconnect_path_in_a_binary_matrix_by_at_most_one_flip/SolutionTest.kt
+++ b/src/test/kotlin/g2501_2600/s2556_disconnect_path_in_a_binary_matrix_by_at_most_one_flip/SolutionTest.kt
@@ -11,10 +11,11 @@ internal class SolutionTest {
             Solution().isPossibleToCutPath(
                 arrayOf(
                     intArrayOf(1, 1, 1),
-                    intArrayOf(1, 0, 0), intArrayOf(1, 1, 1)
-                )
+                    intArrayOf(1, 0, 0),
+                    intArrayOf(1, 1, 1),
+                ),
             ),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
@@ -23,10 +24,12 @@ internal class SolutionTest {
         assertThat(
             Solution().isPossibleToCutPath(
                 arrayOf(
-                    intArrayOf(1, 1, 1), intArrayOf(1, 0, 1), intArrayOf(1, 1, 1)
-                )
+                    intArrayOf(1, 1, 1),
+                    intArrayOf(1, 0, 1),
+                    intArrayOf(1, 1, 1),
+                ),
             ),
-            equalTo(false)
+            equalTo(false),
         )
     }
 }
diff --git a/src/test/kotlin/g2501_2600/s2558_take_gifts_from_the_richest_pile/SolutionTest.kt b/src/test/kotlin/g2501_2600/s2558_take_gifts_from_the_richest_pile/SolutionTest.kt
index 058968f0b..5935a1d53 100644
--- a/src/test/kotlin/g2501_2600/s2558_take_gifts_from_the_richest_pile/SolutionTest.kt
+++ b/src/test/kotlin/g2501_2600/s2558_take_gifts_from_the_richest_pile/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun pickGifts() {
         assertThat(
             Solution().pickGifts(intArrayOf(25, 64, 9, 4, 100), 4),
-            equalTo(29)
+            equalTo(29),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun pickGifts2() {
         assertThat(
             Solution().pickGifts(intArrayOf(1, 1, 1, 1), 4),
-            equalTo(4)
+            equalTo(4),
         )
     }
 }
diff --git a/src/test/kotlin/g2501_2600/s2559_count_vowel_strings_in_ranges/SolutionTest.kt b/src/test/kotlin/g2501_2600/s2559_count_vowel_strings_in_ranges/SolutionTest.kt
index abda5bb81..0d036bd99 100644
--- a/src/test/kotlin/g2501_2600/s2559_count_vowel_strings_in_ranges/SolutionTest.kt
+++ b/src/test/kotlin/g2501_2600/s2559_count_vowel_strings_in_ranges/SolutionTest.kt
@@ -12,10 +12,11 @@ internal class SolutionTest {
                 arrayOf("aba", "bcb", "ece", "aa", "e"),
                 arrayOf(
                     intArrayOf(0, 2),
-                    intArrayOf(1, 4), intArrayOf(1, 1)
-                )
+                    intArrayOf(1, 4),
+                    intArrayOf(1, 1),
+                ),
             ),
-            equalTo(intArrayOf(2, 3, 0))
+            equalTo(intArrayOf(2, 3, 0)),
         )
     }
 
@@ -25,11 +26,12 @@ internal class SolutionTest {
             Solution().vowelStrings(
                 arrayOf("a", "e", "i"),
                 arrayOf(
-                    intArrayOf(0, 2), intArrayOf(0, 1),
-                    intArrayOf(2, 2)
-                )
+                    intArrayOf(0, 2),
+                    intArrayOf(0, 1),
+                    intArrayOf(2, 2),
+                ),
             ),
-            equalTo(intArrayOf(3, 2, 1))
+            equalTo(intArrayOf(3, 2, 1)),
         )
     }
 }
diff --git a/src/test/kotlin/g2501_2600/s2560_house_robber_iv/SolutionTest.kt b/src/test/kotlin/g2501_2600/s2560_house_robber_iv/SolutionTest.kt
index 79c8efa71..2a9cc4f3b 100644
--- a/src/test/kotlin/g2501_2600/s2560_house_robber_iv/SolutionTest.kt
+++ b/src/test/kotlin/g2501_2600/s2560_house_robber_iv/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun minCapability() {
         assertThat(
             Solution().minCapability(intArrayOf(2, 3, 5, 9), 2),
-            equalTo(5)
+            equalTo(5),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun minCapability2() {
         assertThat(
             Solution().minCapability(intArrayOf(2, 7, 9, 3, 1), 2),
-            equalTo(2)
+            equalTo(2),
         )
     }
 }
diff --git a/src/test/kotlin/g2501_2600/s2561_rearranging_fruits/SolutionTest.kt b/src/test/kotlin/g2501_2600/s2561_rearranging_fruits/SolutionTest.kt
index 8df580abb..99c2994d4 100644
--- a/src/test/kotlin/g2501_2600/s2561_rearranging_fruits/SolutionTest.kt
+++ b/src/test/kotlin/g2501_2600/s2561_rearranging_fruits/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun minCost() {
         assertThat(
             Solution().minCost(intArrayOf(4, 2, 2, 2), intArrayOf(1, 4, 1, 2)),
-            equalTo(1)
+            equalTo(1),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun minCost2() {
         assertThat(
             Solution().minCost(intArrayOf(2, 3, 4, 1), intArrayOf(3, 2, 5, 1)),
-            equalTo(-1)
+            equalTo(-1),
         )
     }
 }
diff --git a/src/test/kotlin/g2501_2600/s2562_find_the_array_concatenation_value/SolutionTest.kt b/src/test/kotlin/g2501_2600/s2562_find_the_array_concatenation_value/SolutionTest.kt
index 2dea01a15..f04f80ec2 100644
--- a/src/test/kotlin/g2501_2600/s2562_find_the_array_concatenation_value/SolutionTest.kt
+++ b/src/test/kotlin/g2501_2600/s2562_find_the_array_concatenation_value/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun findTheArrayConcVal() {
         assertThat(
             Solution().findTheArrayConcVal(intArrayOf(7, 52, 2, 4)),
-            equalTo(596)
+            equalTo(596),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun findTheArrayConcVal2() {
         assertThat(
             Solution().findTheArrayConcVal(intArrayOf(5, 14, 13, 8, 12)),
-            equalTo(673)
+            equalTo(673),
         )
     }
 }
diff --git a/src/test/kotlin/g2501_2600/s2563_count_the_number_of_fair_pairs/SolutionTest.kt b/src/test/kotlin/g2501_2600/s2563_count_the_number_of_fair_pairs/SolutionTest.kt
index 98ebbac4f..91d3421b4 100644
--- a/src/test/kotlin/g2501_2600/s2563_count_the_number_of_fair_pairs/SolutionTest.kt
+++ b/src/test/kotlin/g2501_2600/s2563_count_the_number_of_fair_pairs/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun countFairPairs() {
         assertThat(
             Solution().countFairPairs(intArrayOf(0, 1, 7, 4, 4, 5), 3, 6),
-            equalTo(6)
+            equalTo(6),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun countFairPairs2() {
         assertThat(
             Solution().countFairPairs(intArrayOf(1, 7, 9, 2, 5), 11, 11),
-            equalTo(1)
+            equalTo(1),
         )
     }
 }
diff --git a/src/test/kotlin/g2501_2600/s2564_substring_xor_queries/SolutionTest.kt b/src/test/kotlin/g2501_2600/s2564_substring_xor_queries/SolutionTest.kt
index 1c39acfae..071063896 100644
--- a/src/test/kotlin/g2501_2600/s2564_substring_xor_queries/SolutionTest.kt
+++ b/src/test/kotlin/g2501_2600/s2564_substring_xor_queries/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun substringXorQueries() {
         assertThat(
             Solution().substringXorQueries("101101", arrayOf(intArrayOf(0, 5), intArrayOf(1, 2))),
-            equalTo(arrayOf(intArrayOf(0, 2), intArrayOf(2, 3)))
+            equalTo(arrayOf(intArrayOf(0, 2), intArrayOf(2, 3))),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun substringXorQueries2() {
         assertThat(
             Solution().substringXorQueries("0101", arrayOf(intArrayOf(12, 8))),
-            equalTo(arrayOf(intArrayOf(-1, -1)))
+            equalTo(arrayOf(intArrayOf(-1, -1))),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun substringXorQueries3() {
         assertThat(
             Solution().substringXorQueries("1", arrayOf(intArrayOf(4, 5))),
-            equalTo(arrayOf(intArrayOf(0, 0)))
+            equalTo(arrayOf(intArrayOf(0, 0))),
         )
     }
 }
diff --git a/src/test/kotlin/g2501_2600/s2565_subsequence_with_the_minimum_score/SolutionTest.kt b/src/test/kotlin/g2501_2600/s2565_subsequence_with_the_minimum_score/SolutionTest.kt
index 71cd18e71..014f80f20 100644
--- a/src/test/kotlin/g2501_2600/s2565_subsequence_with_the_minimum_score/SolutionTest.kt
+++ b/src/test/kotlin/g2501_2600/s2565_subsequence_with_the_minimum_score/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun minimumScore() {
         assertThat(
             Solution().minimumScore("abacaba", "bzaa"),
-            equalTo(1)
+            equalTo(1),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun minimumScore2() {
         assertThat(
             Solution().minimumScore("cde", "xyz"),
-            equalTo(3)
+            equalTo(3),
         )
     }
 }
diff --git a/src/test/kotlin/g2501_2600/s2566_maximum_difference_by_remapping_a_digit/SolutionTest.kt b/src/test/kotlin/g2501_2600/s2566_maximum_difference_by_remapping_a_digit/SolutionTest.kt
index 069610624..3cbe61a69 100644
--- a/src/test/kotlin/g2501_2600/s2566_maximum_difference_by_remapping_a_digit/SolutionTest.kt
+++ b/src/test/kotlin/g2501_2600/s2566_maximum_difference_by_remapping_a_digit/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun minMaxDifference() {
         assertThat(
             Solution().minMaxDifference(11891),
-            equalTo(99009)
+            equalTo(99009),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun minMaxDifference2() {
         assertThat(
             Solution().minMaxDifference(90),
-            equalTo(99)
+            equalTo(99),
         )
     }
 }
diff --git a/src/test/kotlin/g2501_2600/s2567_minimum_score_by_changing_two_elements/SolutionTest.kt b/src/test/kotlin/g2501_2600/s2567_minimum_score_by_changing_two_elements/SolutionTest.kt
index 442c35b7d..4ad13f66b 100644
--- a/src/test/kotlin/g2501_2600/s2567_minimum_score_by_changing_two_elements/SolutionTest.kt
+++ b/src/test/kotlin/g2501_2600/s2567_minimum_score_by_changing_two_elements/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun minimizeSum() {
         assertThat(
             Solution().minimizeSum(intArrayOf(1, 4, 3)),
-            equalTo(0)
+            equalTo(0),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun minimizeSum2() {
         assertThat(
             Solution().minimizeSum(intArrayOf(1, 4, 7, 8, 5)),
-            equalTo(3)
+            equalTo(3),
         )
     }
 }
diff --git a/src/test/kotlin/g2501_2600/s2568_minimum_impossible_or/SolutionTest.kt b/src/test/kotlin/g2501_2600/s2568_minimum_impossible_or/SolutionTest.kt
index 4874fe37d..58a77d7a1 100644
--- a/src/test/kotlin/g2501_2600/s2568_minimum_impossible_or/SolutionTest.kt
+++ b/src/test/kotlin/g2501_2600/s2568_minimum_impossible_or/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun minImpossibleOR() {
         assertThat(
             Solution().minImpossibleOR(intArrayOf(2, 1)),
-            equalTo(4)
+            equalTo(4),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun minImpossibleOR2() {
         assertThat(
             Solution().minImpossibleOR(intArrayOf(5, 3, 2)),
-            equalTo(1)
+            equalTo(1),
         )
     }
 }
diff --git a/src/test/kotlin/g2501_2600/s2569_handling_sum_queries_after_update/SolutionTest.kt b/src/test/kotlin/g2501_2600/s2569_handling_sum_queries_after_update/SolutionTest.kt
index bbc3128b3..59d77564f 100644
--- a/src/test/kotlin/g2501_2600/s2569_handling_sum_queries_after_update/SolutionTest.kt
+++ b/src/test/kotlin/g2501_2600/s2569_handling_sum_queries_after_update/SolutionTest.kt
@@ -9,13 +9,15 @@ internal class SolutionTest {
     fun handleQuery() {
         assertThat(
             Solution().handleQuery(
-                intArrayOf(1, 0, 1), intArrayOf(0, 0, 0),
+                intArrayOf(1, 0, 1),
+                intArrayOf(0, 0, 0),
                 arrayOf(
                     intArrayOf(1, 1, 1),
-                    intArrayOf(2, 1, 0), intArrayOf(3, 0, 0)
-                )
+                    intArrayOf(2, 1, 0),
+                    intArrayOf(3, 0, 0),
+                ),
             ),
-            equalTo(longArrayOf(3))
+            equalTo(longArrayOf(3)),
         )
     }
 
@@ -23,7 +25,7 @@ internal class SolutionTest {
     fun handleQuery2() {
         assertThat(
             Solution().handleQuery(intArrayOf(1), intArrayOf(5), arrayOf(intArrayOf(2, 0, 0), intArrayOf(3, 0, 0))),
-            equalTo(longArrayOf(5))
+            equalTo(longArrayOf(5)),
         )
     }
 }
diff --git a/src/test/kotlin/g2501_2600/s2570_merge_two_2d_arrays_by_summing_values/SolutionTest.kt b/src/test/kotlin/g2501_2600/s2570_merge_two_2d_arrays_by_summing_values/SolutionTest.kt
index 4ba4ea5c5..3bf74453a 100644
--- a/src/test/kotlin/g2501_2600/s2570_merge_two_2d_arrays_by_summing_values/SolutionTest.kt
+++ b/src/test/kotlin/g2501_2600/s2570_merge_two_2d_arrays_by_summing_values/SolutionTest.kt
@@ -10,9 +10,9 @@ internal class SolutionTest {
         assertThat(
             Solution().mergeArrays(
                 arrayOf(intArrayOf(1, 2), intArrayOf(2, 3), intArrayOf(4, 5)),
-                arrayOf(intArrayOf(1, 4), intArrayOf(3, 2), intArrayOf(4, 1))
+                arrayOf(intArrayOf(1, 4), intArrayOf(3, 2), intArrayOf(4, 1)),
             ),
-            equalTo(arrayOf(intArrayOf(1, 6), intArrayOf(2, 3), intArrayOf(3, 2), intArrayOf(4, 6)))
+            equalTo(arrayOf(intArrayOf(1, 6), intArrayOf(2, 3), intArrayOf(3, 2), intArrayOf(4, 6))),
         )
     }
 
@@ -21,9 +21,9 @@ internal class SolutionTest {
         assertThat(
             Solution().mergeArrays(
                 arrayOf(intArrayOf(2, 4), intArrayOf(3, 6), intArrayOf(5, 5)),
-                arrayOf(intArrayOf(1, 3), intArrayOf(4, 3))
+                arrayOf(intArrayOf(1, 3), intArrayOf(4, 3)),
             ),
-            equalTo(arrayOf(intArrayOf(1, 3), intArrayOf(2, 4), intArrayOf(3, 6), intArrayOf(4, 3), intArrayOf(5, 5)))
+            equalTo(arrayOf(intArrayOf(1, 3), intArrayOf(2, 4), intArrayOf(3, 6), intArrayOf(4, 3), intArrayOf(5, 5))),
         )
     }
 }
diff --git a/src/test/kotlin/g2501_2600/s2571_minimum_operations_to_reduce_an_integer_to_0/SolutionTest.kt b/src/test/kotlin/g2501_2600/s2571_minimum_operations_to_reduce_an_integer_to_0/SolutionTest.kt
index 29a6d0dca..18b10c3ba 100644
--- a/src/test/kotlin/g2501_2600/s2571_minimum_operations_to_reduce_an_integer_to_0/SolutionTest.kt
+++ b/src/test/kotlin/g2501_2600/s2571_minimum_operations_to_reduce_an_integer_to_0/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun minOperations() {
         assertThat(
             Solution().minOperations(39),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun minOperations2() {
         assertThat(
             Solution().minOperations(54),
-            equalTo(3)
+            equalTo(3),
         )
     }
 }
diff --git a/src/test/kotlin/g2501_2600/s2572_count_the_number_of_square_free_subsets/SolutionTest.kt b/src/test/kotlin/g2501_2600/s2572_count_the_number_of_square_free_subsets/SolutionTest.kt
index 60f6aa6db..7ed8a1752 100644
--- a/src/test/kotlin/g2501_2600/s2572_count_the_number_of_square_free_subsets/SolutionTest.kt
+++ b/src/test/kotlin/g2501_2600/s2572_count_the_number_of_square_free_subsets/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun squareFreeSubsets() {
         assertThat(
             Solution().squareFreeSubsets(intArrayOf(3, 4, 4, 5)),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun squareFreeSubsets2() {
         assertThat(
             Solution().squareFreeSubsets(intArrayOf(1)),
-            equalTo(1)
+            equalTo(1),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun squareFreeSubsets3() {
         assertThat(
             Solution().squareFreeSubsets(intArrayOf(26, 6, 4, 27, 6, 18)),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
@@ -33,7 +33,7 @@ internal class SolutionTest {
     fun squareFreeSubsets4() {
         assertThat(
             Solution().squareFreeSubsets(intArrayOf(8, 11, 17, 2, 25, 29, 21, 20, 4, 22)),
-            equalTo(39)
+            equalTo(39),
         )
     }
 }
diff --git a/src/test/kotlin/g2501_2600/s2573_find_the_string_with_lcp/SolutionTest.kt b/src/test/kotlin/g2501_2600/s2573_find_the_string_with_lcp/SolutionTest.kt
index 802c7e858..bf4d35dd1 100644
--- a/src/test/kotlin/g2501_2600/s2573_find_the_string_with_lcp/SolutionTest.kt
+++ b/src/test/kotlin/g2501_2600/s2573_find_the_string_with_lcp/SolutionTest.kt
@@ -10,11 +10,13 @@ internal class SolutionTest {
         assertThat(
             Solution().findTheString(
                 arrayOf(
-                    intArrayOf(4, 0, 2, 0), intArrayOf(0, 3, 0, 1),
-                    intArrayOf(2, 0, 2, 0), intArrayOf(0, 1, 0, 1)
-                )
+                    intArrayOf(4, 0, 2, 0),
+                    intArrayOf(0, 3, 0, 1),
+                    intArrayOf(2, 0, 2, 0),
+                    intArrayOf(0, 1, 0, 1),
+                ),
             ),
-            equalTo("abab")
+            equalTo("abab"),
         )
     }
 
@@ -23,11 +25,13 @@ internal class SolutionTest {
         assertThat(
             Solution().findTheString(
                 arrayOf(
-                    intArrayOf(4, 3, 2, 1), intArrayOf(3, 3, 2, 1),
-                    intArrayOf(2, 2, 2, 1), intArrayOf(1, 1, 1, 1)
-                )
+                    intArrayOf(4, 3, 2, 1),
+                    intArrayOf(3, 3, 2, 1),
+                    intArrayOf(2, 2, 2, 1),
+                    intArrayOf(1, 1, 1, 1),
+                ),
             ),
-            equalTo("aaaa")
+            equalTo("aaaa"),
         )
     }
 
@@ -36,11 +40,13 @@ internal class SolutionTest {
         assertThat(
             Solution().findTheString(
                 arrayOf(
-                    intArrayOf(4, 3, 2, 1), intArrayOf(3, 3, 2, 1),
-                    intArrayOf(2, 2, 2, 1), intArrayOf(1, 1, 1, 3)
-                )
+                    intArrayOf(4, 3, 2, 1),
+                    intArrayOf(3, 3, 2, 1),
+                    intArrayOf(2, 2, 2, 1),
+                    intArrayOf(1, 1, 1, 3),
+                ),
             ),
-            equalTo("")
+            equalTo(""),
         )
     }
 }
diff --git a/src/test/kotlin/g2501_2600/s2574_left_and_right_sum_differences/SolutionTest.kt b/src/test/kotlin/g2501_2600/s2574_left_and_right_sum_differences/SolutionTest.kt
index 04fe8f5c1..dbf0cc3fc 100644
--- a/src/test/kotlin/g2501_2600/s2574_left_and_right_sum_differences/SolutionTest.kt
+++ b/src/test/kotlin/g2501_2600/s2574_left_and_right_sum_differences/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun leftRightDifference() {
         assertThat(
             Solution().leftRightDifference(intArrayOf(10, 4, 8, 3)),
-            equalTo(intArrayOf(15, 1, 11, 22))
+            equalTo(intArrayOf(15, 1, 11, 22)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun leftRightDifference2() {
         assertThat(
             Solution().leftRightDifference(intArrayOf(1)),
-            equalTo(intArrayOf(0))
+            equalTo(intArrayOf(0)),
         )
     }
 }
diff --git a/src/test/kotlin/g2501_2600/s2575_find_the_divisibility_array_of_a_string/SolutionTest.kt b/src/test/kotlin/g2501_2600/s2575_find_the_divisibility_array_of_a_string/SolutionTest.kt
index 8cc72ced2..14e3def07 100644
--- a/src/test/kotlin/g2501_2600/s2575_find_the_divisibility_array_of_a_string/SolutionTest.kt
+++ b/src/test/kotlin/g2501_2600/s2575_find_the_divisibility_array_of_a_string/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun divisibilityArray() {
         assertThat(
             Solution().divisibilityArray("998244353", 3),
-            equalTo(intArrayOf(1, 1, 0, 0, 0, 1, 1, 0, 0))
+            equalTo(intArrayOf(1, 1, 0, 0, 0, 1, 1, 0, 0)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun divisibilityArray2() {
         assertThat(
             Solution().divisibilityArray("1010", 10),
-            equalTo(intArrayOf(0, 1, 0, 1))
+            equalTo(intArrayOf(0, 1, 0, 1)),
         )
     }
 }
diff --git a/src/test/kotlin/g2501_2600/s2576_find_the_maximum_number_of_marked_indices/SolutionTest.kt b/src/test/kotlin/g2501_2600/s2576_find_the_maximum_number_of_marked_indices/SolutionTest.kt
index 258ae2c4a..740d3b2f3 100644
--- a/src/test/kotlin/g2501_2600/s2576_find_the_maximum_number_of_marked_indices/SolutionTest.kt
+++ b/src/test/kotlin/g2501_2600/s2576_find_the_maximum_number_of_marked_indices/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun maxNumOfMarkedIndices() {
         assertThat(
             Solution().maxNumOfMarkedIndices(intArrayOf(3, 5, 2, 4)),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun maxNumOfMarkedIndices2() {
         assertThat(
             Solution().maxNumOfMarkedIndices(intArrayOf(9, 2, 5, 4)),
-            equalTo(4)
+            equalTo(4),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun maxNumOfMarkedIndices3() {
         assertThat(
             Solution().maxNumOfMarkedIndices(intArrayOf(7, 6, 8)),
-            equalTo(0)
+            equalTo(0),
         )
     }
 }
diff --git a/src/test/kotlin/g2501_2600/s2577_minimum_time_to_visit_a_cell_in_a_grid/SolutionTest.kt b/src/test/kotlin/g2501_2600/s2577_minimum_time_to_visit_a_cell_in_a_grid/SolutionTest.kt
index 988bd5f9a..797801c8e 100644
--- a/src/test/kotlin/g2501_2600/s2577_minimum_time_to_visit_a_cell_in_a_grid/SolutionTest.kt
+++ b/src/test/kotlin/g2501_2600/s2577_minimum_time_to_visit_a_cell_in_a_grid/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun minimumTime() {
         assertThat(
             Solution().minimumTime(arrayOf(intArrayOf(0, 1, 3, 2), intArrayOf(5, 1, 2, 5), intArrayOf(4, 3, 8, 6))),
-            equalTo(7)
+            equalTo(7),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun minimumTime2() {
         assertThat(
             Solution().minimumTime(arrayOf(intArrayOf(0, 2, 4), intArrayOf(3, 2, 1), intArrayOf(1, 0, 4))),
-            equalTo(-1)
+            equalTo(-1),
         )
     }
 }
diff --git a/src/test/kotlin/g2501_2600/s2580_count_ways_to_group_overlapping_ranges/SolutionTest.kt b/src/test/kotlin/g2501_2600/s2580_count_ways_to_group_overlapping_ranges/SolutionTest.kt
index d3ff884c9..20662a027 100644
--- a/src/test/kotlin/g2501_2600/s2580_count_ways_to_group_overlapping_ranges/SolutionTest.kt
+++ b/src/test/kotlin/g2501_2600/s2580_count_ways_to_group_overlapping_ranges/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun countWays() {
         assertThat(
             Solution().countWays(arrayOf(intArrayOf(6, 10), intArrayOf(5, 15))),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -18,11 +18,13 @@ internal class SolutionTest {
         assertThat(
             Solution().countWays(
                 arrayOf(
-                    intArrayOf(1, 3), intArrayOf(10, 20),
-                    intArrayOf(2, 5), intArrayOf(4, 8)
-                )
+                    intArrayOf(1, 3),
+                    intArrayOf(10, 20),
+                    intArrayOf(2, 5),
+                    intArrayOf(4, 8),
+                ),
             ),
-            equalTo(4)
+            equalTo(4),
         )
     }
 }
diff --git a/src/test/kotlin/g2501_2600/s2581_count_number_of_possible_root_nodes/SolutionTest.kt b/src/test/kotlin/g2501_2600/s2581_count_number_of_possible_root_nodes/SolutionTest.kt
index 92e3c189a..5fd99d293 100644
--- a/src/test/kotlin/g2501_2600/s2581_count_number_of_possible_root_nodes/SolutionTest.kt
+++ b/src/test/kotlin/g2501_2600/s2581_count_number_of_possible_root_nodes/SolutionTest.kt
@@ -11,11 +11,14 @@ internal class SolutionTest {
             Solution().rootCount(
                 arrayOf(intArrayOf(0, 1), intArrayOf(1, 2), intArrayOf(1, 3), intArrayOf(4, 2)),
                 arrayOf(
-                    intArrayOf(1, 3), intArrayOf(0, 1), intArrayOf(1, 0), intArrayOf(2, 4)
+                    intArrayOf(1, 3),
+                    intArrayOf(0, 1),
+                    intArrayOf(1, 0),
+                    intArrayOf(2, 4),
                 ),
-                3
+                3,
             ),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
@@ -25,11 +28,14 @@ internal class SolutionTest {
             Solution().rootCount(
                 arrayOf(intArrayOf(0, 1), intArrayOf(1, 2), intArrayOf(2, 3), intArrayOf(3, 4)),
                 arrayOf(
-                    intArrayOf(1, 0), intArrayOf(3, 4), intArrayOf(2, 1), intArrayOf(3, 2)
+                    intArrayOf(1, 0),
+                    intArrayOf(3, 4),
+                    intArrayOf(2, 1),
+                    intArrayOf(3, 2),
                 ),
-                1
+                1,
             ),
-            equalTo(5)
+            equalTo(5),
         )
     }
 }
diff --git a/src/test/kotlin/g2501_2600/s2583_kth_largest_sum_in_a_binary_tree/SolutionTest.kt b/src/test/kotlin/g2501_2600/s2583_kth_largest_sum_in_a_binary_tree/SolutionTest.kt
index 43a35afa5..88a68507b 100644
--- a/src/test/kotlin/g2501_2600/s2583_kth_largest_sum_in_a_binary_tree/SolutionTest.kt
+++ b/src/test/kotlin/g2501_2600/s2583_kth_largest_sum_in_a_binary_tree/SolutionTest.kt
@@ -11,11 +11,11 @@ internal class SolutionTest {
         assertThat(
             Solution().kthLargestLevelSum(
                 TreeNode.create(
-                    listOf(5, 8, 9, 2, 1, 3, 7, 4, 6)
+                    listOf(5, 8, 9, 2, 1, 3, 7, 4, 6),
                 ),
-                2
+                2,
             ),
-            equalTo(13)
+            equalTo(13),
         )
     }
 
@@ -24,11 +24,11 @@ internal class SolutionTest {
         assertThat(
             Solution().kthLargestLevelSum(
                 TreeNode.create(
-                    listOf(1, 2, null, 3)
+                    listOf(1, 2, null, 3),
                 ),
-                1
+                1,
             ),
-            equalTo(3)
+            equalTo(3),
         )
     }
 }
diff --git a/src/test/kotlin/g2501_2600/s2585_number_of_ways_to_earn_points/SolutionTest.kt b/src/test/kotlin/g2501_2600/s2585_number_of_ways_to_earn_points/SolutionTest.kt
index 1db0d61ce..6e2af2658 100644
--- a/src/test/kotlin/g2501_2600/s2585_number_of_ways_to_earn_points/SolutionTest.kt
+++ b/src/test/kotlin/g2501_2600/s2585_number_of_ways_to_earn_points/SolutionTest.kt
@@ -11,11 +11,12 @@ internal class SolutionTest {
             Solution().waysToReachTarget(
                 5,
                 arrayOf(
-                    intArrayOf(50, 1), intArrayOf(50, 2),
-                    intArrayOf(50, 5)
-                )
+                    intArrayOf(50, 1),
+                    intArrayOf(50, 2),
+                    intArrayOf(50, 5),
+                ),
             ),
-            equalTo(4)
+            equalTo(4),
         )
     }
 
@@ -25,11 +26,12 @@ internal class SolutionTest {
             Solution().waysToReachTarget(
                 6,
                 arrayOf(
-                    intArrayOf(6, 1), intArrayOf(3, 2),
-                    intArrayOf(2, 3)
-                )
+                    intArrayOf(6, 1),
+                    intArrayOf(3, 2),
+                    intArrayOf(2, 3),
+                ),
             ),
-            equalTo(7)
+            equalTo(7),
         )
     }
 
@@ -39,11 +41,12 @@ internal class SolutionTest {
             Solution().waysToReachTarget(
                 18,
                 arrayOf(
-                    intArrayOf(6, 1), intArrayOf(3, 2),
-                    intArrayOf(2, 3)
-                )
+                    intArrayOf(6, 1),
+                    intArrayOf(3, 2),
+                    intArrayOf(2, 3),
+                ),
             ),
-            equalTo(1)
+            equalTo(1),
         )
     }
 }
diff --git a/src/test/kotlin/g2501_2600/s2589_minimum_time_to_complete_all_tasks/SolutionTest.kt b/src/test/kotlin/g2501_2600/s2589_minimum_time_to_complete_all_tasks/SolutionTest.kt
index 8454935d4..1fb3bc16c 100644
--- a/src/test/kotlin/g2501_2600/s2589_minimum_time_to_complete_all_tasks/SolutionTest.kt
+++ b/src/test/kotlin/g2501_2600/s2589_minimum_time_to_complete_all_tasks/SolutionTest.kt
@@ -10,11 +10,12 @@ internal class SolutionTest {
         assertThat(
             Solution().findMinimumTime(
                 arrayOf(
-                    intArrayOf(2, 3, 1), intArrayOf(4, 5, 1),
-                    intArrayOf(1, 5, 2)
-                )
+                    intArrayOf(2, 3, 1),
+                    intArrayOf(4, 5, 1),
+                    intArrayOf(1, 5, 2),
+                ),
             ),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -23,11 +24,12 @@ internal class SolutionTest {
         assertThat(
             Solution().findMinimumTime(
                 arrayOf(
-                    intArrayOf(1, 3, 2), intArrayOf(2, 5, 3),
-                    intArrayOf(5, 6, 2)
-                )
+                    intArrayOf(1, 3, 2),
+                    intArrayOf(2, 5, 3),
+                    intArrayOf(5, 6, 2),
+                ),
             ),
-            equalTo(4)
+            equalTo(4),
         )
     }
 }
diff --git a/src/test/kotlin/g2501_2600/s2596_check_knight_tour_configuration/SolutionTest.kt b/src/test/kotlin/g2501_2600/s2596_check_knight_tour_configuration/SolutionTest.kt
index f2151ca15..ba1dd3fdd 100644
--- a/src/test/kotlin/g2501_2600/s2596_check_knight_tour_configuration/SolutionTest.kt
+++ b/src/test/kotlin/g2501_2600/s2596_check_knight_tour_configuration/SolutionTest.kt
@@ -11,11 +11,13 @@ internal class SolutionTest {
             Solution().checkValidGrid(
                 arrayOf(
                     intArrayOf(0, 11, 16, 5, 20),
-                    intArrayOf(17, 4, 19, 10, 15), intArrayOf(12, 1, 8, 21, 6),
-                    intArrayOf(3, 18, 23, 14, 9), intArrayOf(24, 13, 2, 7, 22)
-                )
+                    intArrayOf(17, 4, 19, 10, 15),
+                    intArrayOf(12, 1, 8, 21, 6),
+                    intArrayOf(3, 18, 23, 14, 9),
+                    intArrayOf(24, 13, 2, 7, 22),
+                ),
             ),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
@@ -25,10 +27,11 @@ internal class SolutionTest {
             Solution().checkValidGrid(
                 arrayOf(
                     intArrayOf(0, 3, 6),
-                    intArrayOf(5, 8, 1), intArrayOf(2, 7, 4)
-                )
+                    intArrayOf(5, 8, 1),
+                    intArrayOf(2, 7, 4),
+                ),
             ),
-            equalTo(false)
+            equalTo(false),
         )
     }
 }
diff --git a/src/test/kotlin/g2601_2700/s2603_collect_coins_in_a_tree/SolutionTest.kt b/src/test/kotlin/g2601_2700/s2603_collect_coins_in_a_tree/SolutionTest.kt
index 03708378b..d60832b07 100644
--- a/src/test/kotlin/g2601_2700/s2603_collect_coins_in_a_tree/SolutionTest.kt
+++ b/src/test/kotlin/g2601_2700/s2603_collect_coins_in_a_tree/SolutionTest.kt
@@ -12,11 +12,13 @@ internal class SolutionTest {
                 intArrayOf(1, 0, 0, 0, 0, 1),
                 arrayOf(
                     intArrayOf(0, 1),
-                    intArrayOf(1, 2), intArrayOf(2, 3),
-                    intArrayOf(3, 4), intArrayOf(4, 5)
-                )
+                    intArrayOf(1, 2),
+                    intArrayOf(2, 3),
+                    intArrayOf(3, 4),
+                    intArrayOf(4, 5),
+                ),
             ),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -27,11 +29,15 @@ internal class SolutionTest {
                 intArrayOf(0, 0, 0, 1, 1, 0, 0, 1),
                 arrayOf(
                     intArrayOf(0, 1),
-                    intArrayOf(0, 2), intArrayOf(1, 3), intArrayOf(1, 4), intArrayOf(2, 5),
-                    intArrayOf(5, 6), intArrayOf(5, 7)
-                )
+                    intArrayOf(0, 2),
+                    intArrayOf(1, 3),
+                    intArrayOf(1, 4),
+                    intArrayOf(2, 5),
+                    intArrayOf(5, 6),
+                    intArrayOf(5, 7),
+                ),
             ),
-            equalTo(2)
+            equalTo(2),
         )
     }
 }
diff --git a/src/test/kotlin/g2601_2700/s2608_shortest_cycle_in_a_graph/SolutionTest.kt b/src/test/kotlin/g2601_2700/s2608_shortest_cycle_in_a_graph/SolutionTest.kt
index 5416c789f..d6858f61b 100644
--- a/src/test/kotlin/g2601_2700/s2608_shortest_cycle_in_a_graph/SolutionTest.kt
+++ b/src/test/kotlin/g2601_2700/s2608_shortest_cycle_in_a_graph/SolutionTest.kt
@@ -11,11 +11,16 @@ internal class SolutionTest {
             Solution().findShortestCycle(
                 7,
                 arrayOf(
-                    intArrayOf(0, 1), intArrayOf(1, 2),
-                    intArrayOf(2, 0), intArrayOf(3, 4), intArrayOf(4, 5), intArrayOf(5, 6), intArrayOf(6, 3)
-                )
+                    intArrayOf(0, 1),
+                    intArrayOf(1, 2),
+                    intArrayOf(2, 0),
+                    intArrayOf(3, 4),
+                    intArrayOf(4, 5),
+                    intArrayOf(5, 6),
+                    intArrayOf(6, 3),
+                ),
             ),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
diff --git a/src/test/kotlin/g2601_2700/s2610_convert_an_array_into_a_2d_array_with_conditions/SolutionTest.kt b/src/test/kotlin/g2601_2700/s2610_convert_an_array_into_a_2d_array_with_conditions/SolutionTest.kt
index fc9631a90..d5cd11e7c 100644
--- a/src/test/kotlin/g2601_2700/s2610_convert_an_array_into_a_2d_array_with_conditions/SolutionTest.kt
+++ b/src/test/kotlin/g2601_2700/s2610_convert_an_array_into_a_2d_array_with_conditions/SolutionTest.kt
@@ -12,9 +12,10 @@ internal class SolutionTest {
             equalTo(
                 listOf(
                     listOf(1, 3, 4, 2),
-                    listOf(1, 3), listOf(1)
-                )
-            )
+                    listOf(1, 3),
+                    listOf(1),
+                ),
+            ),
         )
     }
 
diff --git a/src/test/kotlin/g2601_2700/s2611_mice_and_cheese/SolutionTest.kt b/src/test/kotlin/g2601_2700/s2611_mice_and_cheese/SolutionTest.kt
index e7d933a11..fb784a8ab 100644
--- a/src/test/kotlin/g2601_2700/s2611_mice_and_cheese/SolutionTest.kt
+++ b/src/test/kotlin/g2601_2700/s2611_mice_and_cheese/SolutionTest.kt
@@ -10,8 +10,8 @@ internal class SolutionTest {
         assertThat(
             Solution().miceAndCheese(intArrayOf(1, 1, 3, 4), intArrayOf(4, 4, 1, 1), 2),
             equalTo(
-                15
-            )
+                15,
+            ),
         )
     }
 
@@ -20,8 +20,8 @@ internal class SolutionTest {
         assertThat(
             Solution().miceAndCheese(intArrayOf(1, 1), intArrayOf(1, 1), 2),
             equalTo(
-                2
-            )
+                2,
+            ),
         )
     }
 }
diff --git a/src/test/kotlin/g2601_2700/s2612_minimum_reverse_operations/SolutionTest.kt b/src/test/kotlin/g2601_2700/s2612_minimum_reverse_operations/SolutionTest.kt
index 806a73f10..d37b82193 100644
--- a/src/test/kotlin/g2601_2700/s2612_minimum_reverse_operations/SolutionTest.kt
+++ b/src/test/kotlin/g2601_2700/s2612_minimum_reverse_operations/SolutionTest.kt
@@ -10,8 +10,8 @@ internal class SolutionTest {
         assertThat(
             Solution().minReverseOperations(4, 0, intArrayOf(1, 2), 4),
             equalTo(
-                intArrayOf(0, -1, -1, 1)
-            )
+                intArrayOf(0, -1, -1, 1),
+            ),
         )
     }
 
@@ -20,8 +20,8 @@ internal class SolutionTest {
         assertThat(
             Solution().minReverseOperations(5, 0, intArrayOf(2, 4), 3),
             equalTo(
-                intArrayOf(0, -1, -1, -1, -1)
-            )
+                intArrayOf(0, -1, -1, -1, -1),
+            ),
         )
     }
 
@@ -30,8 +30,8 @@ internal class SolutionTest {
         assertThat(
             Solution().minReverseOperations(4, 2, intArrayOf(0, 1, 3), 1),
             equalTo(
-                intArrayOf(-1, -1, 0, -1)
-            )
+                intArrayOf(-1, -1, 0, -1),
+            ),
         )
     }
 }
diff --git a/src/test/kotlin/g2601_2700/s2614_prime_in_diagonal/SolutionTest.kt b/src/test/kotlin/g2601_2700/s2614_prime_in_diagonal/SolutionTest.kt
index 832710031..9e3f53dcd 100644
--- a/src/test/kotlin/g2601_2700/s2614_prime_in_diagonal/SolutionTest.kt
+++ b/src/test/kotlin/g2601_2700/s2614_prime_in_diagonal/SolutionTest.kt
@@ -12,10 +12,10 @@ internal class SolutionTest {
                 arrayOf(
                     intArrayOf(1, 2, 3),
                     intArrayOf(5, 6, 7),
-                    intArrayOf(9, 10, 11)
-                )
+                    intArrayOf(9, 10, 11),
+                ),
             ),
-            equalTo(11)
+            equalTo(11),
         )
     }
 
@@ -26,10 +26,10 @@ internal class SolutionTest {
                 arrayOf(
                     intArrayOf(1, 2, 3),
                     intArrayOf(5, 17, 7),
-                    intArrayOf(9, 11, 10)
-                )
+                    intArrayOf(9, 11, 10),
+                ),
             ),
-            equalTo(17)
+            equalTo(17),
         )
     }
 }
diff --git a/src/test/kotlin/g2601_2700/s2615_sum_of_distances/SolutionTest.kt b/src/test/kotlin/g2601_2700/s2615_sum_of_distances/SolutionTest.kt
index d27954fad..168d076ee 100644
--- a/src/test/kotlin/g2601_2700/s2615_sum_of_distances/SolutionTest.kt
+++ b/src/test/kotlin/g2601_2700/s2615_sum_of_distances/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun distance() {
         assertThat(
             Solution().distance(intArrayOf(1, 3, 1, 1, 2)),
-            equalTo(longArrayOf(5, 0, 3, 4, 0))
+            equalTo(longArrayOf(5, 0, 3, 4, 0)),
         )
     }
 
diff --git a/src/test/kotlin/g2601_2700/s2617_minimum_number_of_visited_cells_in_a_grid/SolutionTest.kt b/src/test/kotlin/g2601_2700/s2617_minimum_number_of_visited_cells_in_a_grid/SolutionTest.kt
index d24953f7a..9687596fb 100644
--- a/src/test/kotlin/g2601_2700/s2617_minimum_number_of_visited_cells_in_a_grid/SolutionTest.kt
+++ b/src/test/kotlin/g2601_2700/s2617_minimum_number_of_visited_cells_in_a_grid/SolutionTest.kt
@@ -13,10 +13,10 @@ internal class SolutionTest {
                     intArrayOf(3, 4, 2, 1),
                     intArrayOf(4, 2, 3, 1),
                     intArrayOf(2, 1, 0, 0),
-                    intArrayOf(2, 4, 0, 0)
-                )
+                    intArrayOf(2, 4, 0, 0),
+                ),
             ),
-            equalTo(4)
+            equalTo(4),
         )
     }
 
@@ -28,10 +28,10 @@ internal class SolutionTest {
                     intArrayOf(3, 4, 2, 1),
                     intArrayOf(4, 2, 1, 1),
                     intArrayOf(2, 1, 1, 0),
-                    intArrayOf(3, 4, 1, 0)
-                )
+                    intArrayOf(3, 4, 1, 0),
+                ),
             ),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
@@ -39,7 +39,7 @@ internal class SolutionTest {
     fun minimumVisitedCells3() {
         assertThat(
             Solution().minimumVisitedCells(arrayOf(intArrayOf(2, 1, 0), intArrayOf(1, 0, 0))),
-            equalTo(-1)
+            equalTo(-1),
         )
     }
 }
diff --git a/src/test/kotlin/g2601_2700/s2639_find_the_width_of_columns_of_a_grid/SolutionTest.kt b/src/test/kotlin/g2601_2700/s2639_find_the_width_of_columns_of_a_grid/SolutionTest.kt
index fbcf32212..2ab7d3ff4 100644
--- a/src/test/kotlin/g2601_2700/s2639_find_the_width_of_columns_of_a_grid/SolutionTest.kt
+++ b/src/test/kotlin/g2601_2700/s2639_find_the_width_of_columns_of_a_grid/SolutionTest.kt
@@ -10,8 +10,8 @@ internal class SolutionTest {
         assertThat(
             Solution().findColumnWidth(arrayOf(intArrayOf(1), intArrayOf(22), intArrayOf(333))),
             equalTo(
-                intArrayOf(3)
-            )
+                intArrayOf(3),
+            ),
         )
     }
 
@@ -20,8 +20,8 @@ internal class SolutionTest {
         assertThat(
             Solution().findColumnWidth(arrayOf(intArrayOf(-15, 1, 3), intArrayOf(15, 7, 12), intArrayOf(5, 6, -2))),
             equalTo(
-                intArrayOf(3, 1, 2)
-            )
+                intArrayOf(3, 1, 2),
+            ),
         )
     }
 }
diff --git a/src/test/kotlin/g2601_2700/s2640_find_the_score_of_all_prefixes_of_an_array/SolutionTest.kt b/src/test/kotlin/g2601_2700/s2640_find_the_score_of_all_prefixes_of_an_array/SolutionTest.kt
index c74dbcff9..2d4043d95 100644
--- a/src/test/kotlin/g2601_2700/s2640_find_the_score_of_all_prefixes_of_an_array/SolutionTest.kt
+++ b/src/test/kotlin/g2601_2700/s2640_find_the_score_of_all_prefixes_of_an_array/SolutionTest.kt
@@ -10,8 +10,8 @@ internal class SolutionTest {
         assertThat(
             Solution().findPrefixScore(intArrayOf(2, 3, 7, 5, 10)),
             equalTo(
-                longArrayOf(4, 10, 24, 36, 56)
-            )
+                longArrayOf(4, 10, 24, 36, 56),
+            ),
         )
     }
 
@@ -20,8 +20,8 @@ internal class SolutionTest {
         assertThat(
             Solution().findPrefixScore(intArrayOf(1, 1, 2, 4, 8, 16)),
             equalTo(
-                longArrayOf(2, 4, 8, 16, 32, 64)
-            )
+                longArrayOf(2, 4, 8, 16, 32, 64),
+            ),
         )
     }
 }
diff --git a/src/test/kotlin/g2601_2700/s2641_cousins_in_binary_tree_ii/SolutionTest.kt b/src/test/kotlin/g2601_2700/s2641_cousins_in_binary_tree_ii/SolutionTest.kt
index 198aaafde..93cd0b3d3 100644
--- a/src/test/kotlin/g2601_2700/s2641_cousins_in_binary_tree_ii/SolutionTest.kt
+++ b/src/test/kotlin/g2601_2700/s2641_cousins_in_binary_tree_ii/SolutionTest.kt
@@ -11,8 +11,8 @@ internal class SolutionTest {
         assertThat(
             Solution().replaceValueInTree(TreeNode.create(listOf(5, 4, 9, 1, 10, null, 7))).toString(),
             equalTo(
-                TreeNode.create(listOf(0, 0, 0, 7, 7, null, 11)).toString()
-            )
+                TreeNode.create(listOf(0, 0, 0, 7, 7, null, 11)).toString(),
+            ),
         )
     }
 
@@ -21,8 +21,8 @@ internal class SolutionTest {
         assertThat(
             Solution().replaceValueInTree(TreeNode.create(listOf(3, 1, 2))).toString(),
             equalTo(
-                TreeNode.create(listOf(0, 0, 0)).toString()
-            )
+                TreeNode.create(listOf(0, 0, 0)).toString(),
+            ),
         )
     }
 }
diff --git a/src/test/kotlin/g2601_2700/s2642_design_graph_with_shortest_path_calculator/GraphTest.kt b/src/test/kotlin/g2601_2700/s2642_design_graph_with_shortest_path_calculator/GraphTest.kt
index 2e2adb443..1efeeb7c7 100644
--- a/src/test/kotlin/g2601_2700/s2642_design_graph_with_shortest_path_calculator/GraphTest.kt
+++ b/src/test/kotlin/g2601_2700/s2642_design_graph_with_shortest_path_calculator/GraphTest.kt
@@ -10,9 +10,11 @@ internal class GraphTest {
         val graph = Graph(
             4,
             arrayOf(
-                intArrayOf(0, 2, 5), intArrayOf(0, 1, 2),
-                intArrayOf(1, 2, 1), intArrayOf(3, 0, 3)
-            )
+                intArrayOf(0, 2, 5),
+                intArrayOf(0, 1, 2),
+                intArrayOf(1, 2, 1),
+                intArrayOf(3, 0, 3),
+            ),
         )
         assertThat(graph.shortestPath(3, 2), equalTo(6))
         assertThat(graph.shortestPath(0, 3), equalTo(-1))
diff --git a/src/test/kotlin/g2601_2700/s2643_row_with_maximum_ones/SolutionTest.kt b/src/test/kotlin/g2601_2700/s2643_row_with_maximum_ones/SolutionTest.kt
index 029a184d9..6f91da4b1 100644
--- a/src/test/kotlin/g2601_2700/s2643_row_with_maximum_ones/SolutionTest.kt
+++ b/src/test/kotlin/g2601_2700/s2643_row_with_maximum_ones/SolutionTest.kt
@@ -10,8 +10,8 @@ internal class SolutionTest {
         assertThat(
             Solution().rowAndMaximumOnes(arrayOf(intArrayOf(0, 1), intArrayOf(1, 0))),
             equalTo(
-                intArrayOf(0, 1)
-            )
+                intArrayOf(0, 1),
+            ),
         )
     }
 
@@ -20,8 +20,8 @@ internal class SolutionTest {
         assertThat(
             Solution().rowAndMaximumOnes(arrayOf(intArrayOf(0, 0, 0), intArrayOf(0, 1, 1))),
             equalTo(
-                intArrayOf(1, 2)
-            )
+                intArrayOf(1, 2),
+            ),
         )
     }
 
@@ -30,8 +30,8 @@ internal class SolutionTest {
         assertThat(
             Solution().rowAndMaximumOnes(arrayOf(intArrayOf(0, 0), intArrayOf(1, 1), intArrayOf(0, 0))),
             equalTo(
-                intArrayOf(1, 2)
-            )
+                intArrayOf(1, 2),
+            ),
         )
     }
 }
diff --git a/src/test/kotlin/g2601_2700/s2644_find_the_maximum_divisibility_score/SolutionTest.kt b/src/test/kotlin/g2601_2700/s2644_find_the_maximum_divisibility_score/SolutionTest.kt
index 50cd6d640..37b1ce440 100644
--- a/src/test/kotlin/g2601_2700/s2644_find_the_maximum_divisibility_score/SolutionTest.kt
+++ b/src/test/kotlin/g2601_2700/s2644_find_the_maximum_divisibility_score/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun maxDivScore() {
         assertThat(
             Solution().maxDivScore(intArrayOf(4, 7, 9, 3, 9), intArrayOf(5, 2, 3)),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun maxDivScore2() {
         assertThat(
             Solution().maxDivScore(intArrayOf(20, 14, 21, 10), intArrayOf(5, 7, 5)),
-            equalTo(5)
+            equalTo(5),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun maxDivScore3() {
         assertThat(
             Solution().maxDivScore(intArrayOf(12), intArrayOf(10, 16)),
-            equalTo(10)
+            equalTo(10),
         )
     }
 }
diff --git a/src/test/kotlin/g2601_2700/s2645_minimum_additions_to_make_valid_string/SolutionTest.kt b/src/test/kotlin/g2601_2700/s2645_minimum_additions_to_make_valid_string/SolutionTest.kt
index 22c827277..59ffb4b7b 100644
--- a/src/test/kotlin/g2601_2700/s2645_minimum_additions_to_make_valid_string/SolutionTest.kt
+++ b/src/test/kotlin/g2601_2700/s2645_minimum_additions_to_make_valid_string/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun addMinimum() {
         assertThat(
             Solution().addMinimum("b"),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun addMinimum2() {
         assertThat(
             Solution().addMinimum("aaa"),
-            equalTo(6)
+            equalTo(6),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun addMinimum3() {
         assertThat(
             Solution().addMinimum("abc"),
-            equalTo(0)
+            equalTo(0),
         )
     }
 }
diff --git a/src/test/kotlin/g2601_2700/s2646_minimize_the_total_price_of_the_trips/SolutionTest.kt b/src/test/kotlin/g2601_2700/s2646_minimize_the_total_price_of_the_trips/SolutionTest.kt
index 669ba3ede..91c96fbac 100644
--- a/src/test/kotlin/g2601_2700/s2646_minimize_the_total_price_of_the_trips/SolutionTest.kt
+++ b/src/test/kotlin/g2601_2700/s2646_minimize_the_total_price_of_the_trips/SolutionTest.kt
@@ -9,13 +9,16 @@ internal class SolutionTest {
     fun minimumTotalPrice() {
         assertThat(
             Solution().minimumTotalPrice(
-                4, arrayOf(intArrayOf(0, 1), intArrayOf(1, 2), intArrayOf(1, 3)),
+                4,
+                arrayOf(intArrayOf(0, 1), intArrayOf(1, 2), intArrayOf(1, 3)),
                 intArrayOf(2, 2, 10, 6),
                 arrayOf(
-                    intArrayOf(0, 3), intArrayOf(2, 1), intArrayOf(2, 3)
-                )
+                    intArrayOf(0, 3),
+                    intArrayOf(2, 1),
+                    intArrayOf(2, 3),
+                ),
             ),
-            equalTo(23)
+            equalTo(23),
         )
     }
 
@@ -23,12 +26,14 @@ internal class SolutionTest {
     fun minimumTotalPrice2() {
         assertThat(
             Solution().minimumTotalPrice(
-                2, arrayOf(intArrayOf(0, 1)), intArrayOf(2, 2),
+                2,
+                arrayOf(intArrayOf(0, 1)),
+                intArrayOf(2, 2),
                 arrayOf(
-                    intArrayOf(0, 0)
-                )
+                    intArrayOf(0, 0),
+                ),
             ),
-            equalTo(1)
+            equalTo(1),
         )
     }
 }
diff --git a/src/test/kotlin/g2601_2700/s2651_calculate_delayed_arrival_time/SolutionTest.kt b/src/test/kotlin/g2601_2700/s2651_calculate_delayed_arrival_time/SolutionTest.kt
index bbdd29401..deeb5d00f 100644
--- a/src/test/kotlin/g2601_2700/s2651_calculate_delayed_arrival_time/SolutionTest.kt
+++ b/src/test/kotlin/g2601_2700/s2651_calculate_delayed_arrival_time/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun findDelayedArrivalTime() {
         assertThat(
             Solution().findDelayedArrivalTime(15, 5),
-            equalTo(20)
+            equalTo(20),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun findDelayedArrivalTime2() {
         assertThat(
             Solution().findDelayedArrivalTime(13, 11),
-            equalTo(0)
+            equalTo(0),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun findDelayedArrivalTime3() {
         assertThat(
             Solution().findDelayedArrivalTime(14, 11),
-            equalTo(1)
+            equalTo(1),
         )
     }
 }
diff --git a/src/test/kotlin/g2601_2700/s2652_sum_multiples/SolutionTest.kt b/src/test/kotlin/g2601_2700/s2652_sum_multiples/SolutionTest.kt
index a01081b90..4b333ad71 100644
--- a/src/test/kotlin/g2601_2700/s2652_sum_multiples/SolutionTest.kt
+++ b/src/test/kotlin/g2601_2700/s2652_sum_multiples/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun sumOfMultiples() {
         assertThat(
             Solution().sumOfMultiples(7),
-            equalTo(21)
+            equalTo(21),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun sumOfMultiples2() {
         assertThat(
             Solution().sumOfMultiples(10),
-            equalTo(40)
+            equalTo(40),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun sumOfMultiples3() {
         assertThat(
             Solution().sumOfMultiples(9),
-            equalTo(30)
+            equalTo(30),
         )
     }
 }
diff --git a/src/test/kotlin/g2601_2700/s2653_sliding_subarray_beauty/SolutionTest.kt b/src/test/kotlin/g2601_2700/s2653_sliding_subarray_beauty/SolutionTest.kt
index de793ceee..7385cb7e2 100644
--- a/src/test/kotlin/g2601_2700/s2653_sliding_subarray_beauty/SolutionTest.kt
+++ b/src/test/kotlin/g2601_2700/s2653_sliding_subarray_beauty/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun getSubarrayBeauty() {
         assertThat(
             Solution().getSubarrayBeauty(intArrayOf(1, -1, -3, -2, 3), 3, 2),
-            equalTo(intArrayOf(-1, -2, -2))
+            equalTo(intArrayOf(-1, -2, -2)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun getSubarrayBeauty2() {
         assertThat(
             Solution().getSubarrayBeauty(intArrayOf(-1, -2, -3, -4, -5), 2, 2),
-            equalTo(intArrayOf(-1, -2, -3, -4))
+            equalTo(intArrayOf(-1, -2, -3, -4)),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun getSubarrayBeauty3() {
         assertThat(
             Solution().getSubarrayBeauty(intArrayOf(-3, 1, 2, -3, 0, -3), 2, 1),
-            equalTo(intArrayOf(-3, 0, -3, -3, -3))
+            equalTo(intArrayOf(-3, 0, -3, -3, -3)),
         )
     }
 }
diff --git a/src/test/kotlin/g2601_2700/s2654_minimum_number_of_operations_to_make_all_array_elements_equal_to_1/SolutionTest.kt b/src/test/kotlin/g2601_2700/s2654_minimum_number_of_operations_to_make_all_array_elements_equal_to_1/SolutionTest.kt
index ce01d6537..80896221d 100644
--- a/src/test/kotlin/g2601_2700/s2654_minimum_number_of_operations_to_make_all_array_elements_equal_to_1/SolutionTest.kt
+++ b/src/test/kotlin/g2601_2700/s2654_minimum_number_of_operations_to_make_all_array_elements_equal_to_1/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun minOperations() {
         assertThat(
             Solution().minOperations(intArrayOf(2, 6, 3, 4)),
-            equalTo(4)
+            equalTo(4),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun minOperations2() {
         assertThat(
             Solution().minOperations(intArrayOf(2, 10, 6, 14)),
-            equalTo(-1)
+            equalTo(-1),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun minOperations3() {
         assertThat(
             Solution().minOperations(intArrayOf(6, 10, 15)),
-            equalTo(4)
+            equalTo(4),
         )
     }
 }
diff --git a/src/test/kotlin/g2601_2700/s2656_maximum_sum_with_exactly_k_elements/SolutionTest.kt b/src/test/kotlin/g2601_2700/s2656_maximum_sum_with_exactly_k_elements/SolutionTest.kt
index 637432277..cde93874b 100644
--- a/src/test/kotlin/g2601_2700/s2656_maximum_sum_with_exactly_k_elements/SolutionTest.kt
+++ b/src/test/kotlin/g2601_2700/s2656_maximum_sum_with_exactly_k_elements/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun maximizeSum() {
         assertThat(
             Solution().maximizeSum(intArrayOf(1, 2, 3, 4, 5), 3),
-            equalTo(18)
+            equalTo(18),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun maximizeSum2() {
         assertThat(
             Solution().maximizeSum(intArrayOf(5, 5, 5), 2),
-            equalTo(11)
+            equalTo(11),
         )
     }
 }
diff --git a/src/test/kotlin/g2601_2700/s2657_find_the_prefix_common_array_of_two_arrays/SolutionTest.kt b/src/test/kotlin/g2601_2700/s2657_find_the_prefix_common_array_of_two_arrays/SolutionTest.kt
index 326ee2bb1..71fdd2f73 100644
--- a/src/test/kotlin/g2601_2700/s2657_find_the_prefix_common_array_of_two_arrays/SolutionTest.kt
+++ b/src/test/kotlin/g2601_2700/s2657_find_the_prefix_common_array_of_two_arrays/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun findThePrefixCommonArray() {
         assertThat(
             Solution().findThePrefixCommonArray(intArrayOf(1, 3, 2, 4), intArrayOf(3, 1, 2, 4)),
-            equalTo(intArrayOf(0, 2, 3, 4))
+            equalTo(intArrayOf(0, 2, 3, 4)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun findThePrefixCommonArray2() {
         assertThat(
             Solution().findThePrefixCommonArray(intArrayOf(2, 3, 1), intArrayOf(3, 1, 2)),
-            equalTo(intArrayOf(0, 1, 3))
+            equalTo(intArrayOf(0, 1, 3)),
         )
     }
 }
diff --git a/src/test/kotlin/g2601_2700/s2658_maximum_number_of_fish_in_a_grid/SolutionTest.kt b/src/test/kotlin/g2601_2700/s2658_maximum_number_of_fish_in_a_grid/SolutionTest.kt
index ca90fb1d5..4bb2a1ed1 100644
--- a/src/test/kotlin/g2601_2700/s2658_maximum_number_of_fish_in_a_grid/SolutionTest.kt
+++ b/src/test/kotlin/g2601_2700/s2658_maximum_number_of_fish_in_a_grid/SolutionTest.kt
@@ -10,11 +10,13 @@ internal class SolutionTest {
         assertThat(
             Solution().findMaxFish(
                 arrayOf(
-                    intArrayOf(0, 2, 1, 0), intArrayOf(4, 0, 0, 3),
-                    intArrayOf(1, 0, 0, 4), intArrayOf(0, 3, 2, 0)
-                )
+                    intArrayOf(0, 2, 1, 0),
+                    intArrayOf(4, 0, 0, 3),
+                    intArrayOf(1, 0, 0, 4),
+                    intArrayOf(0, 3, 2, 0),
+                ),
             ),
-            equalTo(7)
+            equalTo(7),
         )
     }
 
@@ -23,11 +25,13 @@ internal class SolutionTest {
         assertThat(
             Solution().findMaxFish(
                 arrayOf(
-                    intArrayOf(1, 0, 0, 0), intArrayOf(0, 0, 0, 0),
-                    intArrayOf(0, 0, 0, 0), intArrayOf(0, 0, 0, 1)
-                )
+                    intArrayOf(1, 0, 0, 0),
+                    intArrayOf(0, 0, 0, 0),
+                    intArrayOf(0, 0, 0, 0),
+                    intArrayOf(0, 0, 0, 1),
+                ),
             ),
-            equalTo(1)
+            equalTo(1),
         )
     }
 }
diff --git a/src/test/kotlin/g2601_2700/s2659_make_array_empty/SolutionTest.kt b/src/test/kotlin/g2601_2700/s2659_make_array_empty/SolutionTest.kt
index 1f2b04d3c..84e67a655 100644
--- a/src/test/kotlin/g2601_2700/s2659_make_array_empty/SolutionTest.kt
+++ b/src/test/kotlin/g2601_2700/s2659_make_array_empty/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun countOperationsToEmptyArray() {
         assertThat(
             Solution().countOperationsToEmptyArray(intArrayOf(3, 4, -1)),
-            equalTo(5)
+            equalTo(5),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun countOperationsToEmptyArray2() {
         assertThat(
             Solution().countOperationsToEmptyArray(intArrayOf(1, 2, 4, 3)),
-            equalTo(5)
+            equalTo(5),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun countOperationsToEmptyArray3() {
         assertThat(
             Solution().countOperationsToEmptyArray(intArrayOf(1, 2, 3)),
-            equalTo(3)
+            equalTo(3),
         )
     }
 }
diff --git a/src/test/kotlin/g2601_2700/s2660_determine_the_winner_of_a_bowling_game/SolutionTest.kt b/src/test/kotlin/g2601_2700/s2660_determine_the_winner_of_a_bowling_game/SolutionTest.kt
index b425b8f5f..0c7bcd1c5 100644
--- a/src/test/kotlin/g2601_2700/s2660_determine_the_winner_of_a_bowling_game/SolutionTest.kt
+++ b/src/test/kotlin/g2601_2700/s2660_determine_the_winner_of_a_bowling_game/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun isWinner() {
         assertThat(
             Solution().isWinner(intArrayOf(4, 10, 7, 9), intArrayOf(6, 5, 2, 3)),
-            equalTo(1)
+            equalTo(1),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun isWinner2() {
         assertThat(
             Solution().isWinner(intArrayOf(3, 5, 7, 6), intArrayOf(8, 10, 10, 2)),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun isWinner3() {
         assertThat(
             Solution().isWinner(intArrayOf(2, 3), intArrayOf(4, 1)),
-            equalTo(0)
+            equalTo(0),
         )
     }
 }
diff --git a/src/test/kotlin/g2601_2700/s2661_first_completely_painted_row_or_column/SolutionTest.kt b/src/test/kotlin/g2601_2700/s2661_first_completely_painted_row_or_column/SolutionTest.kt
index 76d40f03a..f4eb320c6 100644
--- a/src/test/kotlin/g2601_2700/s2661_first_completely_painted_row_or_column/SolutionTest.kt
+++ b/src/test/kotlin/g2601_2700/s2661_first_completely_painted_row_or_column/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun firstCompleteIndex() {
         assertThat(
             Solution().firstCompleteIndex(intArrayOf(1, 3, 4, 2), arrayOf(intArrayOf(1, 4), intArrayOf(2, 3))),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -20,10 +20,11 @@ internal class SolutionTest {
                 intArrayOf(2, 8, 7, 4, 1, 3, 5, 6, 9),
                 arrayOf(
                     intArrayOf(3, 2, 5),
-                    intArrayOf(1, 4, 6), intArrayOf(8, 7, 9)
-                )
+                    intArrayOf(1, 4, 6),
+                    intArrayOf(8, 7, 9),
+                ),
             ),
-            equalTo(3)
+            equalTo(3),
         )
     }
 }
diff --git a/src/test/kotlin/g2601_2700/s2662_minimum_cost_of_a_path_with_special_roads/SolutionTest.kt b/src/test/kotlin/g2601_2700/s2662_minimum_cost_of_a_path_with_special_roads/SolutionTest.kt
index 4ad0c19db..7d54d7437 100644
--- a/src/test/kotlin/g2601_2700/s2662_minimum_cost_of_a_path_with_special_roads/SolutionTest.kt
+++ b/src/test/kotlin/g2601_2700/s2662_minimum_cost_of_a_path_with_special_roads/SolutionTest.kt
@@ -9,10 +9,11 @@ internal class SolutionTest {
     fun minimumCost() {
         assertThat(
             Solution().minimumCost(
-                intArrayOf(1, 1), intArrayOf(4, 5),
-                arrayOf(intArrayOf(1, 2, 3, 3, 2), intArrayOf(3, 4, 4, 5, 1))
+                intArrayOf(1, 1),
+                intArrayOf(4, 5),
+                arrayOf(intArrayOf(1, 2, 3, 3, 2), intArrayOf(3, 4, 4, 5, 1)),
             ),
-            equalTo(5)
+            equalTo(5),
         )
     }
 
@@ -20,13 +21,15 @@ internal class SolutionTest {
     fun minimumCost2() {
         assertThat(
             Solution().minimumCost(
-                intArrayOf(3, 2), intArrayOf(5, 7),
+                intArrayOf(3, 2),
+                intArrayOf(5, 7),
                 arrayOf(
                     intArrayOf(3, 2, 3, 4, 4),
-                    intArrayOf(3, 3, 5, 5, 5), intArrayOf(3, 4, 5, 6, 6)
-                )
+                    intArrayOf(3, 3, 5, 5, 5),
+                    intArrayOf(3, 4, 5, 6, 6),
+                ),
             ),
-            equalTo(7)
+            equalTo(7),
         )
     }
 }
diff --git a/src/test/kotlin/g2601_2700/s2663_lexicographically_smallest_beautiful_string/SolutionTest.kt b/src/test/kotlin/g2601_2700/s2663_lexicographically_smallest_beautiful_string/SolutionTest.kt
index 20b840d6a..bd91be6a9 100644
--- a/src/test/kotlin/g2601_2700/s2663_lexicographically_smallest_beautiful_string/SolutionTest.kt
+++ b/src/test/kotlin/g2601_2700/s2663_lexicographically_smallest_beautiful_string/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun smallestBeautifulString() {
         assertThat(
             Solution().smallestBeautifulString("abcz", 26),
-            equalTo("abda")
+            equalTo("abda"),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun smallestBeautifulString2() {
         assertThat(
             Solution().smallestBeautifulString("dc", 4),
-            equalTo("")
+            equalTo(""),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun smallestBeautifulString3() {
         assertThat(
             Solution().smallestBeautifulString("abcd", 4),
-            equalTo("abda")
+            equalTo("abda"),
         )
     }
 
@@ -33,7 +33,7 @@ internal class SolutionTest {
     fun smallestBeautifulString4() {
         assertThat(
             Solution().smallestBeautifulString("abdc", 4),
-            equalTo("acba")
+            equalTo("acba"),
         )
     }
 }
diff --git a/src/test/kotlin/g2601_2700/s2670_find_the_distinct_difference_array/SolutionTest.kt b/src/test/kotlin/g2601_2700/s2670_find_the_distinct_difference_array/SolutionTest.kt
index c57cb4dae..9f988c153 100644
--- a/src/test/kotlin/g2601_2700/s2670_find_the_distinct_difference_array/SolutionTest.kt
+++ b/src/test/kotlin/g2601_2700/s2670_find_the_distinct_difference_array/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun distinctDifferenceArray() {
         assertThat(
             Solution().distinctDifferenceArray(intArrayOf(1, 2, 3, 4, 5)),
-            equalTo(intArrayOf(-3, -1, 1, 3, 5))
+            equalTo(intArrayOf(-3, -1, 1, 3, 5)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun distinctDifferenceArray2() {
         assertThat(
             Solution().distinctDifferenceArray(intArrayOf(3, 2, 3, 4, 2)),
-            equalTo(intArrayOf(-2, -1, 0, 2, 3))
+            equalTo(intArrayOf(-2, -1, 0, 2, 3)),
         )
     }
 }
diff --git a/src/test/kotlin/g2601_2700/s2672_number_of_adjacent_elements_with_the_same_color/SolutionTest.kt b/src/test/kotlin/g2601_2700/s2672_number_of_adjacent_elements_with_the_same_color/SolutionTest.kt
index 7ec3a96ea..f4e01337c 100644
--- a/src/test/kotlin/g2601_2700/s2672_number_of_adjacent_elements_with_the_same_color/SolutionTest.kt
+++ b/src/test/kotlin/g2601_2700/s2672_number_of_adjacent_elements_with_the_same_color/SolutionTest.kt
@@ -11,11 +11,14 @@ internal class SolutionTest {
             Solution().colorTheArray(
                 4,
                 arrayOf(
-                    intArrayOf(0, 2), intArrayOf(1, 2), intArrayOf(3, 1),
-                    intArrayOf(1, 1), intArrayOf(2, 1)
-                )
+                    intArrayOf(0, 2),
+                    intArrayOf(1, 2),
+                    intArrayOf(3, 1),
+                    intArrayOf(1, 1),
+                    intArrayOf(2, 1),
+                ),
             ),
-            equalTo(intArrayOf(0, 1, 1, 0, 2))
+            equalTo(intArrayOf(0, 1, 1, 0, 2)),
         )
     }
 
@@ -23,7 +26,7 @@ internal class SolutionTest {
     fun colorTheArray2() {
         assertThat(
             Solution().colorTheArray(1, arrayOf(intArrayOf(0, 100000))),
-            equalTo(intArrayOf(0))
+            equalTo(intArrayOf(0)),
         )
     }
 }
diff --git a/src/test/kotlin/g2601_2700/s2673_make_costs_of_paths_equal_in_a_binary_tree/SolutionTest.kt b/src/test/kotlin/g2601_2700/s2673_make_costs_of_paths_equal_in_a_binary_tree/SolutionTest.kt
index 352750e26..da4ae09da 100644
--- a/src/test/kotlin/g2601_2700/s2673_make_costs_of_paths_equal_in_a_binary_tree/SolutionTest.kt
+++ b/src/test/kotlin/g2601_2700/s2673_make_costs_of_paths_equal_in_a_binary_tree/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun minIncrements() {
         assertThat(
             Solution().minIncrements(7, intArrayOf(1, 5, 2, 2, 3, 3, 1)),
-            equalTo(6)
+            equalTo(6),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun minIncrements2() {
         assertThat(
             Solution().minIncrements(3, intArrayOf(5, 3, 3)),
-            equalTo(0)
+            equalTo(0),
         )
     }
 }
diff --git a/src/test/kotlin/g2601_2700/s2678_number_of_senior_citizens/SolutionTest.kt b/src/test/kotlin/g2601_2700/s2678_number_of_senior_citizens/SolutionTest.kt
index fc1182564..29c5d9121 100644
--- a/src/test/kotlin/g2601_2700/s2678_number_of_senior_citizens/SolutionTest.kt
+++ b/src/test/kotlin/g2601_2700/s2678_number_of_senior_citizens/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun countSeniors() {
         assertThat(
             Solution().countSeniors(arrayOf("7868190130M7522", "5303914400F9211", "9273338290F4010")),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun countSeniors2() {
         assertThat(
             Solution().countSeniors(arrayOf("1313579440F2036", "2921522980M5644")),
-            equalTo(0)
+            equalTo(0),
         )
     }
 }
diff --git a/src/test/kotlin/g2601_2700/s2679_sum_in_a_matrix/SolutionTest.kt b/src/test/kotlin/g2601_2700/s2679_sum_in_a_matrix/SolutionTest.kt
index 190a76d3e..e9942572f 100644
--- a/src/test/kotlin/g2601_2700/s2679_sum_in_a_matrix/SolutionTest.kt
+++ b/src/test/kotlin/g2601_2700/s2679_sum_in_a_matrix/SolutionTest.kt
@@ -10,11 +10,13 @@ internal class SolutionTest {
         assertThat(
             Solution().matrixSum(
                 arrayOf(
-                    intArrayOf(7, 2, 1), intArrayOf(6, 4, 2),
-                    intArrayOf(6, 5, 3), intArrayOf(3, 2, 1)
-                )
+                    intArrayOf(7, 2, 1),
+                    intArrayOf(6, 4, 2),
+                    intArrayOf(6, 5, 3),
+                    intArrayOf(3, 2, 1),
+                ),
             ),
-            equalTo(15)
+            equalTo(15),
         )
     }
 
@@ -22,7 +24,7 @@ internal class SolutionTest {
     fun matrixSum2() {
         assertThat(
             Solution().matrixSum(arrayOf(intArrayOf(1))),
-            equalTo(1)
+            equalTo(1),
         )
     }
 }
diff --git a/src/test/kotlin/g2601_2700/s2680_maximum_or/SolutionTest.kt b/src/test/kotlin/g2601_2700/s2680_maximum_or/SolutionTest.kt
index 1dc3d61fe..b6a123564 100644
--- a/src/test/kotlin/g2601_2700/s2680_maximum_or/SolutionTest.kt
+++ b/src/test/kotlin/g2601_2700/s2680_maximum_or/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun maximumOr() {
         assertThat(
             Solution().maximumOr(intArrayOf(12, 9), 1),
-            equalTo(30)
+            equalTo(30),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun maximumOr2() {
         assertThat(
             Solution().maximumOr(intArrayOf(8, 1, 2), 2),
-            equalTo(35)
+            equalTo(35),
         )
     }
 }
diff --git a/src/test/kotlin/g2601_2700/s2681_power_of_heroes/SolutionTest.kt b/src/test/kotlin/g2601_2700/s2681_power_of_heroes/SolutionTest.kt
index 559e5acc9..f487c0663 100644
--- a/src/test/kotlin/g2601_2700/s2681_power_of_heroes/SolutionTest.kt
+++ b/src/test/kotlin/g2601_2700/s2681_power_of_heroes/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun sumOfPower() {
         assertThat(
             Solution().sumOfPower(intArrayOf(2, 1, 4)),
-            equalTo(141)
+            equalTo(141),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun sumOfPower2() {
         assertThat(
             Solution().sumOfPower(intArrayOf(1, 1, 1)),
-            equalTo(7)
+            equalTo(7),
         )
     }
 }
diff --git a/src/test/kotlin/g2601_2700/s2682_find_the_losers_of_the_circular_game/SolutionTest.kt b/src/test/kotlin/g2601_2700/s2682_find_the_losers_of_the_circular_game/SolutionTest.kt
index d5cb900ea..9f453c2e1 100644
--- a/src/test/kotlin/g2601_2700/s2682_find_the_losers_of_the_circular_game/SolutionTest.kt
+++ b/src/test/kotlin/g2601_2700/s2682_find_the_losers_of_the_circular_game/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun circularGameLosers() {
         assertThat(
             Solution().circularGameLosers(5, 2),
-            equalTo(intArrayOf(4, 5))
+            equalTo(intArrayOf(4, 5)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun circularGameLosers2() {
         assertThat(
             Solution().circularGameLosers(4, 4),
-            equalTo(intArrayOf(2, 3, 4))
+            equalTo(intArrayOf(2, 3, 4)),
         )
     }
 }
diff --git a/src/test/kotlin/g2601_2700/s2683_neighboring_bitwise_xor/SolutionTest.kt b/src/test/kotlin/g2601_2700/s2683_neighboring_bitwise_xor/SolutionTest.kt
index 2f81a9443..0dea12556 100644
--- a/src/test/kotlin/g2601_2700/s2683_neighboring_bitwise_xor/SolutionTest.kt
+++ b/src/test/kotlin/g2601_2700/s2683_neighboring_bitwise_xor/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun doesValidArrayExist() {
         assertThat(
             Solution().doesValidArrayExist(intArrayOf(1, 1, 0)),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun doesValidArrayExist2() {
         assertThat(
             Solution().doesValidArrayExist(intArrayOf(1, 1)),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun doesValidArrayExist3() {
         assertThat(
             Solution().doesValidArrayExist(intArrayOf(1, 0)),
-            equalTo(false)
+            equalTo(false),
         )
     }
 }
diff --git a/src/test/kotlin/g2601_2700/s2684_maximum_number_of_moves_in_a_grid/SolutionTest.kt b/src/test/kotlin/g2601_2700/s2684_maximum_number_of_moves_in_a_grid/SolutionTest.kt
index 145295a57..2f9f6bb9a 100644
--- a/src/test/kotlin/g2601_2700/s2684_maximum_number_of_moves_in_a_grid/SolutionTest.kt
+++ b/src/test/kotlin/g2601_2700/s2684_maximum_number_of_moves_in_a_grid/SolutionTest.kt
@@ -10,11 +10,13 @@ internal class SolutionTest {
         assertThat(
             Solution().maxMoves(
                 arrayOf(
-                    intArrayOf(2, 4, 3, 5), intArrayOf(5, 4, 9, 3),
-                    intArrayOf(3, 4, 2, 11), intArrayOf(10, 9, 13, 15)
-                )
+                    intArrayOf(2, 4, 3, 5),
+                    intArrayOf(5, 4, 9, 3),
+                    intArrayOf(3, 4, 2, 11),
+                    intArrayOf(10, 9, 13, 15),
+                ),
             ),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
@@ -22,7 +24,7 @@ internal class SolutionTest {
     fun maxMoves2() {
         assertThat(
             Solution().maxMoves(arrayOf(intArrayOf(3, 2, 4), intArrayOf(2, 1, 9), intArrayOf(1, 1, 7))),
-            equalTo(0)
+            equalTo(0),
         )
     }
 }
diff --git a/src/test/kotlin/g2601_2700/s2685_count_the_number_of_complete_components/SolutionTest.kt b/src/test/kotlin/g2601_2700/s2685_count_the_number_of_complete_components/SolutionTest.kt
index f03b9c251..c1dc8732f 100644
--- a/src/test/kotlin/g2601_2700/s2685_count_the_number_of_complete_components/SolutionTest.kt
+++ b/src/test/kotlin/g2601_2700/s2685_count_the_number_of_complete_components/SolutionTest.kt
@@ -12,10 +12,12 @@ internal class SolutionTest {
                 6,
                 arrayOf(
                     intArrayOf(0, 1),
-                    intArrayOf(0, 2), intArrayOf(1, 2), intArrayOf(3, 4)
-                )
+                    intArrayOf(0, 2),
+                    intArrayOf(1, 2),
+                    intArrayOf(3, 4),
+                ),
             ),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
@@ -26,11 +28,13 @@ internal class SolutionTest {
                 6,
                 arrayOf(
                     intArrayOf(0, 1),
-                    intArrayOf(0, 2), intArrayOf(1, 2),
-                    intArrayOf(3, 4), intArrayOf(3, 5)
-                )
+                    intArrayOf(0, 2),
+                    intArrayOf(1, 2),
+                    intArrayOf(3, 4),
+                    intArrayOf(3, 5),
+                ),
             ),
-            equalTo(1)
+            equalTo(1),
         )
     }
 }
diff --git a/src/test/kotlin/g2601_2700/s2696_minimum_string_length_after_removing_substrings/SolutionTest.kt b/src/test/kotlin/g2601_2700/s2696_minimum_string_length_after_removing_substrings/SolutionTest.kt
index c665bbad4..7f463bc40 100644
--- a/src/test/kotlin/g2601_2700/s2696_minimum_string_length_after_removing_substrings/SolutionTest.kt
+++ b/src/test/kotlin/g2601_2700/s2696_minimum_string_length_after_removing_substrings/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun minLength() {
         assertThat(
             Solution().minLength("ABFCACDB"),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun minLength2() {
         assertThat(
             Solution().minLength("ACBBD"),
-            equalTo(5)
+            equalTo(5),
         )
     }
 }
diff --git a/src/test/kotlin/g2601_2700/s2697_lexicographically_smallest_palindrome/SolutionTest.kt b/src/test/kotlin/g2601_2700/s2697_lexicographically_smallest_palindrome/SolutionTest.kt
index b2db762e8..29e2dd99d 100644
--- a/src/test/kotlin/g2601_2700/s2697_lexicographically_smallest_palindrome/SolutionTest.kt
+++ b/src/test/kotlin/g2601_2700/s2697_lexicographically_smallest_palindrome/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun makeSmallestPalindrome() {
         assertThat(
             Solution().makeSmallestPalindrome("egcfe"),
-            equalTo("efcfe")
+            equalTo("efcfe"),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun makeSmallestPalindrome2() {
         assertThat(
             Solution().makeSmallestPalindrome("abcd"),
-            equalTo("abba")
+            equalTo("abba"),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun makeSmallestPalindrome3() {
         assertThat(
             Solution().makeSmallestPalindrome("seven"),
-            equalTo("neven")
+            equalTo("neven"),
         )
     }
 }
diff --git a/src/test/kotlin/g2601_2700/s2698_find_the_punishment_number_of_an_integer/SolutionTest.kt b/src/test/kotlin/g2601_2700/s2698_find_the_punishment_number_of_an_integer/SolutionTest.kt
index 6fdb20d2b..26abf7535 100644
--- a/src/test/kotlin/g2601_2700/s2698_find_the_punishment_number_of_an_integer/SolutionTest.kt
+++ b/src/test/kotlin/g2601_2700/s2698_find_the_punishment_number_of_an_integer/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun punishmentNumber() {
         assertThat(
             Solution().punishmentNumber(10),
-            equalTo(182)
+            equalTo(182),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun punishmentNumber2() {
         assertThat(
             Solution().punishmentNumber(37),
-            equalTo(1478)
+            equalTo(1478),
         )
     }
 }
diff --git a/src/test/kotlin/g2601_2700/s2699_modify_graph_edge_weights/SolutionTest.kt b/src/test/kotlin/g2601_2700/s2699_modify_graph_edge_weights/SolutionTest.kt
index 7adc26ffa..a22e6eb21 100644
--- a/src/test/kotlin/g2601_2700/s2699_modify_graph_edge_weights/SolutionTest.kt
+++ b/src/test/kotlin/g2601_2700/s2699_modify_graph_edge_weights/SolutionTest.kt
@@ -12,12 +12,15 @@ internal class SolutionTest {
                 5,
                 arrayOf(
                     intArrayOf(4, 1, -1),
-                    intArrayOf(2, 0, -1), intArrayOf(0, 3, -1),
-                    intArrayOf(4, 3, -1)
+                    intArrayOf(2, 0, -1),
+                    intArrayOf(0, 3, -1),
+                    intArrayOf(4, 3, -1),
                 ),
-                0, 1, 5
+                0,
+                1,
+                5,
             ),
-            equalTo(arrayOf(intArrayOf(4, 1, 1), intArrayOf(2, 0, 1), intArrayOf(0, 3, 1), intArrayOf(4, 3, 3)))
+            equalTo(arrayOf(intArrayOf(4, 1, 1), intArrayOf(2, 0, 1), intArrayOf(0, 3, 1), intArrayOf(4, 3, 3))),
         )
     }
 
@@ -28,11 +31,13 @@ internal class SolutionTest {
                 3,
                 arrayOf(
                     intArrayOf(0, 1, -1),
-                    intArrayOf(0, 2, 5)
+                    intArrayOf(0, 2, 5),
                 ),
-                0, 2, 6
+                0,
+                2,
+                6,
             ),
-            equalTo(arrayOf())
+            equalTo(arrayOf()),
         )
     }
 
@@ -43,11 +48,15 @@ internal class SolutionTest {
                 4,
                 arrayOf(
                     intArrayOf(1, 0, 4),
-                    intArrayOf(1, 2, 3), intArrayOf(2, 3, 5), intArrayOf(0, 3, -1)
+                    intArrayOf(1, 2, 3),
+                    intArrayOf(2, 3, 5),
+                    intArrayOf(0, 3, -1),
                 ),
-                0, 2, 6
+                0,
+                2,
+                6,
             ),
-            equalTo(arrayOf(intArrayOf(1, 0, 4), intArrayOf(1, 2, 3), intArrayOf(2, 3, 5), intArrayOf(0, 3, 1)))
+            equalTo(arrayOf(intArrayOf(1, 0, 4), intArrayOf(1, 2, 3), intArrayOf(2, 3, 5), intArrayOf(0, 3, 1))),
         )
     }
 }
diff --git a/src/test/kotlin/g2701_2800/s2706_buy_two_chocolates/SolutionTest.kt b/src/test/kotlin/g2701_2800/s2706_buy_two_chocolates/SolutionTest.kt
index 2f6c67f5a..e8eaf678e 100644
--- a/src/test/kotlin/g2701_2800/s2706_buy_two_chocolates/SolutionTest.kt
+++ b/src/test/kotlin/g2701_2800/s2706_buy_two_chocolates/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun buyChoco() {
         assertThat(
             Solution().buyChoco(intArrayOf(1, 2, 2), 3),
-            equalTo(0)
+            equalTo(0),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun buyChoco2() {
         assertThat(
             Solution().buyChoco(intArrayOf(3, 2, 3), 3),
-            equalTo(3)
+            equalTo(3),
         )
     }
 }
diff --git a/src/test/kotlin/g2701_2800/s2707_extra_characters_in_a_string/SolutionTest.kt b/src/test/kotlin/g2701_2800/s2707_extra_characters_in_a_string/SolutionTest.kt
index 65674c63e..281eef076 100644
--- a/src/test/kotlin/g2701_2800/s2707_extra_characters_in_a_string/SolutionTest.kt
+++ b/src/test/kotlin/g2701_2800/s2707_extra_characters_in_a_string/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun minExtraChar() {
         assertThat(
             Solution().minExtraChar("leetscode", arrayOf("leet", "code", "leetcode")),
-            equalTo(1)
+            equalTo(1),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun minExtraChar2() {
         assertThat(
             Solution().minExtraChar("sayhelloworld", arrayOf("hello", "world")),
-            equalTo(3)
+            equalTo(3),
         )
     }
 }
diff --git a/src/test/kotlin/g2701_2800/s2708_maximum_strength_of_a_group/SolutionTest.kt b/src/test/kotlin/g2701_2800/s2708_maximum_strength_of_a_group/SolutionTest.kt
index 52c74583c..3d0c9223b 100644
--- a/src/test/kotlin/g2701_2800/s2708_maximum_strength_of_a_group/SolutionTest.kt
+++ b/src/test/kotlin/g2701_2800/s2708_maximum_strength_of_a_group/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun maxStrength() {
         assertThat(
             Solution().maxStrength(intArrayOf(3, -1, -5, 2, 5, -9)),
-            equalTo(1350)
+            equalTo(1350),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun maxStrength2() {
         assertThat(
             Solution().maxStrength(intArrayOf(-4, -5, -4)),
-            equalTo(20)
+            equalTo(20),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun maxStrength3() {
         assertThat(
             Solution().maxStrength(intArrayOf(8, 6, 0, 5, -4, -8, -4, 9, -1, 6, -4, 8, -5)),
-            equalTo(265420800)
+            equalTo(265420800),
         )
     }
 }
diff --git a/src/test/kotlin/g2701_2800/s2709_greatest_common_divisor_traversal/SolutionTest.kt b/src/test/kotlin/g2701_2800/s2709_greatest_common_divisor_traversal/SolutionTest.kt
index 9f368a56d..123bcc791 100644
--- a/src/test/kotlin/g2701_2800/s2709_greatest_common_divisor_traversal/SolutionTest.kt
+++ b/src/test/kotlin/g2701_2800/s2709_greatest_common_divisor_traversal/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun canTraverseAllPairs() {
         assertThat(
             Solution().canTraverseAllPairs(intArrayOf(2, 3, 6)),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun canTraverseAllPairs2() {
         assertThat(
             Solution().canTraverseAllPairs(intArrayOf(3, 9, 5)),
-            equalTo(false)
+            equalTo(false),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun canTraverseAllPairs3() {
         assertThat(
             Solution().canTraverseAllPairs(intArrayOf(4, 3, 12, 8)),
-            equalTo(true)
+            equalTo(true),
         )
     }
 }
diff --git a/src/test/kotlin/g2701_2800/s2710_remove_trailing_zeros_from_a_string/SolutionTest.kt b/src/test/kotlin/g2701_2800/s2710_remove_trailing_zeros_from_a_string/SolutionTest.kt
index 87906a34b..0b64fb059 100644
--- a/src/test/kotlin/g2701_2800/s2710_remove_trailing_zeros_from_a_string/SolutionTest.kt
+++ b/src/test/kotlin/g2701_2800/s2710_remove_trailing_zeros_from_a_string/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun removeTrailingZeros() {
         assertThat(
             Solution().removeTrailingZeros("51230100"),
-            equalTo("512301")
+            equalTo("512301"),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun removeTrailingZeros2() {
         assertThat(
             Solution().removeTrailingZeros("123"),
-            equalTo("123")
+            equalTo("123"),
         )
     }
 }
diff --git a/src/test/kotlin/g2701_2800/s2711_difference_of_number_of_distinct_values_on_diagonals/SolutionTest.kt b/src/test/kotlin/g2701_2800/s2711_difference_of_number_of_distinct_values_on_diagonals/SolutionTest.kt
index 2dc2453f7..aa598bfd0 100644
--- a/src/test/kotlin/g2701_2800/s2711_difference_of_number_of_distinct_values_on_diagonals/SolutionTest.kt
+++ b/src/test/kotlin/g2701_2800/s2711_difference_of_number_of_distinct_values_on_diagonals/SolutionTest.kt
@@ -11,10 +11,11 @@ internal class SolutionTest {
             Solution().differenceOfDistinctValues(
                 arrayOf(
                     intArrayOf(1, 2, 3),
-                    intArrayOf(3, 1, 5), intArrayOf(3, 2, 1)
-                )
+                    intArrayOf(3, 1, 5),
+                    intArrayOf(3, 2, 1),
+                ),
             ),
-            equalTo(arrayOf(intArrayOf(1, 1, 0), intArrayOf(1, 0, 1), intArrayOf(0, 1, 1)))
+            equalTo(arrayOf(intArrayOf(1, 1, 0), intArrayOf(1, 0, 1), intArrayOf(0, 1, 1))),
         )
     }
 
@@ -22,7 +23,7 @@ internal class SolutionTest {
     fun differenceOfDistinctValues2() {
         assertThat(
             Solution().differenceOfDistinctValues(arrayOf(intArrayOf(1))),
-            equalTo(arrayOf(intArrayOf(0)))
+            equalTo(arrayOf(intArrayOf(0))),
         )
     }
 }
diff --git a/src/test/kotlin/g2701_2800/s2712_minimum_cost_to_make_all_characters_equal/SolutionTest.kt b/src/test/kotlin/g2701_2800/s2712_minimum_cost_to_make_all_characters_equal/SolutionTest.kt
index 56fce9482..1c7d786ef 100644
--- a/src/test/kotlin/g2701_2800/s2712_minimum_cost_to_make_all_characters_equal/SolutionTest.kt
+++ b/src/test/kotlin/g2701_2800/s2712_minimum_cost_to_make_all_characters_equal/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun minimumCost() {
         assertThat(
             Solution().minimumCost("0011"),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun minimumCost2() {
         assertThat(
             Solution().minimumCost("010101"),
-            equalTo(9)
+            equalTo(9),
         )
     }
 }
diff --git a/src/test/kotlin/g2701_2800/s2713_maximum_strictly_increasing_cells_in_a_matrix/SolutionTest.kt b/src/test/kotlin/g2701_2800/s2713_maximum_strictly_increasing_cells_in_a_matrix/SolutionTest.kt
index f56fc5015..b2f9f72bf 100644
--- a/src/test/kotlin/g2701_2800/s2713_maximum_strictly_increasing_cells_in_a_matrix/SolutionTest.kt
+++ b/src/test/kotlin/g2701_2800/s2713_maximum_strictly_increasing_cells_in_a_matrix/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun maxIncreasingCells() {
         assertThat(
             Solution().maxIncreasingCells(arrayOf(intArrayOf(3, 1), intArrayOf(3, 4))),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun maxIncreasingCells2() {
         assertThat(
             Solution().maxIncreasingCells(arrayOf(intArrayOf(1, 1), intArrayOf(1, 1))),
-            equalTo(1)
+            equalTo(1),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun maxIncreasingCells3() {
         assertThat(
             Solution().maxIncreasingCells(arrayOf(intArrayOf(3, 1, 6), intArrayOf(-9, 5, 7))),
-            equalTo(4)
+            equalTo(4),
         )
     }
 }
diff --git a/src/test/kotlin/g2701_2800/s2716_minimize_string_length/SolutionTest.kt b/src/test/kotlin/g2701_2800/s2716_minimize_string_length/SolutionTest.kt
index 4f702f5f7..1e7f762e2 100644
--- a/src/test/kotlin/g2701_2800/s2716_minimize_string_length/SolutionTest.kt
+++ b/src/test/kotlin/g2701_2800/s2716_minimize_string_length/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun minimizedStringLength() {
         assertThat(
             Solution().minimizedStringLength("aaabc"),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun minimizedStringLength2() {
         assertThat(
             Solution().minimizedStringLength("cbbd"),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun minimizedStringLength3() {
         assertThat(
             Solution().minimizedStringLength("dddaaa"),
-            equalTo(2)
+            equalTo(2),
         )
     }
 }
diff --git a/src/test/kotlin/g2701_2800/s2717_semi_ordered_permutation/SolutionTest.kt b/src/test/kotlin/g2701_2800/s2717_semi_ordered_permutation/SolutionTest.kt
index 48da79d45..71a9db3d4 100644
--- a/src/test/kotlin/g2701_2800/s2717_semi_ordered_permutation/SolutionTest.kt
+++ b/src/test/kotlin/g2701_2800/s2717_semi_ordered_permutation/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun semiOrderedPermutation() {
         assertThat(
             Solution().semiOrderedPermutation(intArrayOf(2, 1, 4, 3)),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun semiOrderedPermutation2() {
         assertThat(
             Solution().semiOrderedPermutation(intArrayOf(2, 4, 1, 3)),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun semiOrderedPermutation3() {
         assertThat(
             Solution().semiOrderedPermutation(intArrayOf(1, 3, 4, 2, 5)),
-            equalTo(0)
+            equalTo(0),
         )
     }
 }
diff --git a/src/test/kotlin/g2701_2800/s2718_sum_of_matrix_after_queries/SolutionTest.kt b/src/test/kotlin/g2701_2800/s2718_sum_of_matrix_after_queries/SolutionTest.kt
index 1af7e7679..aa50397c2 100644
--- a/src/test/kotlin/g2701_2800/s2718_sum_of_matrix_after_queries/SolutionTest.kt
+++ b/src/test/kotlin/g2701_2800/s2718_sum_of_matrix_after_queries/SolutionTest.kt
@@ -11,11 +11,13 @@ internal class SolutionTest {
             Solution().matrixSumQueries(
                 3,
                 arrayOf(
-                    intArrayOf(0, 0, 1), intArrayOf(1, 2, 2),
-                    intArrayOf(0, 2, 3), intArrayOf(1, 0, 4)
-                )
+                    intArrayOf(0, 0, 1),
+                    intArrayOf(1, 2, 2),
+                    intArrayOf(0, 2, 3),
+                    intArrayOf(1, 0, 4),
+                ),
             ),
-            equalTo(23)
+            equalTo(23),
         )
     }
 
@@ -25,11 +27,14 @@ internal class SolutionTest {
             Solution().matrixSumQueries(
                 3,
                 arrayOf(
-                    intArrayOf(0, 0, 4), intArrayOf(0, 1, 2),
-                    intArrayOf(1, 0, 1), intArrayOf(0, 2, 3), intArrayOf(1, 2, 1)
-                )
+                    intArrayOf(0, 0, 4),
+                    intArrayOf(0, 1, 2),
+                    intArrayOf(1, 0, 1),
+                    intArrayOf(0, 2, 3),
+                    intArrayOf(1, 2, 1),
+                ),
             ),
-            equalTo(17)
+            equalTo(17),
         )
     }
 }
diff --git a/src/test/kotlin/g2701_2800/s2719_count_of_integers/SolutionTest.kt b/src/test/kotlin/g2701_2800/s2719_count_of_integers/SolutionTest.kt
index bfd086194..ae81d7135 100644
--- a/src/test/kotlin/g2701_2800/s2719_count_of_integers/SolutionTest.kt
+++ b/src/test/kotlin/g2701_2800/s2719_count_of_integers/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun count() {
         assertThat(
             Solution().count("1", "12", 1, 8),
-            equalTo(11)
+            equalTo(11),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun count2() {
         assertThat(
             Solution().count("1", "5", 1, 5),
-            equalTo(5)
+            equalTo(5),
         )
     }
 }
diff --git a/src/test/kotlin/g2701_2800/s2729_check_if_the_number_is_fascinating/SolutionTest.kt b/src/test/kotlin/g2701_2800/s2729_check_if_the_number_is_fascinating/SolutionTest.kt
index 7d3698b8c..052ef7edb 100644
--- a/src/test/kotlin/g2701_2800/s2729_check_if_the_number_is_fascinating/SolutionTest.kt
+++ b/src/test/kotlin/g2701_2800/s2729_check_if_the_number_is_fascinating/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun isFascinating() {
         assertThat(
             Solution().isFascinating(192),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun isFascinating2() {
         assertThat(
             Solution().isFascinating(100),
-            equalTo(false)
+            equalTo(false),
         )
     }
 }
diff --git a/src/test/kotlin/g2701_2800/s2732_find_a_good_subset_of_the_matrix/SolutionTest.kt b/src/test/kotlin/g2701_2800/s2732_find_a_good_subset_of_the_matrix/SolutionTest.kt
index 202c89f64..3ccdd1aa9 100644
--- a/src/test/kotlin/g2701_2800/s2732_find_a_good_subset_of_the_matrix/SolutionTest.kt
+++ b/src/test/kotlin/g2701_2800/s2732_find_a_good_subset_of_the_matrix/SolutionTest.kt
@@ -11,10 +11,11 @@ internal class SolutionTest {
             Solution().goodSubsetofBinaryMatrix(
                 arrayOf(
                     intArrayOf(0, 1, 1, 0),
-                    intArrayOf(0, 0, 0, 1), intArrayOf(1, 1, 1, 1)
-                )
+                    intArrayOf(0, 0, 0, 1),
+                    intArrayOf(1, 1, 1, 1),
+                ),
             ),
-            equalTo(listOf(0, 1))
+            equalTo(listOf(0, 1)),
         )
     }
 
@@ -29,10 +30,10 @@ internal class SolutionTest {
             Solution().goodSubsetofBinaryMatrix(
                 arrayOf(
                     intArrayOf(1, 1, 1),
-                    intArrayOf(1, 1, 1)
-                )
+                    intArrayOf(1, 1, 1),
+                ),
             ),
-            equalTo(listOf())
+            equalTo(listOf()),
         )
     }
 }
diff --git a/src/test/kotlin/g2701_2800/s2736_maximum_sum_queries/SolutionTest.kt b/src/test/kotlin/g2701_2800/s2736_maximum_sum_queries/SolutionTest.kt
index c11bb3ce5..24102b84f 100644
--- a/src/test/kotlin/g2701_2800/s2736_maximum_sum_queries/SolutionTest.kt
+++ b/src/test/kotlin/g2701_2800/s2736_maximum_sum_queries/SolutionTest.kt
@@ -9,13 +9,15 @@ internal class SolutionTest {
     fun maximumSumQueries() {
         assertThat(
             Solution().maximumSumQueries(
-                intArrayOf(4, 3, 1, 2), intArrayOf(2, 4, 9, 5),
+                intArrayOf(4, 3, 1, 2),
+                intArrayOf(2, 4, 9, 5),
                 arrayOf(
                     intArrayOf(4, 1),
-                    intArrayOf(1, 3), intArrayOf(2, 5)
-                )
+                    intArrayOf(1, 3),
+                    intArrayOf(2, 5),
+                ),
             ),
-            equalTo(intArrayOf(6, 10, 7))
+            equalTo(intArrayOf(6, 10, 7)),
         )
     }
 
@@ -23,13 +25,15 @@ internal class SolutionTest {
     fun maximumSumQueries2() {
         assertThat(
             Solution().maximumSumQueries(
-                intArrayOf(3, 2, 5), intArrayOf(2, 3, 4),
+                intArrayOf(3, 2, 5),
+                intArrayOf(2, 3, 4),
                 arrayOf(
                     intArrayOf(4, 4),
-                    intArrayOf(3, 2), intArrayOf(1, 1)
-                )
+                    intArrayOf(3, 2),
+                    intArrayOf(1, 1),
+                ),
             ),
-            equalTo(intArrayOf(9, 9, 9))
+            equalTo(intArrayOf(9, 9, 9)),
         )
     }
 
@@ -37,10 +41,11 @@ internal class SolutionTest {
     fun maximumSumQueries3() {
         assertThat(
             Solution().maximumSumQueries(
-                intArrayOf(2, 1), intArrayOf(2, 3),
-                arrayOf(intArrayOf(3, 3))
+                intArrayOf(2, 1),
+                intArrayOf(2, 3),
+                arrayOf(intArrayOf(3, 3)),
             ),
-            equalTo(intArrayOf(-1))
+            equalTo(intArrayOf(-1)),
         )
     }
 }
diff --git a/src/test/kotlin/g2701_2800/s2747_count_zero_request_servers/SolutionTest.kt b/src/test/kotlin/g2701_2800/s2747_count_zero_request_servers/SolutionTest.kt
index 28e90b416..0a02c3518 100644
--- a/src/test/kotlin/g2701_2800/s2747_count_zero_request_servers/SolutionTest.kt
+++ b/src/test/kotlin/g2701_2800/s2747_count_zero_request_servers/SolutionTest.kt
@@ -9,12 +9,14 @@ internal class SolutionTest {
     fun countServers() {
         assertThat(
             Solution().countServers(
-                3, arrayOf(intArrayOf(1, 3), intArrayOf(2, 6), intArrayOf(1, 5)), 5,
-                intArrayOf(10, 11)
+                3,
+                arrayOf(intArrayOf(1, 3), intArrayOf(2, 6), intArrayOf(1, 5)),
+                5,
+                intArrayOf(10, 11),
             ),
             equalTo(
-                intArrayOf(1, 2)
-            )
+                intArrayOf(1, 2),
+            ),
         )
     }
 
@@ -24,14 +26,17 @@ internal class SolutionTest {
             Solution().countServers(
                 3,
                 arrayOf(
-                    intArrayOf(2, 4), intArrayOf(2, 1), intArrayOf(1, 2),
-                    intArrayOf(3, 1)
+                    intArrayOf(2, 4),
+                    intArrayOf(2, 1),
+                    intArrayOf(1, 2),
+                    intArrayOf(3, 1),
                 ),
-                2, intArrayOf(3, 4)
+                2,
+                intArrayOf(3, 4),
             ),
             equalTo(
-                intArrayOf(0, 1)
-            )
+                intArrayOf(0, 1),
+            ),
         )
     }
 }
diff --git a/src/test/kotlin/g2701_2800/s2751_robot_collisions/SolutionTest.kt b/src/test/kotlin/g2701_2800/s2751_robot_collisions/SolutionTest.kt
index dd77f1341..55b14133d 100644
--- a/src/test/kotlin/g2701_2800/s2751_robot_collisions/SolutionTest.kt
+++ b/src/test/kotlin/g2701_2800/s2751_robot_collisions/SolutionTest.kt
@@ -10,8 +10,8 @@ internal class SolutionTest {
         assertThat(
             Solution().survivedRobotsHealths(intArrayOf(5, 4, 3, 2, 1), intArrayOf(2, 17, 9, 15, 10), "RRRRR"),
             equalTo(
-                listOf(2, 17, 9, 15, 10)
-            )
+                listOf(2, 17, 9, 15, 10),
+            ),
         )
     }
 
@@ -20,8 +20,8 @@ internal class SolutionTest {
         assertThat(
             Solution().survivedRobotsHealths(intArrayOf(3, 5, 2, 6), intArrayOf(10, 10, 15, 12), "RLRL"),
             equalTo(
-                listOf(14)
-            )
+                listOf(14),
+            ),
         )
     }
 
@@ -30,8 +30,8 @@ internal class SolutionTest {
         assertThat(
             Solution().survivedRobotsHealths(intArrayOf(1, 2, 5, 6), intArrayOf(10, 10, 11, 11), "RLRL"),
             equalTo(
-                listOf()
-            )
+                listOf(),
+            ),
         )
     }
 
@@ -40,11 +40,12 @@ internal class SolutionTest {
         assertThat(
             Solution().survivedRobotsHealths(
                 intArrayOf(3, 2, 30, 24, 38, 7),
-                intArrayOf(47, 12, 49, 11, 47, 38), "RRLRRR"
+                intArrayOf(47, 12, 49, 11, 47, 38),
+                "RRLRRR",
             ),
             equalTo(
-                listOf(12, 47)
-            )
+                listOf(12, 47),
+            ),
         )
     }
 
@@ -53,8 +54,8 @@ internal class SolutionTest {
         assertThat(
             Solution().survivedRobotsHealths(intArrayOf(1, 40), intArrayOf(10, 11), "RL"),
             equalTo(
-                listOf(10)
-            )
+                listOf(10),
+            ),
         )
     }
 }
diff --git a/src/test/kotlin/g2701_2800/s2766_relocate_marbles/SolutionTest.kt b/src/test/kotlin/g2701_2800/s2766_relocate_marbles/SolutionTest.kt
index 43c71f1b2..5574d8d47 100644
--- a/src/test/kotlin/g2701_2800/s2766_relocate_marbles/SolutionTest.kt
+++ b/src/test/kotlin/g2701_2800/s2766_relocate_marbles/SolutionTest.kt
@@ -9,10 +9,11 @@ internal class SolutionTest {
     fun relocateMarbles() {
         assertThat(
             Solution().relocateMarbles(
-                intArrayOf(1, 6, 7, 8), intArrayOf(1, 7, 2),
-                intArrayOf(2, 9, 5)
+                intArrayOf(1, 6, 7, 8),
+                intArrayOf(1, 7, 2),
+                intArrayOf(2, 9, 5),
             ),
-            equalTo(listOf(5, 6, 8, 9))
+            equalTo(listOf(5, 6, 8, 9)),
         )
     }
 
@@ -20,10 +21,11 @@ internal class SolutionTest {
     fun relocateMarbles2() {
         assertThat(
             Solution().relocateMarbles(
-                intArrayOf(1, 1, 3, 3), intArrayOf(1, 3),
-                intArrayOf(2, 2)
+                intArrayOf(1, 1, 3, 3),
+                intArrayOf(1, 3),
+                intArrayOf(2, 2),
             ),
-            equalTo(listOf(2))
+            equalTo(listOf(2)),
         )
     }
 }
diff --git a/src/test/kotlin/g2701_2800/s2768_number_of_black_blocks/SolutionTest.kt b/src/test/kotlin/g2701_2800/s2768_number_of_black_blocks/SolutionTest.kt
index d73d47b80..94ba0877b 100644
--- a/src/test/kotlin/g2701_2800/s2768_number_of_black_blocks/SolutionTest.kt
+++ b/src/test/kotlin/g2701_2800/s2768_number_of_black_blocks/SolutionTest.kt
@@ -14,13 +14,15 @@ internal class SolutionTest {
     fun countBlackBlocks2() {
         assertThat(
             Solution().countBlackBlocks(
-                3, 3,
+                3,
+                3,
                 arrayOf(
-                    intArrayOf(0, 0), intArrayOf(1, 1),
-                    intArrayOf(0, 2)
-                )
+                    intArrayOf(0, 0),
+                    intArrayOf(1, 1),
+                    intArrayOf(0, 2),
+                ),
             ),
-            equalTo(longArrayOf(0, 2, 2, 0, 0))
+            equalTo(longArrayOf(0, 2, 2, 0, 0)),
         )
     }
 }
diff --git a/src/test/kotlin/g2701_2800/s2771_longest_non_decreasing_subarray_from_two_arrays/SolutionTest.kt b/src/test/kotlin/g2701_2800/s2771_longest_non_decreasing_subarray_from_two_arrays/SolutionTest.kt
index 7badf7415..4833926ba 100644
--- a/src/test/kotlin/g2701_2800/s2771_longest_non_decreasing_subarray_from_two_arrays/SolutionTest.kt
+++ b/src/test/kotlin/g2701_2800/s2771_longest_non_decreasing_subarray_from_two_arrays/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun maxNonDecreasingLength() {
         assertThat(
             Solution().maxNonDecreasingLength(intArrayOf(2, 3, 1), intArrayOf(1, 2, 1)),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun maxNonDecreasingLength2() {
         assertThat(
             Solution().maxNonDecreasingLength(intArrayOf(1, 3, 2, 1), intArrayOf(2, 2, 3, 4)),
-            equalTo(4)
+            equalTo(4),
         )
     }
 }
diff --git a/src/test/kotlin/g2701_2800/s2781_length_of_the_longest_valid_substring/SolutionTest.kt b/src/test/kotlin/g2701_2800/s2781_length_of_the_longest_valid_substring/SolutionTest.kt
index 095a5a202..ad282810e 100644
--- a/src/test/kotlin/g2701_2800/s2781_length_of_the_longest_valid_substring/SolutionTest.kt
+++ b/src/test/kotlin/g2701_2800/s2781_length_of_the_longest_valid_substring/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun longestValidSubstring() {
         assertThat(
             Solution().longestValidSubstring("cbaaaabc", mutableListOf("aaa", "cb")),
-            equalTo(4)
+            equalTo(4),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun longestValidSubstring2() {
         assertThat(
             Solution().longestValidSubstring("leetcode", mutableListOf("de", "le", "e")),
-            equalTo(4)
+            equalTo(4),
         )
     }
 }
diff --git a/src/test/kotlin/g2701_2800/s2788_split_strings_by_separator/SolutionTest.kt b/src/test/kotlin/g2701_2800/s2788_split_strings_by_separator/SolutionTest.kt
index 7e9b47a59..c1d8f6bf0 100644
--- a/src/test/kotlin/g2701_2800/s2788_split_strings_by_separator/SolutionTest.kt
+++ b/src/test/kotlin/g2701_2800/s2788_split_strings_by_separator/SolutionTest.kt
@@ -9,9 +9,10 @@ internal class SolutionTest {
     fun splitWordsBySeparator() {
         assertThat(
             Solution().splitWordsBySeparator(
-                listOf("one.two.three", "four.five", "six"), '.'
+                listOf("one.two.three", "four.five", "six"),
+                '.',
             ),
-            equalTo(listOf("one", "two", "three", "four", "five", "six"))
+            equalTo(listOf("one", "two", "three", "four", "five", "six")),
         )
     }
 
@@ -19,9 +20,10 @@ internal class SolutionTest {
     fun splitWordsBySeparator2() {
         assertThat(
             Solution().splitWordsBySeparator(
-                listOf("\$easy\$", "\$problem\$"), '$'
+                listOf("\$easy\$", "\$problem\$"),
+                '$',
             ),
-            equalTo(listOf("easy", "problem"))
+            equalTo(listOf("easy", "problem")),
         )
     }
 }
diff --git a/src/test/kotlin/g2801_2900/s2807_insert_greatest_common_divisors_in_linked_list/SolutionTest.kt b/src/test/kotlin/g2801_2900/s2807_insert_greatest_common_divisors_in_linked_list/SolutionTest.kt
index 9d0ed1ccf..f5bdac44e 100644
--- a/src/test/kotlin/g2801_2900/s2807_insert_greatest_common_divisors_in_linked_list/SolutionTest.kt
+++ b/src/test/kotlin/g2801_2900/s2807_insert_greatest_common_divisors_in_linked_list/SolutionTest.kt
@@ -11,13 +11,13 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .insertGreatestCommonDivisors(
-                    contructLinkedList(intArrayOf(18, 6, 10, 3))
+                    contructLinkedList(intArrayOf(18, 6, 10, 3)),
                 )
                 .toString(),
             equalTo(
                 contructLinkedList(intArrayOf(18, 6, 6, 2, 10, 1, 3))
-                    .toString()
-            )
+                    .toString(),
+            ),
         )
     }
 
@@ -26,10 +26,10 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .insertGreatestCommonDivisors(
-                    contructLinkedList(intArrayOf(7))
+                    contructLinkedList(intArrayOf(7)),
                 )
                 .toString(),
-            equalTo(contructLinkedList(intArrayOf(7)).toString())
+            equalTo(contructLinkedList(intArrayOf(7)).toString()),
         )
     }
 }
diff --git a/src/test/kotlin/g2801_2900/s2809_minimum_time_to_make_array_sum_at_most_x/SolutionTest.kt b/src/test/kotlin/g2801_2900/s2809_minimum_time_to_make_array_sum_at_most_x/SolutionTest.kt
index d3c5c09a1..673c52873 100644
--- a/src/test/kotlin/g2801_2900/s2809_minimum_time_to_make_array_sum_at_most_x/SolutionTest.kt
+++ b/src/test/kotlin/g2801_2900/s2809_minimum_time_to_make_array_sum_at_most_x/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun minimumTime() {
         assertThat(
             Solution().minimumTime(mutableListOf<Int?>(1, 2, 3), mutableListOf<Int?>(1, 2, 3), 4),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun minimumTime2() {
         assertThat(
             Solution().minimumTime(mutableListOf<Int?>(1, 2, 3), mutableListOf<Int?>(3, 3, 3), 4),
-            equalTo(-1)
+            equalTo(-1),
         )
     }
 }
diff --git a/src/test/kotlin/g2801_2900/s2812_find_the_safest_path_in_a_grid/SolutionTest.kt b/src/test/kotlin/g2801_2900/s2812_find_the_safest_path_in_a_grid/SolutionTest.kt
index 8a66ad068..b58e0c2be 100644
--- a/src/test/kotlin/g2801_2900/s2812_find_the_safest_path_in_a_grid/SolutionTest.kt
+++ b/src/test/kotlin/g2801_2900/s2812_find_the_safest_path_in_a_grid/SolutionTest.kt
@@ -11,9 +11,9 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .maximumSafenessFactor(
-                    getLists(arrayOf(intArrayOf(1, 0, 0), intArrayOf(0, 0, 0), intArrayOf(0, 0, 1)))
+                    getLists(arrayOf(intArrayOf(1, 0, 0), intArrayOf(0, 0, 0), intArrayOf(0, 0, 1))),
                 ),
-            equalTo(0)
+            equalTo(0),
         )
     }
 
@@ -22,9 +22,9 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .maximumSafenessFactor(
-                    getLists(arrayOf(intArrayOf(0, 0, 1), intArrayOf(0, 0, 0), intArrayOf(0, 0, 0)))
+                    getLists(arrayOf(intArrayOf(0, 0, 1), intArrayOf(0, 0, 0), intArrayOf(0, 0, 0))),
                 ),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -38,11 +38,11 @@ internal class SolutionTest {
                             intArrayOf(0, 0, 0, 1),
                             intArrayOf(0, 0, 0, 0),
                             intArrayOf(0, 0, 0, 0),
-                            intArrayOf(1, 0, 0, 0)
-                        )
-                    )
+                            intArrayOf(1, 0, 0, 0),
+                        ),
+                    ),
                 ),
-            equalTo(2)
+            equalTo(2),
         )
     }
 }
diff --git a/src/test/kotlin/g2801_2900/s2813_maximum_elegance_of_a_k_length_subsequence/SolutionTest.kt b/src/test/kotlin/g2801_2900/s2813_maximum_elegance_of_a_k_length_subsequence/SolutionTest.kt
index f68905295..adfd95b5c 100644
--- a/src/test/kotlin/g2801_2900/s2813_maximum_elegance_of_a_k_length_subsequence/SolutionTest.kt
+++ b/src/test/kotlin/g2801_2900/s2813_maximum_elegance_of_a_k_length_subsequence/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun findMaximumElegance() {
         assertThat(
             Solution().findMaximumElegance(arrayOf(intArrayOf(3, 2), intArrayOf(5, 1), intArrayOf(10, 1)), 2),
-            equalTo(17L)
+            equalTo(17L),
         )
     }
 
@@ -21,11 +21,11 @@ internal class SolutionTest {
                     intArrayOf(3, 1),
                     intArrayOf(3, 1),
                     intArrayOf(2, 2),
-                    intArrayOf(5, 3)
+                    intArrayOf(5, 3),
                 ),
-                3
+                3,
             ),
-            equalTo(19L)
+            equalTo(19L),
         )
     }
 
@@ -33,7 +33,7 @@ internal class SolutionTest {
     fun findMaximumElegance3() {
         assertThat(
             Solution().findMaximumElegance(arrayOf(intArrayOf(1, 1), intArrayOf(2, 1), intArrayOf(3, 1)), 3),
-            equalTo(7L)
+            equalTo(7L),
         )
     }
 }
diff --git a/src/test/kotlin/g2801_2900/s2816_double_a_number_represented_as_a_linked_list/SolutionTest.kt b/src/test/kotlin/g2801_2900/s2816_double_a_number_represented_as_a_linked_list/SolutionTest.kt
index 474dac2a4..be56ff417 100644
--- a/src/test/kotlin/g2801_2900/s2816_double_a_number_represented_as_a_linked_list/SolutionTest.kt
+++ b/src/test/kotlin/g2801_2900/s2816_double_a_number_represented_as_a_linked_list/SolutionTest.kt
@@ -12,7 +12,7 @@ internal class SolutionTest {
             Solution()
                 .doubleIt(contructLinkedList(intArrayOf(1, 8, 9)))
                 .toString(),
-            equalTo("3, 7, 8")
+            equalTo("3, 7, 8"),
         )
     }
 
@@ -22,7 +22,7 @@ internal class SolutionTest {
             Solution()
                 .doubleIt(contructLinkedList(intArrayOf(9, 9, 9)))
                 .toString(),
-            equalTo("1, 9, 9, 8")
+            equalTo("1, 9, 9, 8"),
         )
     }
 }
diff --git a/src/test/kotlin/g2801_2900/s2817_minimum_absolute_difference_between_elements_with_constraint/SolutionTest.kt b/src/test/kotlin/g2801_2900/s2817_minimum_absolute_difference_between_elements_with_constraint/SolutionTest.kt
index 6002fc17b..66c840363 100644
--- a/src/test/kotlin/g2801_2900/s2817_minimum_absolute_difference_between_elements_with_constraint/SolutionTest.kt
+++ b/src/test/kotlin/g2801_2900/s2817_minimum_absolute_difference_between_elements_with_constraint/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun minAbsoluteDifference() {
         assertThat(
             Solution().minAbsoluteDifference(mutableListOf(4, 3, 2, 4), 2),
-            equalTo(0)
+            equalTo(0),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun minAbsoluteDifference2() {
         assertThat(
             Solution().minAbsoluteDifference(mutableListOf(5, 3, 2, 10, 15), 1),
-            equalTo(1)
+            equalTo(1),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun minAbsoluteDifference3() {
         assertThat(
             Solution().minAbsoluteDifference(mutableListOf(1, 2, 3, 4), 3),
-            equalTo(3)
+            equalTo(3),
         )
     }
 }
diff --git a/src/test/kotlin/g2801_2900/s2818_apply_operations_to_maximize_score/SolutionTest.kt b/src/test/kotlin/g2801_2900/s2818_apply_operations_to_maximize_score/SolutionTest.kt
index 4b0eae639..54b72a5c9 100644
--- a/src/test/kotlin/g2801_2900/s2818_apply_operations_to_maximize_score/SolutionTest.kt
+++ b/src/test/kotlin/g2801_2900/s2818_apply_operations_to_maximize_score/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun maximumScore() {
         assertThat(
             Solution().maximumScore(mutableListOf<Int?>(8, 3, 9, 3, 8), 2),
-            equalTo(81)
+            equalTo(81),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun maximumScore2() {
         assertThat(
             Solution().maximumScore(mutableListOf<Int?>(19, 12, 14, 6, 10, 18), 3),
-            equalTo(4788)
+            equalTo(4788),
         )
     }
 }
diff --git a/src/test/kotlin/g2801_2900/s2824_count_pairs_whose_sum_is_less_than_target/SolutionTest.kt b/src/test/kotlin/g2801_2900/s2824_count_pairs_whose_sum_is_less_than_target/SolutionTest.kt
index 1191042a2..f2d6a20b2 100644
--- a/src/test/kotlin/g2801_2900/s2824_count_pairs_whose_sum_is_less_than_target/SolutionTest.kt
+++ b/src/test/kotlin/g2801_2900/s2824_count_pairs_whose_sum_is_less_than_target/SolutionTest.kt
@@ -13,7 +13,8 @@ internal class SolutionTest {
     @Test
     fun countPairs2() {
         assertThat(
-            Solution().countPairs(listOf(-6, 2, 5, -2, -7, -1, 3), -2), equalTo(10)
+            Solution().countPairs(listOf(-6, 2, 5, -2, -7, -1, 3), -2),
+            equalTo(10),
         )
     }
 }
diff --git a/src/test/kotlin/g2801_2900/s2828_check_if_a_string_is_an_acronym_of_words/SolutionTest.kt b/src/test/kotlin/g2801_2900/s2828_check_if_a_string_is_an_acronym_of_words/SolutionTest.kt
index 36bd04dd7..fe4d0e6e6 100644
--- a/src/test/kotlin/g2801_2900/s2828_check_if_a_string_is_an_acronym_of_words/SolutionTest.kt
+++ b/src/test/kotlin/g2801_2900/s2828_check_if_a_string_is_an_acronym_of_words/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun isAcronym() {
         assertThat(
             Solution().isAcronym(mutableListOf("alice", "bob", "charlie"), "abc"),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun isAcronym2() {
         assertThat(
             Solution().isAcronym(mutableListOf("an", "apple"), "a"),
-            equalTo(false)
+            equalTo(false),
         )
     }
 
@@ -27,9 +27,9 @@ internal class SolutionTest {
             Solution()
                 .isAcronym(
                     mutableListOf("never", "gonna", "give", "up", "on", "you"),
-                    "ngguoy"
+                    "ngguoy",
                 ),
-            equalTo(true)
+            equalTo(true),
         )
     }
 }
diff --git a/src/test/kotlin/g2801_2900/s2831_find_the_longest_equal_subarray/SolutionTest.kt b/src/test/kotlin/g2801_2900/s2831_find_the_longest_equal_subarray/SolutionTest.kt
index b25dde38f..5531f48b9 100644
--- a/src/test/kotlin/g2801_2900/s2831_find_the_longest_equal_subarray/SolutionTest.kt
+++ b/src/test/kotlin/g2801_2900/s2831_find_the_longest_equal_subarray/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun longestEqualSubarray() {
         assertThat(
             Solution().longestEqualSubarray(listOf(1, 3, 2, 3, 1, 3), 3),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun longestEqualSubarray2() {
         assertThat(
             Solution().longestEqualSubarray(listOf(1, 1, 2, 2, 1, 1), 2),
-            equalTo(4)
+            equalTo(4),
         )
     }
 }
diff --git a/src/test/kotlin/g2801_2900/s2836_maximize_value_of_function_in_a_ball_passing_game/SolutionTest.kt b/src/test/kotlin/g2801_2900/s2836_maximize_value_of_function_in_a_ball_passing_game/SolutionTest.kt
index ffd91212e..ce86a8c94 100644
--- a/src/test/kotlin/g2801_2900/s2836_maximize_value_of_function_in_a_ball_passing_game/SolutionTest.kt
+++ b/src/test/kotlin/g2801_2900/s2836_maximize_value_of_function_in_a_ball_passing_game/SolutionTest.kt
@@ -9,14 +9,15 @@ internal class SolutionTest {
     fun maxFunctionValue() {
         assertThat(
             Solution().getMaxFunctionValue(mutableListOf(2, 0, 1), 4),
-            equalTo(6L)
+            equalTo(6L),
         )
     }
 
     @Test
     fun maxFunctionValue2() {
         assertThat(
-            Solution().getMaxFunctionValue(mutableListOf(1, 1, 1, 2, 3), 3), equalTo(10L)
+            Solution().getMaxFunctionValue(mutableListOf(1, 1, 1, 2, 3), 3),
+            equalTo(10L),
         )
     }
 }
diff --git a/src/test/kotlin/g2801_2900/s2845_count_of_interesting_subarrays/SolutionTest.kt b/src/test/kotlin/g2801_2900/s2845_count_of_interesting_subarrays/SolutionTest.kt
index 6722116f2..2cd6b87c1 100644
--- a/src/test/kotlin/g2801_2900/s2845_count_of_interesting_subarrays/SolutionTest.kt
+++ b/src/test/kotlin/g2801_2900/s2845_count_of_interesting_subarrays/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun countInterestingSubarrays() {
         assertThat(
             Solution().countInterestingSubarrays(mutableListOf(3, 2, 4), 2, 1),
-            equalTo(3L)
+            equalTo(3L),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun countInterestingSubarrays2() {
         assertThat(
             Solution().countInterestingSubarrays(mutableListOf(3, 1, 9, 6), 3, 0),
-            equalTo(2L)
+            equalTo(2L),
         )
     }
 }
diff --git a/src/test/kotlin/g2801_2900/s2846_minimum_edge_weight_equilibrium_queries_in_a_tree/SolutionTest.kt b/src/test/kotlin/g2801_2900/s2846_minimum_edge_weight_equilibrium_queries_in_a_tree/SolutionTest.kt
index 4defb9198..184b8fd69 100644
--- a/src/test/kotlin/g2801_2900/s2846_minimum_edge_weight_equilibrium_queries_in_a_tree/SolutionTest.kt
+++ b/src/test/kotlin/g2801_2900/s2846_minimum_edge_weight_equilibrium_queries_in_a_tree/SolutionTest.kt
@@ -13,13 +13,13 @@ internal class SolutionTest {
                 .minOperationsQueries(
                     7,
                     CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
-                        "[0,1,1],[1,2,1],[2,3,1],[3,4,2],[4,5,2],[5,6,2]"
+                        "[0,1,1],[1,2,1],[2,3,1],[3,4,2],[4,5,2],[5,6,2]",
                     ),
                     CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
-                        "[0,3],[3,6],[2,6],[0,6]"
-                    )
+                        "[0,3],[3,6],[2,6],[0,6]",
+                    ),
                 ),
-            equalTo(intArrayOf(0, 0, 1, 3))
+            equalTo(intArrayOf(0, 0, 1, 3)),
         )
     }
 
@@ -30,13 +30,13 @@ internal class SolutionTest {
                 .minOperationsQueries(
                     8,
                     CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
-                        "[1,2,6],[1,3,4],[2,4,6],[2,5,3],[3,6,6],[3,0,8],[7,0,2]"
+                        "[1,2,6],[1,3,4],[2,4,6],[2,5,3],[3,6,6],[3,0,8],[7,0,2]",
                     ),
                     CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
-                        "[4,6],[0,4],[6,5],[7,4]"
-                    )
+                        "[4,6],[0,4],[6,5],[7,4]",
+                    ),
                 ),
-            equalTo(intArrayOf(1, 2, 2, 3))
+            equalTo(intArrayOf(1, 2, 2, 3)),
         )
     }
 }
diff --git a/src/test/kotlin/g2801_2900/s2848_points_that_intersect_with_cars/SolutionTest.kt b/src/test/kotlin/g2801_2900/s2848_points_that_intersect_with_cars/SolutionTest.kt
index 3123616fb..43692daaf 100644
--- a/src/test/kotlin/g2801_2900/s2848_points_that_intersect_with_cars/SolutionTest.kt
+++ b/src/test/kotlin/g2801_2900/s2848_points_that_intersect_with_cars/SolutionTest.kt
@@ -13,10 +13,10 @@ internal class SolutionTest {
                     listOf<List<Int>>(
                         mutableListOf(3, 6),
                         mutableListOf(1, 5),
-                        mutableListOf(4, 7)
-                    )
+                        mutableListOf(4, 7),
+                    ),
                 ),
-            equalTo(7)
+            equalTo(7),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .numberOfPoints(listOf<List<Int>>(mutableListOf(1, 3), mutableListOf(5, 8))),
-            equalTo(7)
+            equalTo(7),
         )
     }
 }
diff --git a/src/test/kotlin/g2801_2900/s2850_minimum_moves_to_spread_stones_over_grid/SolutionTest.kt b/src/test/kotlin/g2801_2900/s2850_minimum_moves_to_spread_stones_over_grid/SolutionTest.kt
index e17dd6c47..844aed542 100644
--- a/src/test/kotlin/g2801_2900/s2850_minimum_moves_to_spread_stones_over_grid/SolutionTest.kt
+++ b/src/test/kotlin/g2801_2900/s2850_minimum_moves_to_spread_stones_over_grid/SolutionTest.kt
@@ -12,10 +12,10 @@ internal class SolutionTest {
             Solution()
                 .minimumMoves(
                     CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
-                        "[1,1,0],[1,1,1],[1,2,1]"
-                    )
+                        "[1,1,0],[1,1,1],[1,2,1]",
+                    ),
                 ),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
@@ -25,10 +25,10 @@ internal class SolutionTest {
             Solution()
                 .minimumMoves(
                     CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
-                        "[1,3,0],[1,0,0],[1,0,3]"
-                    )
+                        "[1,3,0],[1,0,0],[1,0,3]",
+                    ),
                 ),
-            equalTo(4)
+            equalTo(4),
         )
     }
 }
diff --git a/src/test/kotlin/g2801_2900/s2857_count_pairs_of_points_with_distance_k/SolutionTest.kt b/src/test/kotlin/g2801_2900/s2857_count_pairs_of_points_with_distance_k/SolutionTest.kt
index 25505f88e..22bf434b0 100644
--- a/src/test/kotlin/g2801_2900/s2857_count_pairs_of_points_with_distance_k/SolutionTest.kt
+++ b/src/test/kotlin/g2801_2900/s2857_count_pairs_of_points_with_distance_k/SolutionTest.kt
@@ -12,7 +12,7 @@ internal class SolutionTest {
                 mutableListOf(1, 2),
                 mutableListOf(4, 2),
                 mutableListOf(1, 3),
-                mutableListOf(5, 2)
+                mutableListOf(5, 2),
             )
         assertThat(Solution().countPairs(input, 5), equalTo(2))
     }
@@ -25,7 +25,7 @@ internal class SolutionTest {
                 mutableListOf(1, 3),
                 mutableListOf(1, 3),
                 mutableListOf(1, 3),
-                mutableListOf(1, 3)
+                mutableListOf(1, 3),
             )
         assertThat(Solution().countPairs(input, 0), equalTo(10))
     }
diff --git a/src/test/kotlin/g2801_2900/s2858_minimum_edge_reversals_so_every_node_is_reachable/SolutionTest.kt b/src/test/kotlin/g2801_2900/s2858_minimum_edge_reversals_so_every_node_is_reachable/SolutionTest.kt
index 1f2e9db59..13d43b82d 100644
--- a/src/test/kotlin/g2801_2900/s2858_minimum_edge_reversals_so_every_node_is_reachable/SolutionTest.kt
+++ b/src/test/kotlin/g2801_2900/s2858_minimum_edge_reversals_so_every_node_is_reachable/SolutionTest.kt
@@ -13,10 +13,10 @@ internal class SolutionTest {
                 .minEdgeReversals(
                     4,
                     CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
-                        "[2,0],[2,1],[1,3]"
-                    )
+                        "[2,0],[2,1],[1,3]",
+                    ),
                 ),
-            equalTo(intArrayOf(1, 1, 0, 2))
+            equalTo(intArrayOf(1, 1, 0, 2)),
         )
     }
 
@@ -27,10 +27,10 @@ internal class SolutionTest {
                 .minEdgeReversals(
                     3,
                     CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
-                        "[1,2],[2,0]"
-                    )
+                        "[1,2],[2,0]",
+                    ),
                 ),
-            equalTo(intArrayOf(2, 0, 1))
+            equalTo(intArrayOf(2, 0, 1)),
         )
     }
 }
diff --git a/src/test/kotlin/g2801_2900/s2859_sum_of_values_at_indices_with_k_set_bits/SolutionTest.kt b/src/test/kotlin/g2801_2900/s2859_sum_of_values_at_indices_with_k_set_bits/SolutionTest.kt
index 6b95566cf..dbbb13132 100644
--- a/src/test/kotlin/g2801_2900/s2859_sum_of_values_at_indices_with_k_set_bits/SolutionTest.kt
+++ b/src/test/kotlin/g2801_2900/s2859_sum_of_values_at_indices_with_k_set_bits/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun sumIndicesWithKSetBits() {
         assertThat(
             Solution().sumIndicesWithKSetBits(mutableListOf(5, 10, 1, 5, 2), 1),
-            equalTo(13)
+            equalTo(13),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun sumIndicesWithKSetBits2() {
         assertThat(
             Solution().sumIndicesWithKSetBits(mutableListOf(4, 3, 2, 1), 2),
-            equalTo(1)
+            equalTo(1),
         )
     }
 }
diff --git a/src/test/kotlin/g2801_2900/s2861_maximum_number_of_alloys/SolutionTest.kt b/src/test/kotlin/g2801_2900/s2861_maximum_number_of_alloys/SolutionTest.kt
index af754dd11..174bc8377 100644
--- a/src/test/kotlin/g2801_2900/s2861_maximum_number_of_alloys/SolutionTest.kt
+++ b/src/test/kotlin/g2801_2900/s2861_maximum_number_of_alloys/SolutionTest.kt
@@ -15,9 +15,9 @@ internal class SolutionTest {
                     15,
                     listOf<List<Int>>(mutableListOf(1, 1, 1), mutableListOf(1, 1, 10)),
                     mutableListOf(0, 0, 0),
-                    mutableListOf(1, 2, 3)
+                    mutableListOf(1, 2, 3),
                 ),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -31,9 +31,9 @@ internal class SolutionTest {
                     15,
                     listOf<List<Int>>(mutableListOf(1, 1, 1), mutableListOf(1, 1, 10)),
                     mutableListOf(0, 0, 100),
-                    mutableListOf(1, 2, 3)
+                    mutableListOf(1, 2, 3),
                 ),
-            equalTo(5)
+            equalTo(5),
         )
     }
 
@@ -48,12 +48,12 @@ internal class SolutionTest {
                     listOf<List<Int>>(
                         mutableListOf(2, 1),
                         mutableListOf(1, 2),
-                        mutableListOf(1, 1)
+                        mutableListOf(1, 1),
                     ),
                     mutableListOf(1, 1),
-                    mutableListOf(5, 5)
+                    mutableListOf(5, 5),
                 ),
-            equalTo(2)
+            equalTo(2),
         )
     }
 }
diff --git a/src/test/kotlin/g2801_2900/s2862_maximum_element_sum_of_a_complete_subset_of_indices/SolutionTest.kt b/src/test/kotlin/g2801_2900/s2862_maximum_element_sum_of_a_complete_subset_of_indices/SolutionTest.kt
index e669082ee..16ac8c8fd 100644
--- a/src/test/kotlin/g2801_2900/s2862_maximum_element_sum_of_a_complete_subset_of_indices/SolutionTest.kt
+++ b/src/test/kotlin/g2801_2900/s2862_maximum_element_sum_of_a_complete_subset_of_indices/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun maximumSum() {
         assertThat(
             Solution().maximumSum(mutableListOf(8, 7, 3, 5, 7, 2, 4, 9)),
-            equalTo(16L)
+            equalTo(16L),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun maximumSum2() {
         assertThat(
             Solution().maximumSum(mutableListOf(5, 10, 3, 10, 1, 13, 7, 9, 4)),
-            equalTo(19L)
+            equalTo(19L),
         )
     }
 }
diff --git a/src/test/kotlin/g2801_2900/s2865_beautiful_towers_i/SolutionTest.kt b/src/test/kotlin/g2801_2900/s2865_beautiful_towers_i/SolutionTest.kt
index e827107b3..b9727a1bc 100644
--- a/src/test/kotlin/g2801_2900/s2865_beautiful_towers_i/SolutionTest.kt
+++ b/src/test/kotlin/g2801_2900/s2865_beautiful_towers_i/SolutionTest.kt
@@ -9,21 +9,23 @@ internal class SolutionTest {
     fun maximumSumOfHeights() {
         assertThat(
             Solution().maximumSumOfHeights(mutableListOf(5, 3, 4, 1, 1)),
-            equalTo(13L)
+            equalTo(13L),
         )
     }
 
     @Test
     fun maximumSumOfHeights2() {
         assertThat(
-            Solution().maximumSumOfHeights(mutableListOf(6, 5, 3, 9, 2, 7)), equalTo(22L)
+            Solution().maximumSumOfHeights(mutableListOf(6, 5, 3, 9, 2, 7)),
+            equalTo(22L),
         )
     }
 
     @Test
     fun maximumSumOfHeights3() {
         assertThat(
-            Solution().maximumSumOfHeights(mutableListOf(3, 2, 5, 5, 2, 3)), equalTo(18L)
+            Solution().maximumSumOfHeights(mutableListOf(3, 2, 5, 5, 2, 3)),
+            equalTo(18L),
         )
     }
 }
diff --git a/src/test/kotlin/g2801_2900/s2866_beautiful_towers_ii/SolutionTest.kt b/src/test/kotlin/g2801_2900/s2866_beautiful_towers_ii/SolutionTest.kt
index 6a0d3c29b..e561784eb 100644
--- a/src/test/kotlin/g2801_2900/s2866_beautiful_towers_ii/SolutionTest.kt
+++ b/src/test/kotlin/g2801_2900/s2866_beautiful_towers_ii/SolutionTest.kt
@@ -9,21 +9,23 @@ internal class SolutionTest {
     fun maximumSumOfHeights() {
         assertThat(
             Solution().maximumSumOfHeights(mutableListOf(5, 3, 4, 1, 1)),
-            equalTo(13L)
+            equalTo(13L),
         )
     }
 
     @Test
     fun maximumSumOfHeights2() {
         assertThat(
-            Solution().maximumSumOfHeights(mutableListOf(6, 5, 3, 9, 2, 7)), equalTo(22L)
+            Solution().maximumSumOfHeights(mutableListOf(6, 5, 3, 9, 2, 7)),
+            equalTo(22L),
         )
     }
 
     @Test
     fun maximumSumOfHeights3() {
         assertThat(
-            Solution().maximumSumOfHeights(mutableListOf(3, 2, 5, 5, 2, 3)), equalTo(18L)
+            Solution().maximumSumOfHeights(mutableListOf(3, 2, 5, 5, 2, 3)),
+            equalTo(18L),
         )
     }
 }
diff --git a/src/test/kotlin/g2801_2900/s2867_count_valid_paths_in_a_tree/SolutionTest.kt b/src/test/kotlin/g2801_2900/s2867_count_valid_paths_in_a_tree/SolutionTest.kt
index b3b6d5955..6514a2047 100644
--- a/src/test/kotlin/g2801_2900/s2867_count_valid_paths_in_a_tree/SolutionTest.kt
+++ b/src/test/kotlin/g2801_2900/s2867_count_valid_paths_in_a_tree/SolutionTest.kt
@@ -13,10 +13,10 @@ internal class SolutionTest {
                 .countPaths(
                     5,
                     CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
-                        "[1,2],[1,3],[2,4],[2,5]"
-                    )
+                        "[1,2],[1,3],[2,4],[2,5]",
+                    ),
                 ),
-            equalTo(4L)
+            equalTo(4L),
         )
     }
 
@@ -27,10 +27,10 @@ internal class SolutionTest {
                 .countPaths(
                     6,
                     CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
-                        "[1,2],[1,3],[2,4],[3,5],[3,6]"
-                    )
+                        "[1,2],[1,3],[2,4],[3,5],[3,6]",
+                    ),
                 ),
-            equalTo(6L)
+            equalTo(6L),
         )
     }
 }
diff --git a/src/test/kotlin/g2801_2900/s2870_minimum_number_of_operations_to_make_array_empty/SolutionTest.kt b/src/test/kotlin/g2801_2900/s2870_minimum_number_of_operations_to_make_array_empty/SolutionTest.kt
index 95ca9655f..e38cc51e7 100644
--- a/src/test/kotlin/g2801_2900/s2870_minimum_number_of_operations_to_make_array_empty/SolutionTest.kt
+++ b/src/test/kotlin/g2801_2900/s2870_minimum_number_of_operations_to_make_array_empty/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun minOperations() {
         assertThat(
             Solution().minOperations(intArrayOf(2, 3, 3, 2, 2, 4, 2, 3, 4)),
-            equalTo(4)
+            equalTo(4),
         )
     }
 
diff --git a/src/test/kotlin/g2801_2900/s2872_maximum_number_of_k_divisible_components/SolutionTest.kt b/src/test/kotlin/g2801_2900/s2872_maximum_number_of_k_divisible_components/SolutionTest.kt
index ccf9d3a79..8f9348e42 100644
--- a/src/test/kotlin/g2801_2900/s2872_maximum_number_of_k_divisible_components/SolutionTest.kt
+++ b/src/test/kotlin/g2801_2900/s2872_maximum_number_of_k_divisible_components/SolutionTest.kt
@@ -13,12 +13,12 @@ internal class SolutionTest {
                 .maxKDivisibleComponents(
                     5,
                     CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
-                        "[0,2],[1,2],[1,3],[2,4]"
+                        "[0,2],[1,2],[1,3],[2,4]",
                     ),
                     intArrayOf(1, 8, 1, 4, 4),
-                    6
+                    6,
                 ),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -29,12 +29,12 @@ internal class SolutionTest {
                 .maxKDivisibleComponents(
                     7,
                     CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
-                        "[0,1],[0,2],[1,3],[1,4],[2,5],[2,6]"
+                        "[0,1],[0,2],[1,3],[1,4],[2,5],[2,6]",
                     ),
                     intArrayOf(3, 0, 6, 1, 5, 2, 1),
-                    3
+                    3,
                 ),
-            equalTo(3)
+            equalTo(3),
         )
     }
 }
diff --git a/src/test/kotlin/g2801_2900/s2873_maximum_value_of_an_ordered_triplet_i/SolutionTest.kt b/src/test/kotlin/g2801_2900/s2873_maximum_value_of_an_ordered_triplet_i/SolutionTest.kt
index 9c8f18d6b..c85ad8013 100644
--- a/src/test/kotlin/g2801_2900/s2873_maximum_value_of_an_ordered_triplet_i/SolutionTest.kt
+++ b/src/test/kotlin/g2801_2900/s2873_maximum_value_of_an_ordered_triplet_i/SolutionTest.kt
@@ -14,7 +14,7 @@ internal class SolutionTest {
     fun maximumTripletValue2() {
         assertThat(
             Solution().maximumTripletValue(intArrayOf(1, 10, 3, 4, 19)),
-            equalTo(133L)
+            equalTo(133L),
         )
     }
 
@@ -28,9 +28,9 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .maximumTripletValue(
-                    intArrayOf(8, 6, 3, 13, 2, 12, 19, 5, 19, 6, 10, 11, 9)
+                    intArrayOf(8, 6, 3, 13, 2, 12, 19, 5, 19, 6, 10, 11, 9),
                 ),
-            equalTo(266L)
+            equalTo(266L),
         )
     }
 }
diff --git a/src/test/kotlin/g2801_2900/s2874_maximum_value_of_an_ordered_triplet_ii/SolutionTest.kt b/src/test/kotlin/g2801_2900/s2874_maximum_value_of_an_ordered_triplet_ii/SolutionTest.kt
index 4d6e0aa68..d5cf81ca3 100644
--- a/src/test/kotlin/g2801_2900/s2874_maximum_value_of_an_ordered_triplet_ii/SolutionTest.kt
+++ b/src/test/kotlin/g2801_2900/s2874_maximum_value_of_an_ordered_triplet_ii/SolutionTest.kt
@@ -14,7 +14,7 @@ internal class SolutionTest {
     fun maximumTripletValue2() {
         assertThat(
             Solution().maximumTripletValue(intArrayOf(1, 10, 3, 4, 19)),
-            equalTo(133L)
+            equalTo(133L),
         )
     }
 
diff --git a/src/test/kotlin/g2801_2900/s2876_count_visited_nodes_in_a_directed_graph/SolutionTest.kt b/src/test/kotlin/g2801_2900/s2876_count_visited_nodes_in_a_directed_graph/SolutionTest.kt
index 8301cc0b4..a6014aedd 100644
--- a/src/test/kotlin/g2801_2900/s2876_count_visited_nodes_in_a_directed_graph/SolutionTest.kt
+++ b/src/test/kotlin/g2801_2900/s2876_count_visited_nodes_in_a_directed_graph/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun countVisitedNodes() {
         assertThat(
             Solution().countVisitedNodes(mutableListOf(1, 2, 0, 0)),
-            equalTo(intArrayOf(3, 3, 3, 4))
+            equalTo(intArrayOf(3, 3, 3, 4)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun countVisitedNodes2() {
         assertThat(
             Solution().countVisitedNodes(mutableListOf(1, 2, 3, 4, 0)),
-            equalTo(intArrayOf(5, 5, 5, 5, 5))
+            equalTo(intArrayOf(5, 5, 5, 5, 5)),
         )
     }
 }
diff --git a/src/test/kotlin/g2801_2900/s2895_minimum_processing_time/SolutionTest.kt b/src/test/kotlin/g2801_2900/s2895_minimum_processing_time/SolutionTest.kt
index 3a3fe4025..8286a5966 100644
--- a/src/test/kotlin/g2801_2900/s2895_minimum_processing_time/SolutionTest.kt
+++ b/src/test/kotlin/g2801_2900/s2895_minimum_processing_time/SolutionTest.kt
@@ -10,9 +10,10 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .minProcessingTime(
-                    mutableListOf(8, 10), mutableListOf(2, 2, 3, 1, 8, 7, 4, 5)
+                    mutableListOf(8, 10),
+                    mutableListOf(2, 2, 3, 1, 8, 7, 4, 5),
                 ),
-            equalTo(16)
+            equalTo(16),
         )
     }
 
@@ -21,9 +22,10 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .minProcessingTime(
-                    mutableListOf(10, 20), mutableListOf(2, 3, 1, 2, 5, 8, 4, 3)
+                    mutableListOf(10, 20),
+                    mutableListOf(2, 3, 1, 2, 5, 8, 4, 3),
                 ),
-            equalTo(23)
+            equalTo(23),
         )
     }
 }
diff --git a/src/test/kotlin/g2801_2900/s2899_last_visited_integers/SolutionTest.kt b/src/test/kotlin/g2801_2900/s2899_last_visited_integers/SolutionTest.kt
index 289808adb..7a653e701 100644
--- a/src/test/kotlin/g2801_2900/s2899_last_visited_integers/SolutionTest.kt
+++ b/src/test/kotlin/g2801_2900/s2899_last_visited_integers/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun lastVisitedIntegers() {
         assertThat(
             Solution().lastVisitedIntegers(mutableListOf("1", "2", "prev", "prev", "prev")),
-            equalTo(listOf(2, 1, -1))
+            equalTo(listOf(2, 1, -1)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun lastVisitedIntegers2() {
         assertThat(
             Solution().lastVisitedIntegers(mutableListOf("1", "prev", "2", "prev", "prev")),
-            equalTo(mutableListOf(1, 2, 1))
+            equalTo(mutableListOf(1, 2, 1)),
         )
     }
 }
diff --git a/src/test/kotlin/g2801_2900/s2900_longest_unequal_adjacent_groups_subsequence_i/SolutionTest.kt b/src/test/kotlin/g2801_2900/s2900_longest_unequal_adjacent_groups_subsequence_i/SolutionTest.kt
index f917d07cd..a2b449b85 100644
--- a/src/test/kotlin/g2801_2900/s2900_longest_unequal_adjacent_groups_subsequence_i/SolutionTest.kt
+++ b/src/test/kotlin/g2801_2900/s2900_longest_unequal_adjacent_groups_subsequence_i/SolutionTest.kt
@@ -10,9 +10,11 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .getWordsInLongestSubsequence(
-                    3, arrayOf("e", "a", "b"), intArrayOf(0, 0, 1)
+                    3,
+                    arrayOf("e", "a", "b"),
+                    intArrayOf(0, 0, 1),
                 ),
-            equalTo(mutableListOf("e", "b"))
+            equalTo(mutableListOf("e", "b")),
         )
     }
 
@@ -21,9 +23,11 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .getWordsInLongestSubsequence(
-                    4, arrayOf("a", "b", "c", "d"), intArrayOf(1, 0, 1, 1)
+                    4,
+                    arrayOf("a", "b", "c", "d"),
+                    intArrayOf(1, 0, 1, 1),
                 ),
-            equalTo(mutableListOf("a", "b", "c"))
+            equalTo(mutableListOf("a", "b", "c")),
         )
     }
 }
diff --git a/src/test/kotlin/g2901_3000/s2901_longest_unequal_adjacent_groups_subsequence_ii/SolutionTest.kt b/src/test/kotlin/g2901_3000/s2901_longest_unequal_adjacent_groups_subsequence_ii/SolutionTest.kt
index c0f9829b1..b2cd2bec5 100644
--- a/src/test/kotlin/g2901_3000/s2901_longest_unequal_adjacent_groups_subsequence_ii/SolutionTest.kt
+++ b/src/test/kotlin/g2901_3000/s2901_longest_unequal_adjacent_groups_subsequence_ii/SolutionTest.kt
@@ -10,9 +10,11 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .getWordsInLongestSubsequence(
-                    3, arrayOf("bab", "dab", "cab"), intArrayOf(1, 2, 2)
+                    3,
+                    arrayOf("bab", "dab", "cab"),
+                    intArrayOf(1, 2, 2),
                 ),
-            equalTo(mutableListOf("bab", "dab"))
+            equalTo(mutableListOf("bab", "dab")),
         )
     }
 
@@ -21,9 +23,11 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .getWordsInLongestSubsequence(
-                    4, arrayOf("a", "b", "c", "d"), intArrayOf(1, 2, 3, 4)
+                    4,
+                    arrayOf("a", "b", "c", "d"),
+                    intArrayOf(1, 2, 3, 4),
                 ),
-            equalTo(mutableListOf("a", "b", "c", "d"))
+            equalTo(mutableListOf("a", "b", "c", "d")),
         )
     }
 }
diff --git a/src/test/kotlin/g2901_3000/s2902_count_of_sub_multisets_with_bounded_sum/SolutionTest.kt b/src/test/kotlin/g2901_3000/s2902_count_of_sub_multisets_with_bounded_sum/SolutionTest.kt
index 6831f1dfb..f50261986 100644
--- a/src/test/kotlin/g2901_3000/s2902_count_of_sub_multisets_with_bounded_sum/SolutionTest.kt
+++ b/src/test/kotlin/g2901_3000/s2902_count_of_sub_multisets_with_bounded_sum/SolutionTest.kt
@@ -13,7 +13,8 @@ internal class SolutionTest {
     @Test
     fun countSubMultisets2() {
         assertThat(
-            Solution().countSubMultisets(mutableListOf(2, 1, 4, 2, 7), 1, 5), equalTo(7)
+            Solution().countSubMultisets(mutableListOf(2, 1, 4, 2, 7), 1, 5),
+            equalTo(7),
         )
     }
 
@@ -21,7 +22,7 @@ internal class SolutionTest {
     fun countSubMultisets3() {
         assertThat(
             Solution().countSubMultisets(mutableListOf(1, 2, 1, 3, 5, 2), 3, 5),
-            equalTo(9)
+            equalTo(9),
         )
     }
 }
diff --git a/src/test/kotlin/g2901_3000/s2903_find_indices_with_index_and_value_difference_i/SolutionTest.kt b/src/test/kotlin/g2901_3000/s2903_find_indices_with_index_and_value_difference_i/SolutionTest.kt
index 503ab6ae9..0cbb55ca4 100644
--- a/src/test/kotlin/g2901_3000/s2903_find_indices_with_index_and_value_difference_i/SolutionTest.kt
+++ b/src/test/kotlin/g2901_3000/s2903_find_indices_with_index_and_value_difference_i/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun findIndices() {
         assertThat(
             Solution().findIndices(intArrayOf(5, 1, 4, 1), 2, 4),
-            equalTo(intArrayOf(0, 3))
+            equalTo(intArrayOf(0, 3)),
         )
     }
 
@@ -21,7 +21,8 @@ internal class SolutionTest {
     @Test
     fun findIndices3() {
         assertThat(
-            Solution().findIndices(intArrayOf(1, 2, 3), 2, 4), equalTo(intArrayOf(-1, -1))
+            Solution().findIndices(intArrayOf(1, 2, 3), 2, 4),
+            equalTo(intArrayOf(-1, -1)),
         )
     }
 }
diff --git a/src/test/kotlin/g2901_3000/s2904_shortest_and_lexicographically_smallest_beautiful_string/SolutionTest.kt b/src/test/kotlin/g2901_3000/s2904_shortest_and_lexicographically_smallest_beautiful_string/SolutionTest.kt
index 4fbe95631..aa378a2bf 100644
--- a/src/test/kotlin/g2901_3000/s2904_shortest_and_lexicographically_smallest_beautiful_string/SolutionTest.kt
+++ b/src/test/kotlin/g2901_3000/s2904_shortest_and_lexicographically_smallest_beautiful_string/SolutionTest.kt
@@ -24,7 +24,7 @@ internal class SolutionTest {
     fun shortestBeautifulSubstring4() {
         assertThat(
             Solution().shortestBeautifulSubstring("001110101101101111", 10),
-            equalTo("10101101101111")
+            equalTo("10101101101111"),
         )
     }
 }
diff --git a/src/test/kotlin/g2901_3000/s2905_find_indices_with_index_and_value_difference_ii/SolutionTest.kt b/src/test/kotlin/g2901_3000/s2905_find_indices_with_index_and_value_difference_ii/SolutionTest.kt
index 68a8f7f2f..326adb9f4 100644
--- a/src/test/kotlin/g2901_3000/s2905_find_indices_with_index_and_value_difference_ii/SolutionTest.kt
+++ b/src/test/kotlin/g2901_3000/s2905_find_indices_with_index_and_value_difference_ii/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun findIndices() {
         assertThat(
             Solution().findIndices(intArrayOf(5, 1, 4, 1), 2, 4),
-            equalTo(intArrayOf(0, 3))
+            equalTo(intArrayOf(0, 3)),
         )
     }
 
@@ -21,7 +21,8 @@ internal class SolutionTest {
     @Test
     fun findIndices3() {
         assertThat(
-            Solution().findIndices(intArrayOf(1, 2, 3), 2, 4), equalTo(intArrayOf(-1, -1))
+            Solution().findIndices(intArrayOf(1, 2, 3), 2, 4),
+            equalTo(intArrayOf(-1, -1)),
         )
     }
 }
diff --git a/src/test/kotlin/g2901_3000/s2906_construct_product_matrix/SolutionTest.kt b/src/test/kotlin/g2901_3000/s2906_construct_product_matrix/SolutionTest.kt
index d6e674d48..b7bd1ea5e 100644
--- a/src/test/kotlin/g2901_3000/s2906_construct_product_matrix/SolutionTest.kt
+++ b/src/test/kotlin/g2901_3000/s2906_construct_product_matrix/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun constructProductMatrix() {
         assertThat(
             Solution().constructProductMatrix(arrayOf(intArrayOf(1, 2), intArrayOf(3, 4))),
-            equalTo(arrayOf(intArrayOf(24, 12), intArrayOf(8, 6)))
+            equalTo(arrayOf(intArrayOf(24, 12), intArrayOf(8, 6))),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun constructProductMatrix2() {
         assertThat(
             Solution().constructProductMatrix(arrayOf(intArrayOf(12345), intArrayOf(2), intArrayOf(1))),
-            equalTo(arrayOf(intArrayOf(2), intArrayOf(0), intArrayOf(0)))
+            equalTo(arrayOf(intArrayOf(2), intArrayOf(0), intArrayOf(0))),
         )
     }
 }
diff --git a/src/test/kotlin/g2901_3000/s2910_minimum_number_of_groups_to_create_a_valid_assignment/SolutionTest.kt b/src/test/kotlin/g2901_3000/s2910_minimum_number_of_groups_to_create_a_valid_assignment/SolutionTest.kt
index 344114b5f..74f3657ae 100644
--- a/src/test/kotlin/g2901_3000/s2910_minimum_number_of_groups_to_create_a_valid_assignment/SolutionTest.kt
+++ b/src/test/kotlin/g2901_3000/s2910_minimum_number_of_groups_to_create_a_valid_assignment/SolutionTest.kt
@@ -8,7 +8,8 @@ internal class SolutionTest {
     @Test
     fun minGroupsForValidAssignment() {
         assertThat(
-            Solution().minGroupsForValidAssignment(intArrayOf(3, 2, 3, 2, 3)), equalTo(2)
+            Solution().minGroupsForValidAssignment(intArrayOf(3, 2, 3, 2, 3)),
+            equalTo(2),
         )
     }
 
@@ -16,7 +17,7 @@ internal class SolutionTest {
     fun minGroupsForValidAssignment2() {
         assertThat(
             Solution().minGroupsForValidAssignment(intArrayOf(10, 10, 10, 3, 1, 1)),
-            equalTo(4)
+            equalTo(4),
         )
     }
 }
diff --git a/src/test/kotlin/g2901_3000/s2915_length_of_the_longest_subsequence_that_sums_to_target/SolutionTest.kt b/src/test/kotlin/g2901_3000/s2915_length_of_the_longest_subsequence_that_sums_to_target/SolutionTest.kt
index 214cfcd16..873725849 100644
--- a/src/test/kotlin/g2901_3000/s2915_length_of_the_longest_subsequence_that_sums_to_target/SolutionTest.kt
+++ b/src/test/kotlin/g2901_3000/s2915_length_of_the_longest_subsequence_that_sums_to_target/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun lengthOfLongestSubsequence() {
         assertThat(
             Solution().lengthOfLongestSubsequence(mutableListOf(1, 2, 3, 4, 5), 9),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun lengthOfLongestSubsequence2() {
         assertThat(
             Solution().lengthOfLongestSubsequence(mutableListOf(4, 1, 3, 2, 1, 5), 7),
-            equalTo(4)
+            equalTo(4),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun lengthOfLongestSubsequence3() {
         assertThat(
             Solution().lengthOfLongestSubsequence(mutableListOf(1, 1, 5, 4, 5), 3),
-            equalTo(-1)
+            equalTo(-1),
         )
     }
 }
diff --git a/src/test/kotlin/g2901_3000/s2918_minimum_equal_sum_of_two_arrays_after_replacing_zeros/SolutionTest.kt b/src/test/kotlin/g2901_3000/s2918_minimum_equal_sum_of_two_arrays_after_replacing_zeros/SolutionTest.kt
index bcf092962..1484b1be4 100644
--- a/src/test/kotlin/g2901_3000/s2918_minimum_equal_sum_of_two_arrays_after_replacing_zeros/SolutionTest.kt
+++ b/src/test/kotlin/g2901_3000/s2918_minimum_equal_sum_of_two_arrays_after_replacing_zeros/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun minSum() {
         assertThat(
             Solution().minSum(intArrayOf(3, 2, 0, 1, 0), intArrayOf(6, 5, 0)),
-            equalTo(12L)
+            equalTo(12L),
         )
     }
 
diff --git a/src/test/kotlin/g2901_3000/s2919_minimum_increment_operations_to_make_array_beautiful/SolutionTest.kt b/src/test/kotlin/g2901_3000/s2919_minimum_increment_operations_to_make_array_beautiful/SolutionTest.kt
index da9dad5d4..1075be281 100644
--- a/src/test/kotlin/g2901_3000/s2919_minimum_increment_operations_to_make_array_beautiful/SolutionTest.kt
+++ b/src/test/kotlin/g2901_3000/s2919_minimum_increment_operations_to_make_array_beautiful/SolutionTest.kt
@@ -8,7 +8,8 @@ internal class SolutionTest {
     @Test
     fun minIncrementOperations() {
         assertThat(
-            Solution().minIncrementOperations(intArrayOf(2, 3, 0, 0, 2), 4), equalTo(3L)
+            Solution().minIncrementOperations(intArrayOf(2, 3, 0, 0, 2), 4),
+            equalTo(3L),
         )
     }
 
diff --git a/src/test/kotlin/g2901_3000/s2920_maximum_points_after_collecting_coins_from_all_nodes/SolutionTest.kt b/src/test/kotlin/g2901_3000/s2920_maximum_points_after_collecting_coins_from_all_nodes/SolutionTest.kt
index 2ee936c9c..5ead1c38c 100644
--- a/src/test/kotlin/g2901_3000/s2920_maximum_points_after_collecting_coins_from_all_nodes/SolutionTest.kt
+++ b/src/test/kotlin/g2901_3000/s2920_maximum_points_after_collecting_coins_from_all_nodes/SolutionTest.kt
@@ -12,12 +12,12 @@ internal class SolutionTest {
             Solution()
                 .maximumPoints(
                     CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
-                        "[0,1],[1,2],[2,3]"
+                        "[0,1],[1,2],[2,3]",
                     ),
                     intArrayOf(10, 10, 3, 3),
-                    5
+                    5,
                 ),
-            equalTo(11)
+            equalTo(11),
         )
     }
 
@@ -27,12 +27,12 @@ internal class SolutionTest {
             Solution()
                 .maximumPoints(
                     CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
-                        "[0,1],[0,2]"
+                        "[0,1],[0,2]",
                     ),
                     intArrayOf(8, 4, 4),
-                    0
+                    0,
                 ),
-            equalTo(16)
+            equalTo(16),
         )
     }
 }
diff --git a/src/test/kotlin/g2901_3000/s2923_find_champion_i/SolutionTest.kt b/src/test/kotlin/g2901_3000/s2923_find_champion_i/SolutionTest.kt
index 9183fa3b1..e577bea44 100644
--- a/src/test/kotlin/g2901_3000/s2923_find_champion_i/SolutionTest.kt
+++ b/src/test/kotlin/g2901_3000/s2923_find_champion_i/SolutionTest.kt
@@ -12,10 +12,10 @@ internal class SolutionTest {
             Solution()
                 .findChampion(
                     CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
-                        "[0,1],[0,0]"
-                    )
+                        "[0,1],[0,0]",
+                    ),
                 ),
-            equalTo(0)
+            equalTo(0),
         )
     }
 
@@ -25,10 +25,10 @@ internal class SolutionTest {
             Solution()
                 .findChampion(
                     CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
-                        "[0,0,1],[1,0,1],[0,0,0]"
-                    )
+                        "[0,0,1],[1,0,1],[0,0,0]",
+                    ),
                 ),
-            equalTo(1)
+            equalTo(1),
         )
     }
 
@@ -38,10 +38,10 @@ internal class SolutionTest {
             Solution()
                 .findChampion(
                     CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
-                        "[0,0,0],[1,0,0],[1,1,0]"
-                    )
+                        "[0,0,0],[1,0,0],[1,1,0]",
+                    ),
                 ),
-            equalTo(2)
+            equalTo(2),
         )
     }
 }
diff --git a/src/test/kotlin/g2901_3000/s2924_find_champion_ii/SolutionTest.kt b/src/test/kotlin/g2901_3000/s2924_find_champion_ii/SolutionTest.kt
index 2179223c6..4efe1a8ce 100644
--- a/src/test/kotlin/g2901_3000/s2924_find_champion_ii/SolutionTest.kt
+++ b/src/test/kotlin/g2901_3000/s2924_find_champion_ii/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun findChampion() {
         assertThat(
             Solution().findChampion(3, arrayOf(intArrayOf(0, 1), intArrayOf(1, 2))),
-            equalTo(0)
+            equalTo(0),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun findChampion2() {
         assertThat(
             Solution().findChampion(4, arrayOf(intArrayOf(0, 2), intArrayOf(1, 3), intArrayOf(1, 2))),
-            equalTo(-1)
+            equalTo(-1),
         )
     }
 }
diff --git a/src/test/kotlin/g2901_3000/s2925_maximum_score_after_applying_operations_on_a_tree/SolutionTest.kt b/src/test/kotlin/g2901_3000/s2925_maximum_score_after_applying_operations_on_a_tree/SolutionTest.kt
index b0d0d1569..6db8fa3c6 100644
--- a/src/test/kotlin/g2901_3000/s2925_maximum_score_after_applying_operations_on_a_tree/SolutionTest.kt
+++ b/src/test/kotlin/g2901_3000/s2925_maximum_score_after_applying_operations_on_a_tree/SolutionTest.kt
@@ -12,11 +12,11 @@ internal class SolutionTest {
             Solution()
                 .maximumScoreAfterOperations(
                     CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
-                        "[0,1],[0,2],[0,3],[2,4],[4,5]"
+                        "[0,1],[0,2],[0,3],[2,4],[4,5]",
                     ),
-                    intArrayOf(5, 2, 5, 2, 1, 1)
+                    intArrayOf(5, 2, 5, 2, 1, 1),
                 ),
-            equalTo(11L)
+            equalTo(11L),
         )
     }
 
@@ -26,11 +26,11 @@ internal class SolutionTest {
             Solution()
                 .maximumScoreAfterOperations(
                     CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
-                        "[0,1],[0,2],[1,3],[1,4],[2,5],[2,6]"
+                        "[0,1],[0,2],[1,3],[1,4],[2,5],[2,6]",
                     ),
-                    intArrayOf(20, 10, 9, 7, 4, 3, 5)
+                    intArrayOf(20, 10, 9, 7, 4, 3, 5),
                 ),
-            equalTo(40L)
+            equalTo(40L),
         )
     }
 }
diff --git a/src/test/kotlin/g2901_3000/s2926_maximum_balanced_subsequence_sum/SolutionTest.kt b/src/test/kotlin/g2901_3000/s2926_maximum_balanced_subsequence_sum/SolutionTest.kt
index 539901906..37eea795b 100644
--- a/src/test/kotlin/g2901_3000/s2926_maximum_balanced_subsequence_sum/SolutionTest.kt
+++ b/src/test/kotlin/g2901_3000/s2926_maximum_balanced_subsequence_sum/SolutionTest.kt
@@ -9,21 +9,23 @@ internal class SolutionTest {
     fun maxBalancedSubsequenceSum() {
         assertThat(
             Solution().maxBalancedSubsequenceSum(intArrayOf(3, 3, 5, 6)),
-            equalTo(14L)
+            equalTo(14L),
         )
     }
 
     @Test
     fun maxBalancedSubsequenceSum2() {
         assertThat(
-            Solution().maxBalancedSubsequenceSum(intArrayOf(5, -1, -3, 8)), equalTo(13L)
+            Solution().maxBalancedSubsequenceSum(intArrayOf(5, -1, -3, 8)),
+            equalTo(13L),
         )
     }
 
     @Test
     fun maxBalancedSubsequenceSum3() {
         assertThat(
-            Solution().maxBalancedSubsequenceSum(intArrayOf(5, -1, -3, 8)), equalTo(13L)
+            Solution().maxBalancedSubsequenceSum(intArrayOf(5, -1, -3, 8)),
+            equalTo(13L),
         )
     }
 }
diff --git a/src/test/kotlin/g2901_3000/s2931_maximum_spending_after_buying_items/SolutionTest.kt b/src/test/kotlin/g2901_3000/s2931_maximum_spending_after_buying_items/SolutionTest.kt
index 8db883dcc..99be336fb 100644
--- a/src/test/kotlin/g2901_3000/s2931_maximum_spending_after_buying_items/SolutionTest.kt
+++ b/src/test/kotlin/g2901_3000/s2931_maximum_spending_after_buying_items/SolutionTest.kt
@@ -12,10 +12,10 @@ internal class SolutionTest {
             Solution()
                 .maxSpending(
                     CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
-                        "[8,5,2],[6,4,1],[9,7,3]"
-                    )
+                        "[8,5,2],[6,4,1],[9,7,3]",
+                    ),
                 ),
-            equalTo(285L)
+            equalTo(285L),
         )
     }
 
@@ -25,10 +25,10 @@ internal class SolutionTest {
             Solution()
                 .maxSpending(
                     CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
-                        "[10,8,6,4,2],[9,7,5,3,2]"
-                    )
+                        "[10,8,6,4,2],[9,7,5,3,2]",
+                    ),
                 ),
-            equalTo(386L)
+            equalTo(386L),
         )
     }
 }
diff --git a/src/test/kotlin/g2901_3000/s2933_high_access_employees/SolutionTest.kt b/src/test/kotlin/g2901_3000/s2933_high_access_employees/SolutionTest.kt
index 2eb25cb03..87c75156d 100644
--- a/src/test/kotlin/g2901_3000/s2933_high_access_employees/SolutionTest.kt
+++ b/src/test/kotlin/g2901_3000/s2933_high_access_employees/SolutionTest.kt
@@ -15,10 +15,10 @@ internal class SolutionTest {
                         mutableListOf("b", "0457"),
                         mutableListOf("a", "0532"),
                         mutableListOf("a", "0621"),
-                        mutableListOf("b", "0540")
-                    )
+                        mutableListOf("b", "0540"),
+                    ),
                 ),
-            equalTo(listOf("a"))
+            equalTo(listOf("a")),
         )
     }
 
@@ -35,10 +35,10 @@ internal class SolutionTest {
                         mutableListOf("d", "1508"),
                         mutableListOf("d", "1444"),
                         mutableListOf("d", "1410"),
-                        mutableListOf("c", "0809")
-                    )
+                        mutableListOf("c", "0809"),
+                    ),
                 ),
-            equalTo(listOf("c", "d"))
+            equalTo(listOf("c", "d")),
         )
     }
 
@@ -53,10 +53,10 @@ internal class SolutionTest {
                         mutableListOf("cd", "1046"),
                         mutableListOf("cd", "1055"),
                         mutableListOf("ab", "1124"),
-                        mutableListOf("ab", "1120")
-                    )
+                        mutableListOf("ab", "1120"),
+                    ),
                 ),
-            equalTo(listOf("cd", "ab"))
+            equalTo(listOf("cd", "ab")),
         )
     }
 }
diff --git a/src/test/kotlin/g2901_3000/s2934_minimum_operations_to_maximize_last_elements_in_arrays/SolutionTest.kt b/src/test/kotlin/g2901_3000/s2934_minimum_operations_to_maximize_last_elements_in_arrays/SolutionTest.kt
index b16d0ed41..4499baf08 100644
--- a/src/test/kotlin/g2901_3000/s2934_minimum_operations_to_maximize_last_elements_in_arrays/SolutionTest.kt
+++ b/src/test/kotlin/g2901_3000/s2934_minimum_operations_to_maximize_last_elements_in_arrays/SolutionTest.kt
@@ -8,7 +8,8 @@ internal class SolutionTest {
     @Test
     fun minOperations() {
         assertThat(
-            Solution().minOperations(intArrayOf(1, 2, 7), intArrayOf(4, 5, 3)), equalTo(1)
+            Solution().minOperations(intArrayOf(1, 2, 7), intArrayOf(4, 5, 3)),
+            equalTo(1),
         )
     }
 
@@ -16,7 +17,7 @@ internal class SolutionTest {
     fun minOperations2() {
         assertThat(
             Solution().minOperations(intArrayOf(2, 3, 4, 5, 9), intArrayOf(8, 8, 4, 4, 4)),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -24,7 +25,7 @@ internal class SolutionTest {
     fun minOperations3() {
         assertThat(
             Solution().minOperations(intArrayOf(1, 5, 4), intArrayOf(2, 5, 3)),
-            equalTo(-1)
+            equalTo(-1),
         )
     }
 }
diff --git a/src/test/kotlin/g2901_3000/s2935_maximum_strong_pair_xor_ii/SolutionTest.kt b/src/test/kotlin/g2901_3000/s2935_maximum_strong_pair_xor_ii/SolutionTest.kt
index 7dadc09d9..44dc8dd93 100644
--- a/src/test/kotlin/g2901_3000/s2935_maximum_strong_pair_xor_ii/SolutionTest.kt
+++ b/src/test/kotlin/g2901_3000/s2935_maximum_strong_pair_xor_ii/SolutionTest.kt
@@ -19,7 +19,7 @@ internal class SolutionTest {
     fun maximumStrongPairXor3() {
         assertThat(
             Solution().maximumStrongPairXor(intArrayOf(500, 520, 2500, 3000)),
-            equalTo(1020)
+            equalTo(1020),
         )
     }
 }
diff --git a/src/test/kotlin/g2901_3000/s2940_find_building_where_alice_and_bob_can_meet/SolutionTest.kt b/src/test/kotlin/g2901_3000/s2940_find_building_where_alice_and_bob_can_meet/SolutionTest.kt
index d48ba4038..b87fa701f 100644
--- a/src/test/kotlin/g2901_3000/s2940_find_building_where_alice_and_bob_can_meet/SolutionTest.kt
+++ b/src/test/kotlin/g2901_3000/s2940_find_building_where_alice_and_bob_can_meet/SolutionTest.kt
@@ -13,10 +13,10 @@ internal class SolutionTest {
                 .leftmostBuildingQueries(
                     intArrayOf(6, 4, 8, 5, 2, 7),
                     CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
-                        "[0,1],[0,3],[2,4],[3,4],[2,2]"
-                    )
+                        "[0,1],[0,3],[2,4],[3,4],[2,2]",
+                    ),
                 ),
-            equalTo(intArrayOf(2, 5, -1, 5, 2))
+            equalTo(intArrayOf(2, 5, -1, 5, 2)),
         )
     }
 
@@ -27,10 +27,10 @@ internal class SolutionTest {
                 .leftmostBuildingQueries(
                     intArrayOf(5, 3, 8, 2, 6, 1, 4, 6),
                     CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
-                        "[0,7],[3,5],[5,2],[3,0],[1,6]"
-                    )
+                        "[0,7],[3,5],[5,2],[3,0],[1,6]",
+                    ),
                 ),
-            equalTo(intArrayOf(7, 6, -1, 4, 6))
+            equalTo(intArrayOf(7, 6, -1, 4, 6)),
         )
     }
 }
diff --git a/src/test/kotlin/g2901_3000/s2942_find_words_containing_character/SolutionTest.kt b/src/test/kotlin/g2901_3000/s2942_find_words_containing_character/SolutionTest.kt
index 4529f88c5..59155fa44 100644
--- a/src/test/kotlin/g2901_3000/s2942_find_words_containing_character/SolutionTest.kt
+++ b/src/test/kotlin/g2901_3000/s2942_find_words_containing_character/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun findWordsContaining() {
         assertThat(
             Solution().findWordsContaining(arrayOf("leet", "code"), 'e'),
-            equalTo(mutableListOf(0, 1))
+            equalTo(mutableListOf(0, 1)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun findWordsContaining2() {
         assertThat(
             Solution().findWordsContaining(arrayOf("abc", "bcd", "aaaa", "cbc"), 'a'),
-            equalTo(mutableListOf(0, 2))
+            equalTo(mutableListOf(0, 2)),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun findWordsContaining3() {
         assertThat(
             Solution().findWordsContaining(arrayOf("abc", "bcd", "aaaa", "cbc"), 'z'),
-            equalTo(mutableListOf<Any>())
+            equalTo(mutableListOf<Any>()),
         )
     }
 }
diff --git a/src/test/kotlin/g2901_3000/s2943_maximize_area_of_square_hole_in_grid/SolutionTest.kt b/src/test/kotlin/g2901_3000/s2943_maximize_area_of_square_hole_in_grid/SolutionTest.kt
index 192798f91..06624c58a 100644
--- a/src/test/kotlin/g2901_3000/s2943_maximize_area_of_square_hole_in_grid/SolutionTest.kt
+++ b/src/test/kotlin/g2901_3000/s2943_maximize_area_of_square_hole_in_grid/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun maximizeSquareHoleArea() {
         assertThat(
             Solution().maximizeSquareHoleArea(2, 1, intArrayOf(2, 3), intArrayOf(2)),
-            equalTo(4)
+            equalTo(4),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun maximizeSquareHoleArea2() {
         assertThat(
             Solution().maximizeSquareHoleArea(1, 1, intArrayOf(2), intArrayOf(2)),
-            equalTo(4)
+            equalTo(4),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun maximizeSquareHoleArea3() {
         assertThat(
             Solution().maximizeSquareHoleArea(2, 3, intArrayOf(2, 3), intArrayOf(2, 3, 4)),
-            equalTo(9)
+            equalTo(9),
         )
     }
 }
diff --git a/src/test/kotlin/g2901_3000/s2946_matrix_similarity_after_cyclic_shifts/SolutionTest.kt b/src/test/kotlin/g2901_3000/s2946_matrix_similarity_after_cyclic_shifts/SolutionTest.kt
index c03a84599..f6d14b73e 100644
--- a/src/test/kotlin/g2901_3000/s2946_matrix_similarity_after_cyclic_shifts/SolutionTest.kt
+++ b/src/test/kotlin/g2901_3000/s2946_matrix_similarity_after_cyclic_shifts/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .areSimilar(arrayOf(intArrayOf(1, 2, 1, 2), intArrayOf(5, 5, 5, 5), intArrayOf(6, 3, 6, 3)), 2),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
@@ -18,7 +18,7 @@ internal class SolutionTest {
     fun areSimilar2() {
         assertThat(
             Solution().areSimilar(arrayOf(intArrayOf(2, 2), intArrayOf(2, 2)), 3),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
diff --git a/src/test/kotlin/g2901_3000/s2948_make_lexicographically_smallest_array_by_swapping_elements/SolutionTest.kt b/src/test/kotlin/g2901_3000/s2948_make_lexicographically_smallest_array_by_swapping_elements/SolutionTest.kt
index 3e4b36091..96ded07a8 100644
--- a/src/test/kotlin/g2901_3000/s2948_make_lexicographically_smallest_array_by_swapping_elements/SolutionTest.kt
+++ b/src/test/kotlin/g2901_3000/s2948_make_lexicographically_smallest_array_by_swapping_elements/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun lexicographicallySmallestArray() {
         assertThat(
             Solution().lexicographicallySmallestArray(intArrayOf(1, 5, 3, 9, 8), 2),
-            equalTo(intArrayOf(1, 3, 5, 8, 9))
+            equalTo(intArrayOf(1, 3, 5, 8, 9)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun lexicographicallySmallestArray2() {
         assertThat(
             Solution().lexicographicallySmallestArray(intArrayOf(1, 7, 6, 18, 2, 1), 3),
-            equalTo(intArrayOf(1, 6, 7, 18, 1, 2))
+            equalTo(intArrayOf(1, 6, 7, 18, 1, 2)),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun lexicographicallySmallestArray3() {
         assertThat(
             Solution().lexicographicallySmallestArray(intArrayOf(1, 7, 28, 19, 10), 3),
-            equalTo(intArrayOf(1, 7, 28, 19, 10))
+            equalTo(intArrayOf(1, 7, 28, 19, 10)),
         )
     }
 }
diff --git a/src/test/kotlin/g2901_3000/s2952_minimum_number_of_coins_to_be_added/SolutionTest.kt b/src/test/kotlin/g2901_3000/s2952_minimum_number_of_coins_to_be_added/SolutionTest.kt
index 40ab1a066..3c19177b5 100644
--- a/src/test/kotlin/g2901_3000/s2952_minimum_number_of_coins_to_be_added/SolutionTest.kt
+++ b/src/test/kotlin/g2901_3000/s2952_minimum_number_of_coins_to_be_added/SolutionTest.kt
@@ -13,7 +13,8 @@ internal class SolutionTest {
     @Test
     fun minimumAddedCoins2() {
         assertThat(
-            Solution().minimumAddedCoins(intArrayOf(1, 4, 10, 5, 7, 19), 19), equalTo(1)
+            Solution().minimumAddedCoins(intArrayOf(1, 4, 10, 5, 7, 19), 19),
+            equalTo(1),
         )
     }
 
diff --git a/src/test/kotlin/g2901_3000/s2956_find_common_elements_between_two_arrays/SolutionTest.kt b/src/test/kotlin/g2901_3000/s2956_find_common_elements_between_two_arrays/SolutionTest.kt
index 5b408591c..ff84eaaf2 100644
--- a/src/test/kotlin/g2901_3000/s2956_find_common_elements_between_two_arrays/SolutionTest.kt
+++ b/src/test/kotlin/g2901_3000/s2956_find_common_elements_between_two_arrays/SolutionTest.kt
@@ -10,9 +10,10 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .findIntersectionValues(
-                    intArrayOf(4, 3, 2, 3, 1), intArrayOf(2, 2, 5, 2, 3, 6)
+                    intArrayOf(4, 3, 2, 3, 1),
+                    intArrayOf(2, 2, 5, 2, 3, 6),
                 ),
-            equalTo(intArrayOf(3, 4))
+            equalTo(intArrayOf(3, 4)),
         )
     }
 
@@ -20,7 +21,7 @@ internal class SolutionTest {
     fun findIntersectionValues2() {
         assertThat(
             Solution().findIntersectionValues(intArrayOf(3, 4, 2, 3), intArrayOf(1, 5)),
-            equalTo(intArrayOf(0, 0))
+            equalTo(intArrayOf(0, 0)),
         )
     }
 }
diff --git a/src/test/kotlin/g2901_3000/s2958_length_of_longest_subarray_with_at_most_k_frequency/SolutionTest.kt b/src/test/kotlin/g2901_3000/s2958_length_of_longest_subarray_with_at_most_k_frequency/SolutionTest.kt
index 3d04e6b84..de158cf1f 100644
--- a/src/test/kotlin/g2901_3000/s2958_length_of_longest_subarray_with_at_most_k_frequency/SolutionTest.kt
+++ b/src/test/kotlin/g2901_3000/s2958_length_of_longest_subarray_with_at_most_k_frequency/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun maxSubarrayLength() {
         assertThat(
             Solution().maxSubarrayLength(intArrayOf(1, 2, 3, 1, 2, 3, 1, 2), 2),
-            equalTo(6)
+            equalTo(6),
         )
     }
 
@@ -17,14 +17,15 @@ internal class SolutionTest {
     fun maxSubarrayLength2() {
         assertThat(
             Solution().maxSubarrayLength(intArrayOf(1, 2, 1, 2, 1, 2, 1, 2), 1),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
     @Test
     fun maxSubarrayLength3() {
         assertThat(
-            Solution().maxSubarrayLength(intArrayOf(5, 5, 5, 5, 5, 5, 5), 4), equalTo(4)
+            Solution().maxSubarrayLength(intArrayOf(5, 5, 5, 5, 5, 5, 5), 4),
+            equalTo(4),
         )
     }
 }
diff --git a/src/test/kotlin/g2901_3000/s2959_number_of_possible_sets_of_closing_branches/SolutionTest.kt b/src/test/kotlin/g2901_3000/s2959_number_of_possible_sets_of_closing_branches/SolutionTest.kt
index 55ddc95c1..a151c4a36 100644
--- a/src/test/kotlin/g2901_3000/s2959_number_of_possible_sets_of_closing_branches/SolutionTest.kt
+++ b/src/test/kotlin/g2901_3000/s2959_number_of_possible_sets_of_closing_branches/SolutionTest.kt
@@ -14,10 +14,10 @@ internal class SolutionTest {
                     3,
                     5,
                     CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
-                        "[0,1,2],[1,2,10],[0,2,10]"
-                    )
+                        "[0,1,2],[1,2,10],[0,2,10]",
+                    ),
                 ),
-            equalTo(5)
+            equalTo(5),
         )
     }
 
@@ -29,10 +29,10 @@ internal class SolutionTest {
                     3,
                     5,
                     CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
-                        "[0,1,20],[0,1,10],[1,2,2],[0,2,2]"
-                    )
+                        "[0,1,20],[0,1,10],[1,2,2],[0,2,2]",
+                    ),
                 ),
-            equalTo(7)
+            equalTo(7),
         )
     }
 
diff --git a/src/test/kotlin/g2901_3000/s2961_double_modular_exponentiation/SolutionTest.kt b/src/test/kotlin/g2901_3000/s2961_double_modular_exponentiation/SolutionTest.kt
index a93b1a432..77b6f7945 100644
--- a/src/test/kotlin/g2901_3000/s2961_double_modular_exponentiation/SolutionTest.kt
+++ b/src/test/kotlin/g2901_3000/s2961_double_modular_exponentiation/SolutionTest.kt
@@ -12,11 +12,11 @@ internal class SolutionTest {
             Solution()
                 .getGoodIndices(
                     CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
-                        "[2,3,3,10],[3,3,3,1],[6,1,1,4]"
+                        "[2,3,3,10],[3,3,3,1],[6,1,1,4]",
                     ),
-                    2
+                    2,
                 ),
-            equalTo(listOf(0, 2))
+            equalTo(listOf(0, 2)),
         )
     }
 
@@ -24,7 +24,7 @@ internal class SolutionTest {
     fun goodIndices2() {
         assertThat(
             Solution().getGoodIndices(arrayOf(intArrayOf(39, 3, 1000, 1000)), 17),
-            equalTo(listOf<Any>())
+            equalTo(listOf<Any>()),
         )
     }
 }
diff --git a/src/test/kotlin/g2901_3000/s2965_find_missing_and_repeated_values/SolutionTest.kt b/src/test/kotlin/g2901_3000/s2965_find_missing_and_repeated_values/SolutionTest.kt
index 23d53b69f..911310cf1 100644
--- a/src/test/kotlin/g2901_3000/s2965_find_missing_and_repeated_values/SolutionTest.kt
+++ b/src/test/kotlin/g2901_3000/s2965_find_missing_and_repeated_values/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun findMissingAndRepeatedValues() {
         assertThat(
             Solution().findMissingAndRepeatedValues(arrayOf(intArrayOf(1, 3), intArrayOf(2, 2))),
-            equalTo(intArrayOf(2, 4))
+            equalTo(intArrayOf(2, 4)),
         )
     }
 
@@ -18,9 +18,9 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .findMissingAndRepeatedValues(
-                    arrayOf(intArrayOf(9, 1, 7), intArrayOf(8, 9, 2), intArrayOf(3, 4, 6))
+                    arrayOf(intArrayOf(9, 1, 7), intArrayOf(8, 9, 2), intArrayOf(3, 4, 6)),
                 ),
-            equalTo(intArrayOf(9, 5))
+            equalTo(intArrayOf(9, 5)),
         )
     }
 }
diff --git a/src/test/kotlin/g2901_3000/s2966_divide_array_into_arrays_with_max_difference/SolutionTest.kt b/src/test/kotlin/g2901_3000/s2966_divide_array_into_arrays_with_max_difference/SolutionTest.kt
index ee80dd49e..585343496 100644
--- a/src/test/kotlin/g2901_3000/s2966_divide_array_into_arrays_with_max_difference/SolutionTest.kt
+++ b/src/test/kotlin/g2901_3000/s2966_divide_array_into_arrays_with_max_difference/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun divideArray() {
         assertThat(
             Solution().divideArray(intArrayOf(1, 3, 4, 8, 7, 9, 3, 5, 1), 2),
-            equalTo(arrayOf<IntArray?>(intArrayOf(1, 1, 3), intArrayOf(3, 4, 5), intArrayOf(7, 8, 9)))
+            equalTo(arrayOf<IntArray?>(intArrayOf(1, 1, 3), intArrayOf(3, 4, 5), intArrayOf(7, 8, 9))),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun divideArray2() {
         assertThat(
             Solution().divideArray(intArrayOf(1, 3, 3, 2, 7, 3), 3),
-            equalTo(arrayOf())
+            equalTo(arrayOf()),
         )
     }
 }
diff --git a/src/test/kotlin/g2901_3000/s2971_find_polygon_with_the_largest_perimeter/SolutionTest.kt b/src/test/kotlin/g2901_3000/s2971_find_polygon_with_the_largest_perimeter/SolutionTest.kt
index de20d1337..ce3a660c7 100644
--- a/src/test/kotlin/g2901_3000/s2971_find_polygon_with_the_largest_perimeter/SolutionTest.kt
+++ b/src/test/kotlin/g2901_3000/s2971_find_polygon_with_the_largest_perimeter/SolutionTest.kt
@@ -13,7 +13,8 @@ internal class SolutionTest {
     @Test
     fun largestPerimeter2() {
         assertThat(
-            Solution().largestPerimeter(intArrayOf(1, 12, 1, 2, 5, 50, 3)), equalTo(12L)
+            Solution().largestPerimeter(intArrayOf(1, 12, 1, 2, 5, 50, 3)),
+            equalTo(12L),
         )
     }
 
diff --git a/src/test/kotlin/g2901_3000/s2972_count_the_number_of_incremovable_subarrays_ii/SolutionTest.kt b/src/test/kotlin/g2901_3000/s2972_count_the_number_of_incremovable_subarrays_ii/SolutionTest.kt
index 6411b9a8b..f57073d02 100644
--- a/src/test/kotlin/g2901_3000/s2972_count_the_number_of_incremovable_subarrays_ii/SolutionTest.kt
+++ b/src/test/kotlin/g2901_3000/s2972_count_the_number_of_incremovable_subarrays_ii/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun incremovableSubarrayCount() {
         assertThat(
             Solution().incremovableSubarrayCount(intArrayOf(1, 2, 3, 4)),
-            equalTo(10L)
+            equalTo(10L),
         )
     }
 
diff --git a/src/test/kotlin/g2901_3000/s2973_find_number_of_coins_to_place_in_tree_nodes/SolutionTest.kt b/src/test/kotlin/g2901_3000/s2973_find_number_of_coins_to_place_in_tree_nodes/SolutionTest.kt
index 122dcc3c8..624245f9b 100644
--- a/src/test/kotlin/g2901_3000/s2973_find_number_of_coins_to_place_in_tree_nodes/SolutionTest.kt
+++ b/src/test/kotlin/g2901_3000/s2973_find_number_of_coins_to_place_in_tree_nodes/SolutionTest.kt
@@ -12,11 +12,11 @@ internal class SolutionTest {
             Solution()
                 .placedCoins(
                     convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
-                        "[0,1],[0,2],[0,3],[0,4],[0,5]"
+                        "[0,1],[0,2],[0,3],[0,4],[0,5]",
                     ),
-                    intArrayOf(1, 2, 3, 4, 5, 6)
+                    intArrayOf(1, 2, 3, 4, 5, 6),
                 ),
-            equalTo(longArrayOf(120, 1, 1, 1, 1, 1))
+            equalTo(longArrayOf(120, 1, 1, 1, 1, 1)),
         )
     }
 
@@ -26,11 +26,11 @@ internal class SolutionTest {
             Solution()
                 .placedCoins(
                     convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
-                        "[0,1],[0,2],[1,3],[1,4],[1,5],[2,6],[2,7],[2,8]"
+                        "[0,1],[0,2],[1,3],[1,4],[1,5],[2,6],[2,7],[2,8]",
                     ),
-                    intArrayOf(1, 4, 2, 3, 5, 7, 8, -4, 2)
+                    intArrayOf(1, 4, 2, 3, 5, 7, 8, -4, 2),
                 ),
-            equalTo(longArrayOf(280, 140, 32, 1, 1, 1, 1, 1, 1))
+            equalTo(longArrayOf(280, 140, 32, 1, 1, 1, 1, 1, 1)),
         )
     }
 
@@ -40,11 +40,11 @@ internal class SolutionTest {
             Solution()
                 .placedCoins(
                     convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
-                        "[0,1],[0,2]"
+                        "[0,1],[0,2]",
                     ),
-                    intArrayOf(1, 2, -2)
+                    intArrayOf(1, 2, -2),
                 ),
-            equalTo(longArrayOf(0, 1, 1))
+            equalTo(longArrayOf(0, 1, 1)),
         )
     }
 }
diff --git a/src/test/kotlin/g2901_3000/s2974_minimum_number_game/SolutionTest.kt b/src/test/kotlin/g2901_3000/s2974_minimum_number_game/SolutionTest.kt
index 20a181142..b988a327e 100644
--- a/src/test/kotlin/g2901_3000/s2974_minimum_number_game/SolutionTest.kt
+++ b/src/test/kotlin/g2901_3000/s2974_minimum_number_game/SolutionTest.kt
@@ -8,7 +8,8 @@ internal class SolutionTest {
     @Test
     fun numberGame() {
         assertThat(
-            Solution().numberGame(intArrayOf(5, 4, 2, 3)), equalTo(intArrayOf(3, 2, 5, 4))
+            Solution().numberGame(intArrayOf(5, 4, 2, 3)),
+            equalTo(intArrayOf(3, 2, 5, 4)),
         )
     }
 
diff --git a/src/test/kotlin/g2901_3000/s2975_maximum_square_area_by_removing_fences_from_a_field/SolutionTest.kt b/src/test/kotlin/g2901_3000/s2975_maximum_square_area_by_removing_fences_from_a_field/SolutionTest.kt
index 0d3dc5121..051001bd2 100644
--- a/src/test/kotlin/g2901_3000/s2975_maximum_square_area_by_removing_fences_from_a_field/SolutionTest.kt
+++ b/src/test/kotlin/g2901_3000/s2975_maximum_square_area_by_removing_fences_from_a_field/SolutionTest.kt
@@ -9,14 +9,15 @@ internal class SolutionTest {
     fun maximizeSquareArea() {
         assertThat(
             Solution().maximizeSquareArea(4, 3, intArrayOf(2, 3), intArrayOf(2)),
-            equalTo(4)
+            equalTo(4),
         )
     }
 
     @Test
     fun maximizeSquareArea2() {
         assertThat(
-            Solution().maximizeSquareArea(6, 7, intArrayOf(2), intArrayOf(4)), equalTo(-1)
+            Solution().maximizeSquareArea(6, 7, intArrayOf(2), intArrayOf(4)),
+            equalTo(-1),
         )
     }
 }
diff --git a/src/test/kotlin/g2901_3000/s2976_minimum_cost_to_convert_string_i/SolutionTest.kt b/src/test/kotlin/g2901_3000/s2976_minimum_cost_to_convert_string_i/SolutionTest.kt
index 2a62a2a2b..699ae5e3b 100644
--- a/src/test/kotlin/g2901_3000/s2976_minimum_cost_to_convert_string_i/SolutionTest.kt
+++ b/src/test/kotlin/g2901_3000/s2976_minimum_cost_to_convert_string_i/SolutionTest.kt
@@ -14,9 +14,9 @@ internal class SolutionTest {
                     "acbe",
                     charArrayOf('a', 'b', 'c', 'c', 'e', 'd'),
                     charArrayOf('b', 'c', 'b', 'e', 'b', 'e'),
-                    intArrayOf(2, 5, 5, 1, 2, 20)
+                    intArrayOf(2, 5, 5, 1, 2, 20),
                 ),
-            equalTo(28L)
+            equalTo(28L),
         )
     }
 
@@ -29,9 +29,9 @@ internal class SolutionTest {
                     "bbbb",
                     charArrayOf('a', 'c'),
                     charArrayOf('c', 'b'),
-                    intArrayOf(1, 2)
+                    intArrayOf(1, 2),
                 ),
-            equalTo(12L)
+            equalTo(12L),
         )
     }
 
@@ -44,9 +44,9 @@ internal class SolutionTest {
                     "abce",
                     charArrayOf('a'),
                     charArrayOf('e'),
-                    intArrayOf(1000)
+                    intArrayOf(1000),
                 ),
-            equalTo(-1L)
+            equalTo(-1L),
         )
     }
 }
diff --git a/src/test/kotlin/g2901_3000/s2977_minimum_cost_to_convert_string_ii/SolutionTest.kt b/src/test/kotlin/g2901_3000/s2977_minimum_cost_to_convert_string_ii/SolutionTest.kt
index fef819e12..5dcea1132 100644
--- a/src/test/kotlin/g2901_3000/s2977_minimum_cost_to_convert_string_ii/SolutionTest.kt
+++ b/src/test/kotlin/g2901_3000/s2977_minimum_cost_to_convert_string_ii/SolutionTest.kt
@@ -14,9 +14,9 @@ internal class SolutionTest {
                     "acbe",
                     arrayOf("a", "b", "c", "c", "e", "d"),
                     arrayOf("b", "c", "b", "e", "b", "e"),
-                    intArrayOf(2, 5, 5, 1, 2, 20)
+                    intArrayOf(2, 5, 5, 1, 2, 20),
                 ),
-            equalTo(28L)
+            equalTo(28L),
         )
     }
 
@@ -29,9 +29,9 @@ internal class SolutionTest {
                     "acdeeghh",
                     arrayOf("bcd", "fgh", "thh"),
                     arrayOf("cde", "thh", "ghh"),
-                    intArrayOf(1, 3, 5)
+                    intArrayOf(1, 3, 5),
                 ),
-            equalTo(9L)
+            equalTo(9L),
         )
     }
 
@@ -44,9 +44,9 @@ internal class SolutionTest {
                     "addddddd",
                     arrayOf("bcd", "defgh"),
                     arrayOf("ddd", "ddddd"),
-                    intArrayOf(100, 1578)
+                    intArrayOf(100, 1578),
                 ),
-            equalTo(-1L)
+            equalTo(-1L),
         )
     }
 }
diff --git a/src/test/kotlin/g2901_3000/s2983_palindrome_rearrangement_queries/SolutionTest.kt b/src/test/kotlin/g2901_3000/s2983_palindrome_rearrangement_queries/SolutionTest.kt
index 99359da31..fc92a8a6e 100644
--- a/src/test/kotlin/g2901_3000/s2983_palindrome_rearrangement_queries/SolutionTest.kt
+++ b/src/test/kotlin/g2901_3000/s2983_palindrome_rearrangement_queries/SolutionTest.kt
@@ -10,9 +10,10 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .canMakePalindromeQueries(
-                    "abcabc", arrayOf(intArrayOf(1, 1, 3, 5), intArrayOf(0, 2, 5, 5))
+                    "abcabc",
+                    arrayOf(intArrayOf(1, 1, 3, 5), intArrayOf(0, 2, 5, 5)),
                 ),
-            equalTo(booleanArrayOf(true, true))
+            equalTo(booleanArrayOf(true, true)),
         )
     }
 
@@ -20,7 +21,7 @@ internal class SolutionTest {
     fun canMakePalindromeQueries2() {
         assertThat(
             Solution().canMakePalindromeQueries("abbcdecbba", arrayOf(intArrayOf(0, 2, 7, 9))),
-            equalTo(booleanArrayOf(false))
+            equalTo(booleanArrayOf(false)),
         )
     }
 
@@ -28,7 +29,7 @@ internal class SolutionTest {
     fun canMakePalindromeQueries3() {
         assertThat(
             Solution().canMakePalindromeQueries("acbcab", arrayOf(intArrayOf(1, 2, 4, 5))),
-            equalTo(booleanArrayOf(true))
+            equalTo(booleanArrayOf(true)),
         )
     }
 
@@ -36,7 +37,7 @@ internal class SolutionTest {
     fun canMakePalindromeQueries4() {
         assertThat(
             Solution().canMakePalindromeQueries("bb", arrayOf(intArrayOf(0, 0, 1, 1))),
-            equalTo(booleanArrayOf(true))
+            equalTo(booleanArrayOf(true)),
         )
     }
 
@@ -45,9 +46,10 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .canMakePalindromeQueries(
-                    "abcabc", arrayOf(intArrayOf(1, 1, 3, 5), intArrayOf(0, 2, 5, 5))
+                    "abcabc",
+                    arrayOf(intArrayOf(1, 1, 3, 5), intArrayOf(0, 2, 5, 5)),
                 ),
-            equalTo(booleanArrayOf(true, true))
+            equalTo(booleanArrayOf(true, true)),
         )
     }
 
@@ -56,9 +58,10 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .canMakePalindromeQueries(
-                    "ckwbnmqmtzbixrrkixbtbqzmnwmc", arrayOf(intArrayOf(1, 9, 15, 24))
+                    "ckwbnmqmtzbixrrkixbtbqzmnwmc",
+                    arrayOf(intArrayOf(1, 9, 15, 24)),
                 ),
-            equalTo(booleanArrayOf(true))
+            equalTo(booleanArrayOf(true)),
         )
     }
 }
diff --git a/src/test/kotlin/g2901_3000/s2996_smallest_missing_integer_greater_than_sequential_prefix_sum/SolutionTest.kt b/src/test/kotlin/g2901_3000/s2996_smallest_missing_integer_greater_than_sequential_prefix_sum/SolutionTest.kt
index a861c996d..821c5859c 100644
--- a/src/test/kotlin/g2901_3000/s2996_smallest_missing_integer_greater_than_sequential_prefix_sum/SolutionTest.kt
+++ b/src/test/kotlin/g2901_3000/s2996_smallest_missing_integer_greater_than_sequential_prefix_sum/SolutionTest.kt
@@ -14,7 +14,7 @@ internal class SolutionTest {
     fun missingInteger2() {
         assertThat(
             Solution().missingInteger(intArrayOf(3, 4, 5, 1, 12, 14, 13)),
-            equalTo(15)
+            equalTo(15),
         )
     }
 }
diff --git a/src/test/kotlin/g2901_3000/s3000_maximum_area_of_longest_diagonal_rectangle/SolutionTest.kt b/src/test/kotlin/g2901_3000/s3000_maximum_area_of_longest_diagonal_rectangle/SolutionTest.kt
index df18ee991..d764b1971 100644
--- a/src/test/kotlin/g2901_3000/s3000_maximum_area_of_longest_diagonal_rectangle/SolutionTest.kt
+++ b/src/test/kotlin/g2901_3000/s3000_maximum_area_of_longest_diagonal_rectangle/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun areaOfMaxDiagonal() {
         assertThat(
             Solution().areaOfMaxDiagonal(arrayOf(intArrayOf(9, 3), intArrayOf(8, 6))),
-            equalTo(48)
+            equalTo(48),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun areaOfMaxDiagonal2() {
         assertThat(
             Solution().areaOfMaxDiagonal(arrayOf(intArrayOf(3, 4), intArrayOf(4, 3))),
-            equalTo(12)
+            equalTo(12),
         )
     }
 }
diff --git a/src/test/kotlin/g3001_3100/s3002_maximum_size_of_a_set_after_removals/SolutionTest.kt b/src/test/kotlin/g3001_3100/s3002_maximum_size_of_a_set_after_removals/SolutionTest.kt
index a3e25fd84..be1270cdd 100644
--- a/src/test/kotlin/g3001_3100/s3002_maximum_size_of_a_set_after_removals/SolutionTest.kt
+++ b/src/test/kotlin/g3001_3100/s3002_maximum_size_of_a_set_after_removals/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun maximumSetSize() {
         assertThat(
             Solution().maximumSetSize(intArrayOf(1, 2, 1, 2), intArrayOf(1, 1, 1, 1)),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -18,7 +18,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .maximumSetSize(intArrayOf(1, 2, 3, 4, 5, 6), intArrayOf(2, 3, 2, 3, 2, 3)),
-            equalTo(5)
+            equalTo(5),
         )
     }
 
@@ -27,7 +27,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .maximumSetSize(intArrayOf(1, 1, 2, 2, 3, 3), intArrayOf(4, 4, 5, 5, 6, 6)),
-            equalTo(6)
+            equalTo(6),
         )
     }
 }
diff --git a/src/test/kotlin/g3001_3100/s3006_find_beautiful_indices_in_the_given_array_i/SolutionTest.kt b/src/test/kotlin/g3001_3100/s3006_find_beautiful_indices_in_the_given_array_i/SolutionTest.kt
index d29678c22..3a30d4e4b 100644
--- a/src/test/kotlin/g3001_3100/s3006_find_beautiful_indices_in_the_given_array_i/SolutionTest.kt
+++ b/src/test/kotlin/g3001_3100/s3006_find_beautiful_indices_in_the_given_array_i/SolutionTest.kt
@@ -10,9 +10,12 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .beautifulIndices(
-                    "isawsquirrelnearmysquirrelhouseohmy", "my", "squirrel", 15
+                    "isawsquirrelnearmysquirrelhouseohmy",
+                    "my",
+                    "squirrel",
+                    15,
                 ),
-            equalTo(mutableListOf(16, 33))
+            equalTo(mutableListOf(16, 33)),
         )
     }
 
@@ -20,7 +23,7 @@ internal class SolutionTest {
     fun beautifulIndices2() {
         assertThat(
             Solution().beautifulIndices("abcd", "a", "a", 4),
-            equalTo(mutableListOf(0))
+            equalTo(mutableListOf(0)),
         )
     }
 }
diff --git a/src/test/kotlin/g3001_3100/s3008_find_beautiful_indices_in_the_given_array_ii/SolutionTest.kt b/src/test/kotlin/g3001_3100/s3008_find_beautiful_indices_in_the_given_array_ii/SolutionTest.kt
index d03abab42..c0607e3c7 100644
--- a/src/test/kotlin/g3001_3100/s3008_find_beautiful_indices_in_the_given_array_ii/SolutionTest.kt
+++ b/src/test/kotlin/g3001_3100/s3008_find_beautiful_indices_in_the_given_array_ii/SolutionTest.kt
@@ -10,9 +10,12 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .beautifulIndices(
-                    "isawsquirrelnearmysquirrelhouseohmy", "my", "squirrel", 15
+                    "isawsquirrelnearmysquirrelhouseohmy",
+                    "my",
+                    "squirrel",
+                    15,
                 ),
-            equalTo(mutableListOf(16, 33))
+            equalTo(mutableListOf(16, 33)),
         )
     }
 
diff --git a/src/test/kotlin/g3001_3100/s3022_minimize_or_of_remaining_elements_using_operations/SolutionTest.kt b/src/test/kotlin/g3001_3100/s3022_minimize_or_of_remaining_elements_using_operations/SolutionTest.kt
index 57a239368..c2c6321a4 100644
--- a/src/test/kotlin/g3001_3100/s3022_minimize_or_of_remaining_elements_using_operations/SolutionTest.kt
+++ b/src/test/kotlin/g3001_3100/s3022_minimize_or_of_remaining_elements_using_operations/SolutionTest.kt
@@ -13,7 +13,8 @@ internal class SolutionTest {
     @Test
     fun minOrAfterOperations2() {
         assertThat(
-            Solution().minOrAfterOperations(intArrayOf(7, 3, 15, 14, 2, 8), 4), equalTo(2)
+            Solution().minOrAfterOperations(intArrayOf(7, 3, 15, 14, 2, 8), 4),
+            equalTo(2),
         )
     }
 
@@ -21,7 +22,7 @@ internal class SolutionTest {
     fun minOrAfterOperations3() {
         assertThat(
             Solution().minOrAfterOperations(intArrayOf(10, 7, 10, 3, 9, 14, 9, 4), 1),
-            equalTo(15)
+            equalTo(15),
         )
     }
 }
diff --git a/src/test/kotlin/g3001_3100/s3025_find_the_number_of_ways_to_place_people_i/SolutionTest.kt b/src/test/kotlin/g3001_3100/s3025_find_the_number_of_ways_to_place_people_i/SolutionTest.kt
index 31abc4fd3..5c19ceef5 100644
--- a/src/test/kotlin/g3001_3100/s3025_find_the_number_of_ways_to_place_people_i/SolutionTest.kt
+++ b/src/test/kotlin/g3001_3100/s3025_find_the_number_of_ways_to_place_people_i/SolutionTest.kt
@@ -12,10 +12,10 @@ internal class SolutionTest {
             Solution()
                 .numberOfPairs(
                     convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
-                        "[1,1],[2,2],[3,3]"
-                    )
+                        "[1,1],[2,2],[3,3]",
+                    ),
                 ),
-            equalTo(0)
+            equalTo(0),
         )
     }
 
@@ -25,10 +25,10 @@ internal class SolutionTest {
             Solution()
                 .numberOfPairs(
                     convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
-                        "[6,2],[4,4],[2,6]"
-                    )
+                        "[6,2],[4,4],[2,6]",
+                    ),
                 ),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -38,10 +38,10 @@ internal class SolutionTest {
             Solution()
                 .numberOfPairs(
                     convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
-                        "[3,1],[1,3],[1,1]"
-                    )
+                        "[3,1],[1,3],[1,1]",
+                    ),
                 ),
-            equalTo(2)
+            equalTo(2),
         )
     }
 }
diff --git a/src/test/kotlin/g3001_3100/s3026_maximum_good_subarray_sum/SolutionTest.kt b/src/test/kotlin/g3001_3100/s3026_maximum_good_subarray_sum/SolutionTest.kt
index 1d547fea8..fa25879bb 100644
--- a/src/test/kotlin/g3001_3100/s3026_maximum_good_subarray_sum/SolutionTest.kt
+++ b/src/test/kotlin/g3001_3100/s3026_maximum_good_subarray_sum/SolutionTest.kt
@@ -8,7 +8,8 @@ internal class SolutionTest {
     @Test
     fun maximumSubarraySum() {
         assertThat(
-            Solution().maximumSubarraySum(intArrayOf(1, 2, 3, 4, 5, 6), 1), equalTo(11L)
+            Solution().maximumSubarraySum(intArrayOf(1, 2, 3, 4, 5, 6), 1),
+            equalTo(11L),
         )
     }
 
@@ -16,7 +17,7 @@ internal class SolutionTest {
     fun maximumSubarraySum2() {
         assertThat(
             Solution().maximumSubarraySum(intArrayOf(-1, 3, 2, 4, 5), 3),
-            equalTo(11L)
+            equalTo(11L),
         )
     }
 
@@ -24,7 +25,7 @@ internal class SolutionTest {
     fun maximumSubarraySum3() {
         assertThat(
             Solution().maximumSubarraySum(intArrayOf(-1, -2, -3, -4), 2),
-            equalTo(-6L)
+            equalTo(-6L),
         )
     }
 }
diff --git a/src/test/kotlin/g3001_3100/s3027_find_the_number_of_ways_to_place_people_ii/SolutionTest.kt b/src/test/kotlin/g3001_3100/s3027_find_the_number_of_ways_to_place_people_ii/SolutionTest.kt
index fc85349d0..8acc57c4b 100644
--- a/src/test/kotlin/g3001_3100/s3027_find_the_number_of_ways_to_place_people_ii/SolutionTest.kt
+++ b/src/test/kotlin/g3001_3100/s3027_find_the_number_of_ways_to_place_people_ii/SolutionTest.kt
@@ -12,10 +12,10 @@ internal class SolutionTest {
                 arrayOf(
                     intArrayOf(1, 1),
                     intArrayOf(2, 2),
-                    intArrayOf(3, 3)
-                )
+                    intArrayOf(3, 3),
+                ),
             ),
-            equalTo(0)
+            equalTo(0),
         )
     }
 
@@ -26,10 +26,10 @@ internal class SolutionTest {
                 arrayOf(
                     intArrayOf(6, 2),
                     intArrayOf(4, 4),
-                    intArrayOf(2, 6)
-                )
+                    intArrayOf(2, 6),
+                ),
             ),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -40,10 +40,10 @@ internal class SolutionTest {
                 arrayOf(
                     intArrayOf(3, 1),
                     intArrayOf(1, 3),
-                    intArrayOf(1, 1)
-                )
+                    intArrayOf(1, 1),
+                ),
             ),
-            equalTo(2)
+            equalTo(2),
         )
     }
 }
diff --git a/src/test/kotlin/g3001_3100/s3030_find_the_grid_of_region_average/SolutionTest.kt b/src/test/kotlin/g3001_3100/s3030_find_the_grid_of_region_average/SolutionTest.kt
index f4509b79d..3c439d3c0 100644
--- a/src/test/kotlin/g3001_3100/s3030_find_the_grid_of_region_average/SolutionTest.kt
+++ b/src/test/kotlin/g3001_3100/s3030_find_the_grid_of_region_average/SolutionTest.kt
@@ -12,15 +12,15 @@ internal class SolutionTest {
             Solution()
                 .resultGrid(
                     convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
-                        "[5,6,7,10],[8,9,10,10],[11,12,13,10]"
+                        "[5,6,7,10],[8,9,10,10],[11,12,13,10]",
                     ),
-                    3
+                    3,
                 ),
             equalTo(
                 convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
-                    "[9,9,9,9],[9,9,9,9],[9,9,9,9]"
-                )
-            )
+                    "[9,9,9,9],[9,9,9,9],[9,9,9,9]",
+                ),
+            ),
         )
     }
 
@@ -30,15 +30,15 @@ internal class SolutionTest {
             Solution()
                 .resultGrid(
                     convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
-                        "[10,20,30],[15,25,35],[20,30,40],[25,35,45]"
+                        "[10,20,30],[15,25,35],[20,30,40],[25,35,45]",
                     ),
-                    12
+                    12,
                 ),
             equalTo(
                 convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
-                    "[25,25,25],[27,27,27],[27,27,27],[30,30,30]"
-                )
-            )
+                    "[25,25,25],[27,27,27],[27,27,27],[30,30,30]",
+                ),
+            ),
         )
     }
 
@@ -48,15 +48,15 @@ internal class SolutionTest {
             Solution()
                 .resultGrid(
                     convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
-                        "[5,6,7],[8,9,10],[11,12,13]"
+                        "[5,6,7],[8,9,10],[11,12,13]",
                     ),
-                    1
+                    1,
                 ),
             equalTo(
                 convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
-                    "[5,6,7],[8,9,10],[11,12,13]"
-                )
-            )
+                    "[5,6,7],[8,9,10],[11,12,13]",
+                ),
+            ),
         )
     }
 }
diff --git a/src/test/kotlin/g3001_3100/s3033_modify_the_matrix/SolutionTest.kt b/src/test/kotlin/g3001_3100/s3033_modify_the_matrix/SolutionTest.kt
index 2f3c853bc..bd05c0c77 100644
--- a/src/test/kotlin/g3001_3100/s3033_modify_the_matrix/SolutionTest.kt
+++ b/src/test/kotlin/g3001_3100/s3033_modify_the_matrix/SolutionTest.kt
@@ -12,14 +12,14 @@ internal class SolutionTest {
             Solution()
                 .modifiedMatrix(
                     convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
-                        "[1,2,-1],[4,-1,6],[7,8,9]"
-                    )
+                        "[1,2,-1],[4,-1,6],[7,8,9]",
+                    ),
                 ),
             equalTo(
                 convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
-                    "[1,2,9],[4,8,6],[7,8,9]"
-                )
-            )
+                    "[1,2,9],[4,8,6],[7,8,9]",
+                ),
+            ),
         )
     }
 
@@ -27,7 +27,7 @@ internal class SolutionTest {
     fun modifiedMatrix2() {
         assertThat(
             Solution().modifiedMatrix(arrayOf(intArrayOf(3, -1), intArrayOf(5, 2))),
-            equalTo(arrayOf(intArrayOf(3, 2), intArrayOf(5, 2)))
+            equalTo(arrayOf(intArrayOf(3, 2), intArrayOf(5, 2))),
         )
     }
 }
diff --git a/src/test/kotlin/g3001_3100/s3034_number_of_subarrays_that_match_a_pattern_i/SolutionTest.kt b/src/test/kotlin/g3001_3100/s3034_number_of_subarrays_that_match_a_pattern_i/SolutionTest.kt
index 5ab6c2e41..8bc675a89 100644
--- a/src/test/kotlin/g3001_3100/s3034_number_of_subarrays_that_match_a_pattern_i/SolutionTest.kt
+++ b/src/test/kotlin/g3001_3100/s3034_number_of_subarrays_that_match_a_pattern_i/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .countMatchingSubarrays(intArrayOf(1, 2, 3, 4, 5, 6), intArrayOf(1, 1)),
-            equalTo(4)
+            equalTo(4),
         )
     }
 
@@ -19,9 +19,10 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .countMatchingSubarrays(
-                    intArrayOf(1, 4, 4, 1, 3, 5, 5, 3), intArrayOf(1, 0, -1)
+                    intArrayOf(1, 4, 4, 1, 3, 5, 5, 3),
+                    intArrayOf(1, 0, -1),
                 ),
-            equalTo(2)
+            equalTo(2),
         )
     }
 }
diff --git a/src/test/kotlin/g3001_3100/s3035_maximum_palindromes_after_operations/SolutionTest.kt b/src/test/kotlin/g3001_3100/s3035_maximum_palindromes_after_operations/SolutionTest.kt
index 295164565..6c31f0cc2 100644
--- a/src/test/kotlin/g3001_3100/s3035_maximum_palindromes_after_operations/SolutionTest.kt
+++ b/src/test/kotlin/g3001_3100/s3035_maximum_palindromes_after_operations/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun maxPalindromesAfterOperations() {
         assertThat(
             Solution().maxPalindromesAfterOperations(arrayOf("abbb", "ba", "aa")),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun maxPalindromesAfterOperations2() {
         assertThat(
             Solution().maxPalindromesAfterOperations(arrayOf("abc", "ab")),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun maxPalindromesAfterOperations3() {
         assertThat(
             Solution().maxPalindromesAfterOperations(arrayOf("cd", "ef", "a")),
-            equalTo(1)
+            equalTo(1),
         )
     }
 }
diff --git a/src/test/kotlin/g3001_3100/s3036_number_of_subarrays_that_match_a_pattern_ii/SolutionTest.kt b/src/test/kotlin/g3001_3100/s3036_number_of_subarrays_that_match_a_pattern_ii/SolutionTest.kt
index 231f6a0a8..c5a901a7d 100644
--- a/src/test/kotlin/g3001_3100/s3036_number_of_subarrays_that_match_a_pattern_ii/SolutionTest.kt
+++ b/src/test/kotlin/g3001_3100/s3036_number_of_subarrays_that_match_a_pattern_ii/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .countMatchingSubarrays(intArrayOf(1, 2, 3, 4, 5, 6), intArrayOf(1, 1)),
-            equalTo(4)
+            equalTo(4),
         )
     }
 
@@ -19,9 +19,10 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .countMatchingSubarrays(
-                    intArrayOf(1, 4, 4, 1, 3, 5, 5, 3), intArrayOf(1, 0, -1)
+                    intArrayOf(1, 4, 4, 1, 3, 5, 5, 3),
+                    intArrayOf(1, 0, -1),
                 ),
-            equalTo(2)
+            equalTo(2),
         )
     }
 }
diff --git a/src/test/kotlin/g3001_3100/s3042_count_prefix_and_suffix_pairs_i/SolutionTest.kt b/src/test/kotlin/g3001_3100/s3042_count_prefix_and_suffix_pairs_i/SolutionTest.kt
index e3d125536..1f0a88500 100644
--- a/src/test/kotlin/g3001_3100/s3042_count_prefix_and_suffix_pairs_i/SolutionTest.kt
+++ b/src/test/kotlin/g3001_3100/s3042_count_prefix_and_suffix_pairs_i/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun countPrefixSuffixPairs() {
         assertThat(
             Solution().countPrefixSuffixPairs(arrayOf("a", "aba", "ababa", "aa")),
-            equalTo(4)
+            equalTo(4),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun countPrefixSuffixPairs2() {
         assertThat(
             Solution().countPrefixSuffixPairs(arrayOf("pa", "papa", "ma", "mama")),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
diff --git a/src/test/kotlin/g3001_3100/s3043_find_the_length_of_the_longest_common_prefix/SolutionTest.kt b/src/test/kotlin/g3001_3100/s3043_find_the_length_of_the_longest_common_prefix/SolutionTest.kt
index b135597bb..52f467efe 100644
--- a/src/test/kotlin/g3001_3100/s3043_find_the_length_of_the_longest_common_prefix/SolutionTest.kt
+++ b/src/test/kotlin/g3001_3100/s3043_find_the_length_of_the_longest_common_prefix/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun longestCommonPrefix() {
         assertThat(
             Solution().longestCommonPrefix(intArrayOf(1, 10, 100), intArrayOf(1000)),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun longestCommonPrefix2() {
         assertThat(
             Solution().longestCommonPrefix(intArrayOf(1, 2, 3), intArrayOf(4, 4, 4)),
-            equalTo(0)
+            equalTo(0),
         )
     }
 }
diff --git a/src/test/kotlin/g3001_3100/s3044_most_frequent_prime/SolutionTest.kt b/src/test/kotlin/g3001_3100/s3044_most_frequent_prime/SolutionTest.kt
index 2759393be..df3717006 100644
--- a/src/test/kotlin/g3001_3100/s3044_most_frequent_prime/SolutionTest.kt
+++ b/src/test/kotlin/g3001_3100/s3044_most_frequent_prime/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun mostFrequentPrime() {
         assertThat(
             Solution().mostFrequentPrime(arrayOf(intArrayOf(1, 1), intArrayOf(9, 9), intArrayOf(1, 1))),
-            equalTo(19)
+            equalTo(19),
         )
     }
 
@@ -22,7 +22,7 @@ internal class SolutionTest {
     fun mostFrequentPrime3() {
         assertThat(
             Solution().mostFrequentPrime(arrayOf(intArrayOf(9, 7, 8), intArrayOf(4, 6, 5), intArrayOf(2, 8, 6))),
-            equalTo(97)
+            equalTo(97),
         )
     }
 }
diff --git a/src/test/kotlin/g3001_3100/s3045_count_prefix_and_suffix_pairs_ii/SolutionTest.kt b/src/test/kotlin/g3001_3100/s3045_count_prefix_and_suffix_pairs_ii/SolutionTest.kt
index 2959dccc6..d2f6f95b6 100644
--- a/src/test/kotlin/g3001_3100/s3045_count_prefix_and_suffix_pairs_ii/SolutionTest.kt
+++ b/src/test/kotlin/g3001_3100/s3045_count_prefix_and_suffix_pairs_ii/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun countPrefixSuffixPairs() {
         assertThat(
             Solution().countPrefixSuffixPairs(arrayOf("a", "aba", "ababa", "aa")),
-            equalTo(4L)
+            equalTo(4L),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun countPrefixSuffixPairs2() {
         assertThat(
             Solution().countPrefixSuffixPairs(arrayOf("pa", "papa", "ma", "mama")),
-            equalTo(2L)
+            equalTo(2L),
         )
     }
 
diff --git a/src/test/kotlin/g3001_3100/s3046_split_the_array/SolutionTest.kt b/src/test/kotlin/g3001_3100/s3046_split_the_array/SolutionTest.kt
index 7c1c7c207..c9e8be928 100644
--- a/src/test/kotlin/g3001_3100/s3046_split_the_array/SolutionTest.kt
+++ b/src/test/kotlin/g3001_3100/s3046_split_the_array/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun isPossibleToSplit() {
         assertThat(
             Solution().isPossibleToSplit(intArrayOf(1, 1, 2, 2, 3, 4)),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
diff --git a/src/test/kotlin/g3001_3100/s3047_find_the_largest_area_of_square_inside_two_rectangles/SolutionTest.kt b/src/test/kotlin/g3001_3100/s3047_find_the_largest_area_of_square_inside_two_rectangles/SolutionTest.kt
index 8532707f2..bece47c5e 100644
--- a/src/test/kotlin/g3001_3100/s3047_find_the_largest_area_of_square_inside_two_rectangles/SolutionTest.kt
+++ b/src/test/kotlin/g3001_3100/s3047_find_the_largest_area_of_square_inside_two_rectangles/SolutionTest.kt
@@ -12,13 +12,13 @@ internal class SolutionTest {
             Solution()
                 .largestSquareArea(
                     convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
-                        "[1,1],[2,2],[3,1]"
+                        "[1,1],[2,2],[3,1]",
                     ),
                     convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
-                        "[3,3],[4,4],[6,6]"
-                    )
+                        "[3,3],[4,4],[6,6]",
+                    ),
                 ),
-            equalTo(1L)
+            equalTo(1L),
         )
     }
 
@@ -28,13 +28,13 @@ internal class SolutionTest {
             Solution()
                 .largestSquareArea(
                     convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
-                        "[1,1],[2,2],[1,2]"
+                        "[1,1],[2,2],[1,2]",
                     ),
                     convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
-                        "[3,3],[4,4],[3,4]"
-                    )
+                        "[3,3],[4,4],[3,4]",
+                    ),
                 ),
-            equalTo(1L)
+            equalTo(1L),
         )
     }
 
@@ -44,13 +44,13 @@ internal class SolutionTest {
             Solution()
                 .largestSquareArea(
                     convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
-                        "[1,1],[3,3],[3,1]"
+                        "[1,1],[3,3],[3,1]",
                     ),
                     convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
-                        "[2,2],[4,4],[4,2]"
-                    )
+                        "[2,2],[4,4],[4,2]",
+                    ),
                 ),
-            equalTo(0L)
+            equalTo(0L),
         )
     }
 }
diff --git a/src/test/kotlin/g3001_3100/s3048_earliest_second_to_mark_indices_i/SolutionTest.kt b/src/test/kotlin/g3001_3100/s3048_earliest_second_to_mark_indices_i/SolutionTest.kt
index 80689a50b..00b5c7158 100644
--- a/src/test/kotlin/g3001_3100/s3048_earliest_second_to_mark_indices_i/SolutionTest.kt
+++ b/src/test/kotlin/g3001_3100/s3048_earliest_second_to_mark_indices_i/SolutionTest.kt
@@ -10,9 +10,10 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .earliestSecondToMarkIndices(
-                    intArrayOf(2, 2, 0), intArrayOf(2, 2, 2, 2, 3, 2, 2, 1)
+                    intArrayOf(2, 2, 0),
+                    intArrayOf(2, 2, 2, 2, 3, 2, 2, 1),
                 ),
-            equalTo(8)
+            equalTo(8),
         )
     }
 
@@ -21,9 +22,10 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .earliestSecondToMarkIndices(
-                    intArrayOf(1, 3), intArrayOf(1, 1, 1, 2, 1, 1, 1)
+                    intArrayOf(1, 3),
+                    intArrayOf(1, 1, 1, 2, 1, 1, 1),
                 ),
-            equalTo(6)
+            equalTo(6),
         )
     }
 
@@ -31,7 +33,7 @@ internal class SolutionTest {
     fun earliestSecondToMarkIndices3() {
         assertThat(
             Solution().earliestSecondToMarkIndices(intArrayOf(0, 1), intArrayOf(2, 2, 2)),
-            equalTo(-1)
+            equalTo(-1),
         )
     }
 }
diff --git a/src/test/kotlin/g3001_3100/s3049_earliest_second_to_mark_indices_ii/SolutionTest.kt b/src/test/kotlin/g3001_3100/s3049_earliest_second_to_mark_indices_ii/SolutionTest.kt
index a56c80e74..60a3c1e5a 100644
--- a/src/test/kotlin/g3001_3100/s3049_earliest_second_to_mark_indices_ii/SolutionTest.kt
+++ b/src/test/kotlin/g3001_3100/s3049_earliest_second_to_mark_indices_ii/SolutionTest.kt
@@ -10,9 +10,10 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .earliestSecondToMarkIndices(
-                    intArrayOf(3, 2, 3), intArrayOf(1, 3, 2, 2, 2, 2, 3)
+                    intArrayOf(3, 2, 3),
+                    intArrayOf(1, 3, 2, 2, 2, 2, 3),
                 ),
-            equalTo(6)
+            equalTo(6),
         )
     }
 
@@ -21,9 +22,10 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .earliestSecondToMarkIndices(
-                    intArrayOf(0, 0, 1, 2), intArrayOf(1, 2, 1, 2, 1, 2, 1, 2)
+                    intArrayOf(0, 0, 1, 2),
+                    intArrayOf(1, 2, 1, 2, 1, 2, 1, 2),
                 ),
-            equalTo(7)
+            equalTo(7),
         )
     }
 
@@ -32,7 +34,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .earliestSecondToMarkIndices(intArrayOf(1, 2, 3), intArrayOf(1, 2, 3)),
-            equalTo(-1)
+            equalTo(-1),
         )
     }
 }
diff --git a/src/test/kotlin/g3001_3100/s3067_count_pairs_of_connectable_servers_in_a_weighted_tree_network/SolutionTest.kt b/src/test/kotlin/g3001_3100/s3067_count_pairs_of_connectable_servers_in_a_weighted_tree_network/SolutionTest.kt
index 34249b088..e19ce7ab4 100644
--- a/src/test/kotlin/g3001_3100/s3067_count_pairs_of_connectable_servers_in_a_weighted_tree_network/SolutionTest.kt
+++ b/src/test/kotlin/g3001_3100/s3067_count_pairs_of_connectable_servers_in_a_weighted_tree_network/SolutionTest.kt
@@ -15,11 +15,11 @@ internal class SolutionTest {
                         intArrayOf(1, 2, 5),
                         intArrayOf(2, 3, 13),
                         intArrayOf(3, 4, 9),
-                        intArrayOf(4, 5, 2)
+                        intArrayOf(4, 5, 2),
                     ),
-                    1
+                    1,
                 ),
-            equalTo(intArrayOf(0, 4, 6, 6, 4, 0))
+            equalTo(intArrayOf(0, 4, 6, 6, 4, 0)),
         )
     }
 
@@ -34,11 +34,11 @@ internal class SolutionTest {
                         intArrayOf(0, 3, 1),
                         intArrayOf(3, 2, 7),
                         intArrayOf(3, 1, 6),
-                        intArrayOf(3, 4, 2)
+                        intArrayOf(3, 4, 2),
                     ),
-                    3
+                    3,
                 ),
-            equalTo(intArrayOf(2, 0, 0, 0, 0, 0, 2))
+            equalTo(intArrayOf(2, 0, 0, 0, 0, 0, 2)),
         )
     }
 }
diff --git a/src/test/kotlin/g3001_3100/s3068_find_the_maximum_sum_of_node_values/SolutionTest.kt b/src/test/kotlin/g3001_3100/s3068_find_the_maximum_sum_of_node_values/SolutionTest.kt
index 78854b05e..9f4deed79 100644
--- a/src/test/kotlin/g3001_3100/s3068_find_the_maximum_sum_of_node_values/SolutionTest.kt
+++ b/src/test/kotlin/g3001_3100/s3068_find_the_maximum_sum_of_node_values/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .maximumValueSum(intArrayOf(1, 2, 1), 3, arrayOf(intArrayOf(0, 1), intArrayOf(0, 2))),
-            equalTo(6L)
+            equalTo(6L),
         )
     }
 
@@ -18,7 +18,7 @@ internal class SolutionTest {
     fun maximumValueSum2() {
         assertThat(
             Solution().maximumValueSum(intArrayOf(2, 3), 7, arrayOf(intArrayOf(0, 1))),
-            equalTo(9L)
+            equalTo(9L),
         )
     }
 
@@ -29,9 +29,9 @@ internal class SolutionTest {
                 .maximumValueSum(
                     intArrayOf(7, 7, 7, 7, 7, 7),
                     3,
-                    arrayOf(intArrayOf(0, 1), intArrayOf(0, 2), intArrayOf(0, 3), intArrayOf(0, 4), intArrayOf(0, 5))
+                    arrayOf(intArrayOf(0, 1), intArrayOf(0, 2), intArrayOf(0, 3), intArrayOf(0, 4), intArrayOf(0, 5)),
                 ),
-            equalTo(42L)
+            equalTo(42L),
         )
     }
 }
diff --git a/src/test/kotlin/g3001_3100/s3069_distribute_elements_into_two_arrays_i/SolutionTest.kt b/src/test/kotlin/g3001_3100/s3069_distribute_elements_into_two_arrays_i/SolutionTest.kt
index 46e99907b..8acfb865e 100644
--- a/src/test/kotlin/g3001_3100/s3069_distribute_elements_into_two_arrays_i/SolutionTest.kt
+++ b/src/test/kotlin/g3001_3100/s3069_distribute_elements_into_two_arrays_i/SolutionTest.kt
@@ -14,7 +14,7 @@ internal class SolutionTest {
     fun resultArray2() {
         assertThat(
             Solution().resultArray(intArrayOf(5, 4, 3, 8)),
-            equalTo(intArrayOf(5, 3, 4, 8))
+            equalTo(intArrayOf(5, 3, 4, 8)),
         )
     }
 }
diff --git a/src/test/kotlin/g3001_3100/s3070_count_submatrices_with_top_left_element_and_sum_less_than_k/SolutionTest.kt b/src/test/kotlin/g3001_3100/s3070_count_submatrices_with_top_left_element_and_sum_less_than_k/SolutionTest.kt
index 196dbaff7..4ea4ba255 100644
--- a/src/test/kotlin/g3001_3100/s3070_count_submatrices_with_top_left_element_and_sum_less_than_k/SolutionTest.kt
+++ b/src/test/kotlin/g3001_3100/s3070_count_submatrices_with_top_left_element_and_sum_less_than_k/SolutionTest.kt
@@ -12,11 +12,11 @@ internal class SolutionTest {
             Solution()
                 .countSubmatrices(
                     CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
-                        "[7,6,3],[6,6,1]"
+                        "[7,6,3],[6,6,1]",
                     ),
-                    18
+                    18,
                 ),
-            equalTo(4)
+            equalTo(4),
         )
     }
 
@@ -26,11 +26,11 @@ internal class SolutionTest {
             Solution()
                 .countSubmatrices(
                     CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
-                        "[7,2,9],[1,5,0],[2,6,6]"
+                        "[7,2,9],[1,5,0],[2,6,6]",
                     ),
-                    20
+                    20,
                 ),
-            equalTo(6)
+            equalTo(6),
         )
     }
 }
diff --git a/src/test/kotlin/g3001_3100/s3071_minimum_operations_to_write_the_letter_y_on_a_grid/SolutionTest.kt b/src/test/kotlin/g3001_3100/s3071_minimum_operations_to_write_the_letter_y_on_a_grid/SolutionTest.kt
index 16124e416..1b7ef97d3 100644
--- a/src/test/kotlin/g3001_3100/s3071_minimum_operations_to_write_the_letter_y_on_a_grid/SolutionTest.kt
+++ b/src/test/kotlin/g3001_3100/s3071_minimum_operations_to_write_the_letter_y_on_a_grid/SolutionTest.kt
@@ -12,10 +12,10 @@ internal class SolutionTest {
             Solution()
                 .minimumOperationsToWriteY(
                     CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
-                        "[1,2,2],[1,1,0],[0,1,0]"
-                    )
+                        "[1,2,2],[1,1,0],[0,1,0]",
+                    ),
                 ),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
@@ -25,10 +25,10 @@ internal class SolutionTest {
             Solution()
                 .minimumOperationsToWriteY(
                     CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
-                        "[0,1,0,1,0],[2,1,0,1,2],[2,2,2,0,1],[2,2,2,2,2],[2,1,2,2,2]"
-                    )
+                        "[0,1,0,1,0],[2,1,0,1,2],[2,2,2,0,1],[2,2,2,2,2],[2,1,2,2,2]",
+                    ),
                 ),
-            equalTo(12)
+            equalTo(12),
         )
     }
 }
diff --git a/src/test/kotlin/g3001_3100/s3072_distribute_elements_into_two_arrays_ii/SolutionTest.kt b/src/test/kotlin/g3001_3100/s3072_distribute_elements_into_two_arrays_ii/SolutionTest.kt
index 4d969ea2e..cbbd28086 100644
--- a/src/test/kotlin/g3001_3100/s3072_distribute_elements_into_two_arrays_ii/SolutionTest.kt
+++ b/src/test/kotlin/g3001_3100/s3072_distribute_elements_into_two_arrays_ii/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun resultArray() {
         assertThat(
             Solution().resultArray(intArrayOf(2, 1, 3, 3)),
-            equalTo(intArrayOf(2, 3, 1, 3))
+            equalTo(intArrayOf(2, 3, 1, 3)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun resultArray2() {
         assertThat(
             Solution().resultArray(intArrayOf(5, 14, 3, 1, 2)),
-            equalTo(intArrayOf(5, 3, 1, 2, 14))
+            equalTo(intArrayOf(5, 3, 1, 2, 14)),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun resultArray3() {
         assertThat(
             Solution().resultArray(intArrayOf(3, 3, 3, 3)),
-            equalTo(intArrayOf(3, 3, 3, 3))
+            equalTo(intArrayOf(3, 3, 3, 3)),
         )
     }
 }
diff --git a/src/test/kotlin/g3001_3100/s3074_apple_redistribution_into_boxes/SolutionTest.kt b/src/test/kotlin/g3001_3100/s3074_apple_redistribution_into_boxes/SolutionTest.kt
index 24dde01df..d0a6b3c5f 100644
--- a/src/test/kotlin/g3001_3100/s3074_apple_redistribution_into_boxes/SolutionTest.kt
+++ b/src/test/kotlin/g3001_3100/s3074_apple_redistribution_into_boxes/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun minimumBoxes() {
         assertThat(
             Solution().minimumBoxes(intArrayOf(1, 3, 2), intArrayOf(4, 3, 1, 5, 2)),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun minimumBoxes2() {
         assertThat(
             Solution().minimumBoxes(intArrayOf(5, 5, 5), intArrayOf(2, 4, 2, 7)),
-            equalTo(4)
+            equalTo(4),
         )
     }
 }
diff --git a/src/test/kotlin/g3001_3100/s3076_shortest_uncommon_substring_in_an_array/SolutionTest.kt b/src/test/kotlin/g3001_3100/s3076_shortest_uncommon_substring_in_an_array/SolutionTest.kt
index 0804f1788..0af2c9d12 100644
--- a/src/test/kotlin/g3001_3100/s3076_shortest_uncommon_substring_in_an_array/SolutionTest.kt
+++ b/src/test/kotlin/g3001_3100/s3076_shortest_uncommon_substring_in_an_array/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun shortestSubstrings() {
         assertThat(
             Solution().shortestSubstrings(arrayOf("cab", "ad", "bad", "c")),
-            equalTo(arrayOf<String?>("ab", "", "ba", ""))
+            equalTo(arrayOf<String?>("ab", "", "ba", "")),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun shortestSubstrings2() {
         assertThat(
             Solution().shortestSubstrings(arrayOf("abc", "bcd", "abcd")),
-            equalTo(arrayOf<String?>("", "", "abcd"))
+            equalTo(arrayOf<String?>("", "", "abcd")),
         )
     }
 }
diff --git a/src/test/kotlin/g3001_3100/s3077_maximum_strength_of_k_disjoint_subarrays/SolutionTest.kt b/src/test/kotlin/g3001_3100/s3077_maximum_strength_of_k_disjoint_subarrays/SolutionTest.kt
index e9600b3fb..ea68b6c97 100644
--- a/src/test/kotlin/g3001_3100/s3077_maximum_strength_of_k_disjoint_subarrays/SolutionTest.kt
+++ b/src/test/kotlin/g3001_3100/s3077_maximum_strength_of_k_disjoint_subarrays/SolutionTest.kt
@@ -14,7 +14,7 @@ internal class SolutionTest {
     fun maximumStrength2() {
         assertThat(
             Solution().maximumStrength(intArrayOf(12, -2, -2, -2, -2), 5),
-            equalTo(64L)
+            equalTo(64L),
         )
     }
 
diff --git a/src/test/kotlin/g3001_3100/s3080_mark_elements_on_array_by_performing_queries/SolutionTest.kt b/src/test/kotlin/g3001_3100/s3080_mark_elements_on_array_by_performing_queries/SolutionTest.kt
index 9e37adbe5..c43327e3b 100644
--- a/src/test/kotlin/g3001_3100/s3080_mark_elements_on_array_by_performing_queries/SolutionTest.kt
+++ b/src/test/kotlin/g3001_3100/s3080_mark_elements_on_array_by_performing_queries/SolutionTest.kt
@@ -13,10 +13,10 @@ internal class SolutionTest {
                 .unmarkedSumArray(
                     intArrayOf(1, 2, 2, 1, 2, 3, 1),
                     CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
-                        "[1,2],[3,3],[4,2]"
-                    )
+                        "[1,2],[3,3],[4,2]",
+                    ),
                 ),
-            equalTo(longArrayOf(8, 3, 0))
+            equalTo(longArrayOf(8, 3, 0)),
         )
     }
 
@@ -24,7 +24,7 @@ internal class SolutionTest {
     fun unmarkedSumArray2() {
         assertThat(
             Solution().unmarkedSumArray(intArrayOf(1, 4, 2, 3), arrayOf(intArrayOf(0, 1))),
-            equalTo(longArrayOf(7))
+            equalTo(longArrayOf(7)),
         )
     }
 }
diff --git a/src/test/kotlin/g3001_3100/s3086_minimum_moves_to_pick_k_ones/SolutionTest.kt b/src/test/kotlin/g3001_3100/s3086_minimum_moves_to_pick_k_ones/SolutionTest.kt
index e1e3c9f1f..ee7ee80ad 100644
--- a/src/test/kotlin/g3001_3100/s3086_minimum_moves_to_pick_k_ones/SolutionTest.kt
+++ b/src/test/kotlin/g3001_3100/s3086_minimum_moves_to_pick_k_ones/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun minimumMoves() {
         assertThat(
             Solution().minimumMoves(intArrayOf(1, 1, 0, 0, 0, 1, 1, 0, 0, 1), 3, 1),
-            equalTo(3L)
+            equalTo(3L),
         )
     }
 
diff --git a/src/test/kotlin/g3001_3100/s3092_most_frequent_ids/SolutionTest.kt b/src/test/kotlin/g3001_3100/s3092_most_frequent_ids/SolutionTest.kt
index 0c0892f1f..803ad4e59 100644
--- a/src/test/kotlin/g3001_3100/s3092_most_frequent_ids/SolutionTest.kt
+++ b/src/test/kotlin/g3001_3100/s3092_most_frequent_ids/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun mostFrequentIDs() {
         assertThat(
             Solution().mostFrequentIDs(intArrayOf(2, 3, 2, 1), intArrayOf(3, 2, -3, 1)),
-            equalTo(longArrayOf(3, 3, 2, 2))
+            equalTo(longArrayOf(3, 3, 2, 2)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun mostFrequentIDs2() {
         assertThat(
             Solution().mostFrequentIDs(intArrayOf(5, 5, 3), intArrayOf(2, -2, 1)),
-            equalTo(longArrayOf(2, 0, 1))
+            equalTo(longArrayOf(2, 0, 1)),
         )
     }
 }
diff --git a/src/test/kotlin/g3001_3100/s3093_longest_common_suffix_queries/SolutionTest.kt b/src/test/kotlin/g3001_3100/s3093_longest_common_suffix_queries/SolutionTest.kt
index d18468740..d990e284a 100644
--- a/src/test/kotlin/g3001_3100/s3093_longest_common_suffix_queries/SolutionTest.kt
+++ b/src/test/kotlin/g3001_3100/s3093_longest_common_suffix_queries/SolutionTest.kt
@@ -11,9 +11,9 @@ internal class SolutionTest {
             Solution()
                 .stringIndices(
                     arrayOf("abcd", "bcd", "xbcd"),
-                    arrayOf("cd", "bcd", "xyz")
+                    arrayOf("cd", "bcd", "xyz"),
                 ),
-            equalTo(intArrayOf(1, 1, 1))
+            equalTo(intArrayOf(1, 1, 1)),
         )
     }
 
@@ -23,9 +23,9 @@ internal class SolutionTest {
             Solution()
                 .stringIndices(
                     arrayOf("abcdefgh", "poiuygh", "ghghgh"),
-                    arrayOf("gh", "acbfgh", "acbfegh")
+                    arrayOf("gh", "acbfgh", "acbfegh"),
                 ),
-            equalTo(intArrayOf(2, 0, 2))
+            equalTo(intArrayOf(2, 0, 2)),
         )
     }
 }
diff --git a/src/test/kotlin/g3101_3200/s3101_count_alternating_subarrays/SolutionTest.kt b/src/test/kotlin/g3101_3200/s3101_count_alternating_subarrays/SolutionTest.kt
index 6ff116d0a..8c48112de 100644
--- a/src/test/kotlin/g3101_3200/s3101_count_alternating_subarrays/SolutionTest.kt
+++ b/src/test/kotlin/g3101_3200/s3101_count_alternating_subarrays/SolutionTest.kt
@@ -14,7 +14,7 @@ internal class SolutionTest {
     fun countAlternatingSubarrays2() {
         assertThat(
             Solution().countAlternatingSubarrays(intArrayOf(1, 0, 1, 0)),
-            equalTo(10L)
+            equalTo(10L),
         )
     }
 }
diff --git a/src/test/kotlin/g3101_3200/s3102_minimize_manhattan_distances/SolutionTest.kt b/src/test/kotlin/g3101_3200/s3102_minimize_manhattan_distances/SolutionTest.kt
index 3928a2a6e..16af583ab 100644
--- a/src/test/kotlin/g3101_3200/s3102_minimize_manhattan_distances/SolutionTest.kt
+++ b/src/test/kotlin/g3101_3200/s3102_minimize_manhattan_distances/SolutionTest.kt
@@ -12,10 +12,10 @@ internal class SolutionTest {
             Solution()
                 .minimumDistance(
                     CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
-                        "[3,10],[5,15],[10,2],[4,4]"
-                    )
+                        "[3,10],[5,15],[10,2],[4,4]",
+                    ),
                 ),
-            equalTo(12)
+            equalTo(12),
         )
     }
 
@@ -25,10 +25,10 @@ internal class SolutionTest {
             Solution()
                 .minimumDistance(
                     CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
-                        "[1,1],[1,1],[1,1]"
-                    )
+                        "[1,1],[1,1],[1,1]",
+                    ),
                 ),
-            equalTo(0)
+            equalTo(0),
         )
     }
 }
diff --git a/src/test/kotlin/g3101_3200/s3105_longest_strictly_increasing_or_strictly_decreasing_subarray/SolutionTest.kt b/src/test/kotlin/g3101_3200/s3105_longest_strictly_increasing_or_strictly_decreasing_subarray/SolutionTest.kt
index 7bf86c221..11bb3d74d 100644
--- a/src/test/kotlin/g3101_3200/s3105_longest_strictly_increasing_or_strictly_decreasing_subarray/SolutionTest.kt
+++ b/src/test/kotlin/g3101_3200/s3105_longest_strictly_increasing_or_strictly_decreasing_subarray/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun longestMonotonicSubarray() {
         assertThat(
             Solution().longestMonotonicSubarray(intArrayOf(1, 4, 3, 3, 2)),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
diff --git a/src/test/kotlin/g3101_3200/s3107_minimum_operations_to_make_median_of_array_equal_to_k/SolutionTest.kt b/src/test/kotlin/g3101_3200/s3107_minimum_operations_to_make_median_of_array_equal_to_k/SolutionTest.kt
index cd26db73e..bace9f045 100644
--- a/src/test/kotlin/g3101_3200/s3107_minimum_operations_to_make_median_of_array_equal_to_k/SolutionTest.kt
+++ b/src/test/kotlin/g3101_3200/s3107_minimum_operations_to_make_median_of_array_equal_to_k/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun minOperationsToMakeMedianK() {
         assertThat(
             Solution().minOperationsToMakeMedianK(intArrayOf(2, 5, 6, 8, 5), 4),
-            equalTo(2L)
+            equalTo(2L),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun minOperationsToMakeMedianK2() {
         assertThat(
             Solution().minOperationsToMakeMedianK(intArrayOf(2, 5, 6, 8, 5), 7),
-            equalTo(3L)
+            equalTo(3L),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun minOperationsToMakeMedianK3() {
         assertThat(
             Solution().minOperationsToMakeMedianK(intArrayOf(1, 2, 3, 4, 5, 6), 4),
-            equalTo(0L)
+            equalTo(0L),
         )
     }
 }
diff --git a/src/test/kotlin/g3101_3200/s3108_minimum_cost_walk_in_weighted_graph/SolutionTest.kt b/src/test/kotlin/g3101_3200/s3108_minimum_cost_walk_in_weighted_graph/SolutionTest.kt
index c8640bd80..27390b30a 100644
--- a/src/test/kotlin/g3101_3200/s3108_minimum_cost_walk_in_weighted_graph/SolutionTest.kt
+++ b/src/test/kotlin/g3101_3200/s3108_minimum_cost_walk_in_weighted_graph/SolutionTest.kt
@@ -12,9 +12,9 @@ internal class SolutionTest {
                 .minimumCost(
                     5,
                     arrayOf(intArrayOf(0, 1, 7), intArrayOf(1, 3, 7), intArrayOf(1, 2, 1)),
-                    arrayOf(intArrayOf(0, 3), intArrayOf(3, 4))
+                    arrayOf(intArrayOf(0, 3), intArrayOf(3, 4)),
                 ),
-            equalTo(intArrayOf(1, -1))
+            equalTo(intArrayOf(1, -1)),
         )
     }
 
@@ -25,9 +25,9 @@ internal class SolutionTest {
                 .minimumCost(
                     3,
                     arrayOf(intArrayOf(0, 2, 7), intArrayOf(0, 1, 15), intArrayOf(1, 2, 6), intArrayOf(1, 2, 1)),
-                    arrayOf(intArrayOf(1, 2))
+                    arrayOf(intArrayOf(1, 2)),
                 ),
-            equalTo(intArrayOf(0))
+            equalTo(intArrayOf(0)),
         )
     }
 }
diff --git a/src/test/kotlin/g3101_3200/s3111_minimum_rectangles_to_cover_points/SolutionTest.kt b/src/test/kotlin/g3101_3200/s3111_minimum_rectangles_to_cover_points/SolutionTest.kt
index 5a6fdd89d..091ef45fd 100644
--- a/src/test/kotlin/g3101_3200/s3111_minimum_rectangles_to_cover_points/SolutionTest.kt
+++ b/src/test/kotlin/g3101_3200/s3111_minimum_rectangles_to_cover_points/SolutionTest.kt
@@ -16,11 +16,11 @@ internal class SolutionTest {
                         intArrayOf(1, 4),
                         intArrayOf(1, 8),
                         intArrayOf(3, 5),
-                        intArrayOf(4, 6)
+                        intArrayOf(4, 6),
                     ),
-                    1
+                    1,
                 ),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -36,11 +36,11 @@ internal class SolutionTest {
                         intArrayOf(3, 3),
                         intArrayOf(4, 4),
                         intArrayOf(5, 5),
-                        intArrayOf(6, 6)
+                        intArrayOf(6, 6),
                     ),
-                    2
+                    2,
                 ),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
@@ -48,7 +48,7 @@ internal class SolutionTest {
     fun minRectanglesToCoverPoints3() {
         assertThat(
             Solution().minRectanglesToCoverPoints(arrayOf(intArrayOf(2, 3), intArrayOf(1, 2)), 0),
-            equalTo(2)
+            equalTo(2),
         )
     }
 }
diff --git a/src/test/kotlin/g3101_3200/s3112_minimum_time_to_visit_disappearing_nodes/SolutionTest.kt b/src/test/kotlin/g3101_3200/s3112_minimum_time_to_visit_disappearing_nodes/SolutionTest.kt
index 0dcda9f9a..94b6feea6 100644
--- a/src/test/kotlin/g3101_3200/s3112_minimum_time_to_visit_disappearing_nodes/SolutionTest.kt
+++ b/src/test/kotlin/g3101_3200/s3112_minimum_time_to_visit_disappearing_nodes/SolutionTest.kt
@@ -12,9 +12,9 @@ internal class SolutionTest {
                 .minimumTime(
                     3,
                     arrayOf(intArrayOf(0, 1, 2), intArrayOf(1, 2, 1), intArrayOf(0, 2, 4)),
-                    intArrayOf(1, 1, 5)
+                    intArrayOf(1, 1, 5),
                 ),
-            equalTo(intArrayOf(0, -1, 4))
+            equalTo(intArrayOf(0, -1, 4)),
         )
     }
 
@@ -25,9 +25,9 @@ internal class SolutionTest {
                 .minimumTime(
                     3,
                     arrayOf(intArrayOf(0, 1, 2), intArrayOf(1, 2, 1), intArrayOf(0, 2, 4)),
-                    intArrayOf(1, 3, 5)
+                    intArrayOf(1, 3, 5),
                 ),
-            equalTo(intArrayOf(0, 2, 3))
+            equalTo(intArrayOf(0, 2, 3)),
         )
     }
 
@@ -35,7 +35,7 @@ internal class SolutionTest {
     fun minimumTime3() {
         assertThat(
             Solution().minimumTime(2, arrayOf(intArrayOf(0, 1, 1)), intArrayOf(1, 1)),
-            equalTo(intArrayOf(0, -1))
+            equalTo(intArrayOf(0, -1)),
         )
     }
 }
diff --git a/src/test/kotlin/g3101_3200/s3117_minimum_sum_of_values_by_dividing_array/SolutionTest.kt b/src/test/kotlin/g3101_3200/s3117_minimum_sum_of_values_by_dividing_array/SolutionTest.kt
index 73c0f99c7..3f55e8719 100644
--- a/src/test/kotlin/g3101_3200/s3117_minimum_sum_of_values_by_dividing_array/SolutionTest.kt
+++ b/src/test/kotlin/g3101_3200/s3117_minimum_sum_of_values_by_dividing_array/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun minimumValueSum() {
         assertThat(
             Solution().minimumValueSum(intArrayOf(1, 4, 3, 3, 2), intArrayOf(0, 3, 3, 2)),
-            equalTo(12)
+            equalTo(12),
         )
     }
 
@@ -18,14 +18,15 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .minimumValueSum(intArrayOf(2, 3, 5, 7, 7, 7, 5), intArrayOf(0, 7, 5)),
-            equalTo(17)
+            equalTo(17),
         )
     }
 
     @Test
     fun minimumValueSum3() {
         assertThat(
-            Solution().minimumValueSum(intArrayOf(1, 2, 3, 4), intArrayOf(2)), equalTo(-1)
+            Solution().minimumValueSum(intArrayOf(1, 2, 3, 4), intArrayOf(2)),
+            equalTo(-1),
         )
     }
 }
diff --git a/src/test/kotlin/g3101_3200/s3122_minimum_number_of_operations_to_satisfy_conditions/SolutionTest.kt b/src/test/kotlin/g3101_3200/s3122_minimum_number_of_operations_to_satisfy_conditions/SolutionTest.kt
index eab5a583f..46ea944c1 100644
--- a/src/test/kotlin/g3101_3200/s3122_minimum_number_of_operations_to_satisfy_conditions/SolutionTest.kt
+++ b/src/test/kotlin/g3101_3200/s3122_minimum_number_of_operations_to_satisfy_conditions/SolutionTest.kt
@@ -8,14 +8,16 @@ internal class SolutionTest {
     @Test
     fun minimumOperations() {
         assertThat(
-            Solution().minimumOperations(arrayOf(intArrayOf(1, 0, 2), intArrayOf(1, 0, 2))), equalTo(0)
+            Solution().minimumOperations(arrayOf(intArrayOf(1, 0, 2), intArrayOf(1, 0, 2))),
+            equalTo(0),
         )
     }
 
     @Test
     fun minimumOperations2() {
         assertThat(
-            Solution().minimumOperations(arrayOf(intArrayOf(1, 1, 1), intArrayOf(0, 0, 0))), equalTo(3)
+            Solution().minimumOperations(arrayOf(intArrayOf(1, 1, 1), intArrayOf(0, 0, 0))),
+            equalTo(3),
         )
     }
 }
diff --git a/src/test/kotlin/g3101_3200/s3123_find_edges_in_shortest_paths/SolutionTest.kt b/src/test/kotlin/g3101_3200/s3123_find_edges_in_shortest_paths/SolutionTest.kt
index de831cccf..692675520 100644
--- a/src/test/kotlin/g3101_3200/s3123_find_edges_in_shortest_paths/SolutionTest.kt
+++ b/src/test/kotlin/g3101_3200/s3123_find_edges_in_shortest_paths/SolutionTest.kt
@@ -19,10 +19,10 @@ internal class SolutionTest {
                         intArrayOf(1, 5, 1),
                         intArrayOf(2, 3, 1),
                         intArrayOf(3, 5, 3),
-                        intArrayOf(4, 5, 2)
-                    )
+                        intArrayOf(4, 5, 2),
+                    ),
                 ),
-            equalTo(booleanArrayOf(true, true, true, false, true, true, true, false))
+            equalTo(booleanArrayOf(true, true, true, false, true, true, true, false)),
         )
     }
 
@@ -32,9 +32,9 @@ internal class SolutionTest {
             Solution()
                 .findAnswer(
                     4,
-                    arrayOf(intArrayOf(2, 0, 1), intArrayOf(0, 1, 1), intArrayOf(0, 3, 4), intArrayOf(3, 2, 2))
+                    arrayOf(intArrayOf(2, 0, 1), intArrayOf(0, 1, 1), intArrayOf(0, 3, 4), intArrayOf(3, 2, 2)),
                 ),
-            equalTo(booleanArrayOf(true, false, false, true))
+            equalTo(booleanArrayOf(true, false, false, true)),
         )
     }
 }
diff --git a/src/test/kotlin/g3101_3200/s3127_make_a_square_with_the_same_color/SolutionTest.kt b/src/test/kotlin/g3101_3200/s3127_make_a_square_with_the_same_color/SolutionTest.kt
index 65f5961bd..8e07d5897 100644
--- a/src/test/kotlin/g3101_3200/s3127_make_a_square_with_the_same_color/SolutionTest.kt
+++ b/src/test/kotlin/g3101_3200/s3127_make_a_square_with_the_same_color/SolutionTest.kt
@@ -10,9 +10,9 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .canMakeSquare(
-                    arrayOf(charArrayOf('B', 'W', 'B'), charArrayOf('B', 'W', 'W'), charArrayOf('B', 'W', 'B'))
+                    arrayOf(charArrayOf('B', 'W', 'B'), charArrayOf('B', 'W', 'W'), charArrayOf('B', 'W', 'B')),
                 ),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
@@ -21,9 +21,9 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .canMakeSquare(
-                    arrayOf(charArrayOf('B', 'W', 'B'), charArrayOf('W', 'B', 'W'), charArrayOf('B', 'W', 'B'))
+                    arrayOf(charArrayOf('B', 'W', 'B'), charArrayOf('W', 'B', 'W'), charArrayOf('B', 'W', 'B')),
                 ),
-            equalTo(false)
+            equalTo(false),
         )
     }
 
@@ -32,9 +32,9 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .canMakeSquare(
-                    arrayOf(charArrayOf('B', 'W', 'B'), charArrayOf('B', 'W', 'W'), charArrayOf('B', 'W', 'W'))
+                    arrayOf(charArrayOf('B', 'W', 'B'), charArrayOf('B', 'W', 'W'), charArrayOf('B', 'W', 'W')),
                 ),
-            equalTo(true)
+            equalTo(true),
         )
     }
 }
diff --git a/src/test/kotlin/g3101_3200/s3128_right_triangles/SolutionTest.kt b/src/test/kotlin/g3101_3200/s3128_right_triangles/SolutionTest.kt
index b26dcd2b0..6cafc975e 100644
--- a/src/test/kotlin/g3101_3200/s3128_right_triangles/SolutionTest.kt
+++ b/src/test/kotlin/g3101_3200/s3128_right_triangles/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .numberOfRightTriangles(arrayOf(intArrayOf(0, 1, 0), intArrayOf(0, 1, 1), intArrayOf(0, 1, 0))),
-            equalTo(2L)
+            equalTo(2L),
         )
     }
 
@@ -19,9 +19,9 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .numberOfRightTriangles(
-                    arrayOf(intArrayOf(1, 0, 0, 0), intArrayOf(0, 1, 0, 1), intArrayOf(1, 0, 0, 0))
+                    arrayOf(intArrayOf(1, 0, 0, 0), intArrayOf(0, 1, 0, 1), intArrayOf(1, 0, 0, 0)),
                 ),
-            equalTo(0L)
+            equalTo(0L),
         )
     }
 
@@ -30,7 +30,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .numberOfRightTriangles(arrayOf(intArrayOf(1, 0, 1), intArrayOf(1, 0, 0), intArrayOf(1, 0, 0))),
-            equalTo(2L)
+            equalTo(2L),
         )
     }
 }
diff --git a/src/test/kotlin/g3101_3200/s3131_find_the_integer_added_to_array_i/SolutionTest.kt b/src/test/kotlin/g3101_3200/s3131_find_the_integer_added_to_array_i/SolutionTest.kt
index 9db485c51..1c10eedea 100644
--- a/src/test/kotlin/g3101_3200/s3131_find_the_integer_added_to_array_i/SolutionTest.kt
+++ b/src/test/kotlin/g3101_3200/s3131_find_the_integer_added_to_array_i/SolutionTest.kt
@@ -8,7 +8,8 @@ internal class SolutionTest {
     @Test
     fun addedInteger() {
         assertThat(
-            Solution().addedInteger(intArrayOf(2, 6, 4), intArrayOf(9, 7, 5)), equalTo(3)
+            Solution().addedInteger(intArrayOf(2, 6, 4), intArrayOf(9, 7, 5)),
+            equalTo(3),
         )
     }
 
@@ -21,7 +22,7 @@ internal class SolutionTest {
     fun addedInteger3() {
         assertThat(
             Solution().addedInteger(intArrayOf(1, 1, 1, 1), intArrayOf(1, 1, 1, 1)),
-            equalTo(0)
+            equalTo(0),
         )
     }
 }
diff --git a/src/test/kotlin/g3101_3200/s3132_find_the_integer_added_to_array_ii/SolutionTest.kt b/src/test/kotlin/g3101_3200/s3132_find_the_integer_added_to_array_ii/SolutionTest.kt
index d26fdc531..9ad07f0dd 100644
--- a/src/test/kotlin/g3101_3200/s3132_find_the_integer_added_to_array_ii/SolutionTest.kt
+++ b/src/test/kotlin/g3101_3200/s3132_find_the_integer_added_to_array_ii/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .minimumAddedInteger(intArrayOf(4, 20, 16, 12, 8), intArrayOf(14, 18, 10)),
-            equalTo(-2)
+            equalTo(-2),
         )
     }
 
@@ -18,7 +18,7 @@ internal class SolutionTest {
     fun minimumAddedInteger2() {
         assertThat(
             Solution().minimumAddedInteger(intArrayOf(3, 5, 5, 3), intArrayOf(7, 7)),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -26,7 +26,7 @@ internal class SolutionTest {
     fun minimumAddedInteger3() {
         assertThat(
             Solution().minimumAddedInteger(intArrayOf(10, 2, 8, 7, 5, 6, 7, 10), intArrayOf(5, 8, 5, 3, 8, 4)),
-            equalTo(-2)
+            equalTo(-2),
         )
     }
 }
diff --git a/src/test/kotlin/g3101_3200/s3137_minimum_number_of_operations_to_make_word_k_periodic/SolutionTest.kt b/src/test/kotlin/g3101_3200/s3137_minimum_number_of_operations_to_make_word_k_periodic/SolutionTest.kt
index cbf609807..25d78651e 100644
--- a/src/test/kotlin/g3101_3200/s3137_minimum_number_of_operations_to_make_word_k_periodic/SolutionTest.kt
+++ b/src/test/kotlin/g3101_3200/s3137_minimum_number_of_operations_to_make_word_k_periodic/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun minimumOperationsToMakeKPeriodic() {
         assertThat(
             Solution().minimumOperationsToMakeKPeriodic("leetcodeleet", 4),
-            equalTo(1)
+            equalTo(1),
         )
     }
 
diff --git a/src/test/kotlin/g3101_3200/s3139_minimum_cost_to_equalize_array/SolutionTest.kt b/src/test/kotlin/g3101_3200/s3139_minimum_cost_to_equalize_array/SolutionTest.kt
index 3156341e5..1d97a5a2c 100644
--- a/src/test/kotlin/g3101_3200/s3139_minimum_cost_to_equalize_array/SolutionTest.kt
+++ b/src/test/kotlin/g3101_3200/s3139_minimum_cost_to_equalize_array/SolutionTest.kt
@@ -13,7 +13,8 @@ internal class SolutionTest {
     @Test
     fun minCostToEqualizeArray2() {
         assertThat(
-            Solution().minCostToEqualizeArray(intArrayOf(2, 3, 3, 3, 5), 2, 1), equalTo(6)
+            Solution().minCostToEqualizeArray(intArrayOf(2, 3, 3, 3, 5), 2, 1),
+            equalTo(6),
         )
     }
 
diff --git a/src/test/kotlin/g3101_3200/s3142_check_if_grid_satisfies_conditions/SolutionTest.kt b/src/test/kotlin/g3101_3200/s3142_check_if_grid_satisfies_conditions/SolutionTest.kt
index 48a3cf034..f6e66312a 100644
--- a/src/test/kotlin/g3101_3200/s3142_check_if_grid_satisfies_conditions/SolutionTest.kt
+++ b/src/test/kotlin/g3101_3200/s3142_check_if_grid_satisfies_conditions/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun satisfiesConditions() {
         assertThat(
             Solution().satisfiesConditions(arrayOf(intArrayOf(1, 0, 2), intArrayOf(1, 0, 2))),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun satisfiesConditions2() {
         assertThat(
             Solution().satisfiesConditions(arrayOf(intArrayOf(1, 1, 1), intArrayOf(0, 0, 0))),
-            equalTo(false)
+            equalTo(false),
         )
     }
 }
diff --git a/src/test/kotlin/g3101_3200/s3143_maximum_points_inside_the_square/SolutionTest.kt b/src/test/kotlin/g3101_3200/s3143_maximum_points_inside_the_square/SolutionTest.kt
index 74d161a62..3c56b2695 100644
--- a/src/test/kotlin/g3101_3200/s3143_maximum_points_inside_the_square/SolutionTest.kt
+++ b/src/test/kotlin/g3101_3200/s3143_maximum_points_inside_the_square/SolutionTest.kt
@@ -15,11 +15,11 @@ internal class SolutionTest {
                         intArrayOf(-1, -2),
                         intArrayOf(-4, 4),
                         intArrayOf(-3, 1),
-                        intArrayOf(3, -3)
+                        intArrayOf(3, -3),
                     ),
-                    "abdca"
+                    "abdca",
                 ),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -28,7 +28,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .maxPointsInsideSquare(arrayOf(intArrayOf(1, 1), intArrayOf(-2, -2), intArrayOf(-2, 2)), "abb"),
-            equalTo(1)
+            equalTo(1),
         )
     }
 }
diff --git a/src/test/kotlin/g3101_3200/s3145_find_products_of_elements_of_big_array/SolutionTest.kt b/src/test/kotlin/g3101_3200/s3145_find_products_of_elements_of_big_array/SolutionTest.kt
index ca7397de3..1ce39a4c8 100644
--- a/src/test/kotlin/g3101_3200/s3145_find_products_of_elements_of_big_array/SolutionTest.kt
+++ b/src/test/kotlin/g3101_3200/s3145_find_products_of_elements_of_big_array/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun findProductsOfElements() {
         assertThat(
             Solution().findProductsOfElements(arrayOf(longArrayOf(1, 3, 7))),
-            equalTo(intArrayOf(4))
+            equalTo(intArrayOf(4)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun findProductsOfElements2() {
         assertThat(
             Solution().findProductsOfElements(arrayOf(longArrayOf(2, 5, 3), longArrayOf(7, 7, 4))),
-            equalTo(intArrayOf(2, 2))
+            equalTo(intArrayOf(2, 2)),
         )
     }
 }
diff --git a/src/test/kotlin/g3101_3200/s3148_maximum_difference_score_in_a_grid/SolutionTest.kt b/src/test/kotlin/g3101_3200/s3148_maximum_difference_score_in_a_grid/SolutionTest.kt
index b4487194c..9c9130c11 100644
--- a/src/test/kotlin/g3101_3200/s3148_maximum_difference_score_in_a_grid/SolutionTest.kt
+++ b/src/test/kotlin/g3101_3200/s3148_maximum_difference_score_in_a_grid/SolutionTest.kt
@@ -16,11 +16,11 @@ internal class SolutionTest {
                             intArrayOf(9, 5, 7, 3),
                             intArrayOf(8, 9, 6, 1),
                             intArrayOf(6, 7, 14, 3),
-                            intArrayOf(2, 5, 3, 1)
-                        )
-                    )
+                            intArrayOf(2, 5, 3, 1),
+                        ),
+                    ),
                 ),
-            equalTo(9)
+            equalTo(9),
         )
     }
 
@@ -28,7 +28,7 @@ internal class SolutionTest {
     fun maxScore2() {
         assertThat(
             Solution().maxScore(getLists(arrayOf(intArrayOf(4, 3, 2), intArrayOf(3, 2, 1)))),
-            equalTo(-1)
+            equalTo(-1),
         )
     }
 }
diff --git a/src/test/kotlin/g3101_3200/s3149_find_the_minimum_cost_array_permutation/SolutionTest.kt b/src/test/kotlin/g3101_3200/s3149_find_the_minimum_cost_array_permutation/SolutionTest.kt
index b398e02f1..1f645ded9 100644
--- a/src/test/kotlin/g3101_3200/s3149_find_the_minimum_cost_array_permutation/SolutionTest.kt
+++ b/src/test/kotlin/g3101_3200/s3149_find_the_minimum_cost_array_permutation/SolutionTest.kt
@@ -8,14 +8,16 @@ internal class SolutionTest {
     @Test
     fun findPermutation() {
         assertThat(
-            Solution().findPermutation(intArrayOf(1, 0, 2)), equalTo(intArrayOf(0, 1, 2))
+            Solution().findPermutation(intArrayOf(1, 0, 2)),
+            equalTo(intArrayOf(0, 1, 2)),
         )
     }
 
     @Test
     fun findPermutation2() {
         assertThat(
-            Solution().findPermutation(intArrayOf(0, 2, 1)), equalTo(intArrayOf(0, 2, 1))
+            Solution().findPermutation(intArrayOf(0, 2, 1)),
+            equalTo(intArrayOf(0, 2, 1)),
         )
     }
 }
diff --git a/src/test/kotlin/g3101_3200/s3152_special_array_ii/SolutionTest.kt b/src/test/kotlin/g3101_3200/s3152_special_array_ii/SolutionTest.kt
index a6e28208b..9f7f35ea6 100644
--- a/src/test/kotlin/g3101_3200/s3152_special_array_ii/SolutionTest.kt
+++ b/src/test/kotlin/g3101_3200/s3152_special_array_ii/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun isArraySpecial() {
         assertThat(
             Solution().isArraySpecial(intArrayOf(3, 4, 1, 2, 6), arrayOf(intArrayOf(0, 4))),
-            equalTo(booleanArrayOf(false))
+            equalTo(booleanArrayOf(false)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun isArraySpecial2() {
         assertThat(
             Solution().isArraySpecial(intArrayOf(4, 3, 1, 6), arrayOf(intArrayOf(0, 2), intArrayOf(2, 3))),
-            equalTo(booleanArrayOf(false, true))
+            equalTo(booleanArrayOf(false, true)),
         )
     }
 }
diff --git a/src/test/kotlin/g3101_3200/s3159_find_occurrences_of_an_element_in_an_array/SolutionTest.kt b/src/test/kotlin/g3101_3200/s3159_find_occurrences_of_an_element_in_an_array/SolutionTest.kt
index 99be433f3..01cb978fb 100644
--- a/src/test/kotlin/g3101_3200/s3159_find_occurrences_of_an_element_in_an_array/SolutionTest.kt
+++ b/src/test/kotlin/g3101_3200/s3159_find_occurrences_of_an_element_in_an_array/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .occurrencesOfElement(intArrayOf(1, 3, 1, 7), intArrayOf(1, 3, 2, 4), 1),
-            equalTo(intArrayOf(0, -1, 2, -1))
+            equalTo(intArrayOf(0, -1, 2, -1)),
         )
     }
 
@@ -18,7 +18,7 @@ internal class SolutionTest {
     fun occurrencesOfElement2() {
         assertThat(
             Solution().occurrencesOfElement(intArrayOf(1, 2, 3), intArrayOf(10), 5),
-            equalTo(intArrayOf(-1))
+            equalTo(intArrayOf(-1)),
         )
     }
 }
diff --git a/src/test/kotlin/g3101_3200/s3160_find_the_number_of_distinct_colors_among_the_balls/SolutionTest.kt b/src/test/kotlin/g3101_3200/s3160_find_the_number_of_distinct_colors_among_the_balls/SolutionTest.kt
index 98c4ad580..cff254cf8 100644
--- a/src/test/kotlin/g3101_3200/s3160_find_the_number_of_distinct_colors_among_the_balls/SolutionTest.kt
+++ b/src/test/kotlin/g3101_3200/s3160_find_the_number_of_distinct_colors_among_the_balls/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun queryResults() {
         assertThat(
             Solution().queryResults(4, arrayOf(intArrayOf(1, 4), intArrayOf(2, 5), intArrayOf(1, 3), intArrayOf(3, 4))),
-            equalTo(intArrayOf(1, 2, 2, 3))
+            equalTo(intArrayOf(1, 2, 2, 3)),
         )
     }
 
@@ -19,9 +19,9 @@ internal class SolutionTest {
             Solution()
                 .queryResults(
                     4,
-                    arrayOf(intArrayOf(0, 1), intArrayOf(1, 2), intArrayOf(2, 2), intArrayOf(3, 4), intArrayOf(4, 5))
+                    arrayOf(intArrayOf(0, 1), intArrayOf(1, 2), intArrayOf(2, 2), intArrayOf(3, 4), intArrayOf(4, 5)),
                 ),
-            equalTo(intArrayOf(1, 2, 2, 3, 4))
+            equalTo(intArrayOf(1, 2, 2, 3, 4)),
         )
     }
 
@@ -31,9 +31,9 @@ internal class SolutionTest {
             Solution()
                 .queryResults(
                     1,
-                    arrayOf(intArrayOf(0, 2), intArrayOf(1, 10), intArrayOf(0, 10), intArrayOf(0, 3), intArrayOf(1, 5))
+                    arrayOf(intArrayOf(0, 2), intArrayOf(1, 10), intArrayOf(0, 10), intArrayOf(0, 3), intArrayOf(1, 5)),
                 ),
-            equalTo(intArrayOf(1, 2, 1, 2, 2))
+            equalTo(intArrayOf(1, 2, 1, 2, 2)),
         )
     }
 }
diff --git a/src/test/kotlin/g3101_3200/s3161_block_placement_queries/SolutionTest.kt b/src/test/kotlin/g3101_3200/s3161_block_placement_queries/SolutionTest.kt
index 0212259e2..4c7956299 100644
--- a/src/test/kotlin/g3101_3200/s3161_block_placement_queries/SolutionTest.kt
+++ b/src/test/kotlin/g3101_3200/s3161_block_placement_queries/SolutionTest.kt
@@ -13,10 +13,10 @@ internal class SolutionTest {
                     intArrayOf(1, 2),
                     intArrayOf(2, 3, 3),
                     intArrayOf(2, 3, 1),
-                    intArrayOf(2, 2, 2)
-                )
+                    intArrayOf(2, 2, 2),
+                ),
             ),
-            equalTo(listOf(false, true, true))
+            equalTo(listOf(false, true, true)),
         )
     }
 
@@ -30,10 +30,10 @@ internal class SolutionTest {
                         intArrayOf(2, 7, 6),
                         intArrayOf(1, 2),
                         intArrayOf(2, 7, 5),
-                        intArrayOf(2, 7, 6)
-                    )
+                        intArrayOf(2, 7, 6),
+                    ),
                 ),
-            equalTo(listOf(true, true, false))
+            equalTo(listOf(true, true, false)),
         )
     }
 
@@ -47,10 +47,10 @@ internal class SolutionTest {
                         intArrayOf(1, 9),
                         intArrayOf(2, 15, 4),
                         intArrayOf(2, 11, 6),
-                        intArrayOf(2, 13, 10)
-                    )
+                        intArrayOf(2, 13, 10),
+                    ),
                 ),
-            equalTo(listOf(true, false, false))
+            equalTo(listOf(true, false, false)),
         )
     }
 }
diff --git a/src/test/kotlin/g3101_3200/s3162_find_the_number_of_good_pairs_i/SolutionTest.kt b/src/test/kotlin/g3101_3200/s3162_find_the_number_of_good_pairs_i/SolutionTest.kt
index 49421f754..dc5eb4dd3 100644
--- a/src/test/kotlin/g3101_3200/s3162_find_the_number_of_good_pairs_i/SolutionTest.kt
+++ b/src/test/kotlin/g3101_3200/s3162_find_the_number_of_good_pairs_i/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun numberOfPairs() {
         assertThat(
             Solution().numberOfPairs(intArrayOf(1, 3, 4), intArrayOf(1, 3, 4), 1),
-            equalTo(5)
+            equalTo(5),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun numberOfPairs2() {
         assertThat(
             Solution().numberOfPairs(intArrayOf(1, 2, 4, 12), intArrayOf(2, 4), 3),
-            equalTo(2)
+            equalTo(2),
         )
     }
 }
diff --git a/src/test/kotlin/g3101_3200/s3164_find_the_number_of_good_pairs_ii/SolutionTest.kt b/src/test/kotlin/g3101_3200/s3164_find_the_number_of_good_pairs_ii/SolutionTest.kt
index e4852d6d4..d3bfae711 100644
--- a/src/test/kotlin/g3101_3200/s3164_find_the_number_of_good_pairs_ii/SolutionTest.kt
+++ b/src/test/kotlin/g3101_3200/s3164_find_the_number_of_good_pairs_ii/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun numberOfPairs() {
         assertThat(
             Solution().numberOfPairs(intArrayOf(1, 3, 4), intArrayOf(1, 3, 4), 1),
-            equalTo(5L)
+            equalTo(5L),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun numberOfPairs2() {
         assertThat(
             Solution().numberOfPairs(intArrayOf(1, 2, 4, 12), intArrayOf(2, 4), 3),
-            equalTo(2L)
+            equalTo(2L),
         )
     }
 }
diff --git a/src/test/kotlin/g3101_3200/s3165_maximum_sum_of_subsequence_with_non_adjacent_elements/SolutionTest.kt b/src/test/kotlin/g3101_3200/s3165_maximum_sum_of_subsequence_with_non_adjacent_elements/SolutionTest.kt
index f47cf09af..11882281e 100644
--- a/src/test/kotlin/g3101_3200/s3165_maximum_sum_of_subsequence_with_non_adjacent_elements/SolutionTest.kt
+++ b/src/test/kotlin/g3101_3200/s3165_maximum_sum_of_subsequence_with_non_adjacent_elements/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .maximumSumSubsequence(intArrayOf(3, 5, 9), arrayOf(intArrayOf(1, -2), intArrayOf(0, -3))),
-            equalTo(21)
+            equalTo(21),
         )
     }
 
@@ -18,7 +18,7 @@ internal class SolutionTest {
     fun maximumSumSubsequence2() {
         assertThat(
             Solution().maximumSumSubsequence(intArrayOf(0, -1), arrayOf(intArrayOf(0, -5))),
-            equalTo(0)
+            equalTo(0),
         )
     }
 }
diff --git a/src/test/kotlin/g3101_3200/s3169_count_days_without_meetings/SolutionTest.kt b/src/test/kotlin/g3101_3200/s3169_count_days_without_meetings/SolutionTest.kt
index 16f6f2a8c..bf3fce98c 100644
--- a/src/test/kotlin/g3101_3200/s3169_count_days_without_meetings/SolutionTest.kt
+++ b/src/test/kotlin/g3101_3200/s3169_count_days_without_meetings/SolutionTest.kt
@@ -10,9 +10,9 @@ internal class SolutionTest {
         assertThat(
             Solution().countDays(
                 10,
-                arrayOf(intArrayOf(5, 7), intArrayOf(1, 3), intArrayOf(9, 10))
+                arrayOf(intArrayOf(5, 7), intArrayOf(1, 3), intArrayOf(9, 10)),
             ),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -20,7 +20,7 @@ internal class SolutionTest {
     fun countDays2() {
         assertThat(
             Solution().countDays(5, arrayOf(intArrayOf(2, 4), intArrayOf(1, 3))),
-            equalTo(1)
+            equalTo(1),
         )
     }
 
diff --git a/src/test/kotlin/g3101_3200/s3184_count_pairs_that_form_a_complete_day_i/SolutionTest.kt b/src/test/kotlin/g3101_3200/s3184_count_pairs_that_form_a_complete_day_i/SolutionTest.kt
index 36338054c..c599141c5 100644
--- a/src/test/kotlin/g3101_3200/s3184_count_pairs_that_form_a_complete_day_i/SolutionTest.kt
+++ b/src/test/kotlin/g3101_3200/s3184_count_pairs_that_form_a_complete_day_i/SolutionTest.kt
@@ -8,7 +8,8 @@ internal class SolutionTest {
     @Test
     fun countCompleteDayPairs() {
         assertThat(
-            Solution().countCompleteDayPairs(intArrayOf(12, 12, 30, 24, 24)), equalTo(2)
+            Solution().countCompleteDayPairs(intArrayOf(12, 12, 30, 24, 24)),
+            equalTo(2),
         )
     }
 
diff --git a/src/test/kotlin/g3101_3200/s3185_count_pairs_that_form_a_complete_day_ii/SolutionTest.kt b/src/test/kotlin/g3101_3200/s3185_count_pairs_that_form_a_complete_day_ii/SolutionTest.kt
index 2ccd7cbec..255e715d1 100644
--- a/src/test/kotlin/g3101_3200/s3185_count_pairs_that_form_a_complete_day_ii/SolutionTest.kt
+++ b/src/test/kotlin/g3101_3200/s3185_count_pairs_that_form_a_complete_day_ii/SolutionTest.kt
@@ -8,7 +8,8 @@ internal class SolutionTest {
     @Test
     fun countCompleteDayPairs() {
         assertThat(
-            Solution().countCompleteDayPairs(intArrayOf(12, 12, 30, 24, 24)), equalTo(2L)
+            Solution().countCompleteDayPairs(intArrayOf(12, 12, 30, 24, 24)),
+            equalTo(2L),
         )
     }
 
diff --git a/src/test/kotlin/g3101_3200/s3186_maximum_total_damage_with_spell_casting/SolutionTest.kt b/src/test/kotlin/g3101_3200/s3186_maximum_total_damage_with_spell_casting/SolutionTest.kt
index 4c21719e2..c325b0361 100644
--- a/src/test/kotlin/g3101_3200/s3186_maximum_total_damage_with_spell_casting/SolutionTest.kt
+++ b/src/test/kotlin/g3101_3200/s3186_maximum_total_damage_with_spell_casting/SolutionTest.kt
@@ -19,7 +19,7 @@ internal class SolutionTest {
     fun maximumTotalDamage3() {
         assertThat(
             Solution().maximumTotalDamage(intArrayOf(1000001, 1, 6, 6)),
-            equalTo(1000014L)
+            equalTo(1000014L),
         )
     }
 }
diff --git a/src/test/kotlin/g3101_3200/s3187_peaks_in_array/SolutionTest.kt b/src/test/kotlin/g3101_3200/s3187_peaks_in_array/SolutionTest.kt
index c89599928..a1c5d29f6 100644
--- a/src/test/kotlin/g3101_3200/s3187_peaks_in_array/SolutionTest.kt
+++ b/src/test/kotlin/g3101_3200/s3187_peaks_in_array/SolutionTest.kt
@@ -10,9 +10,10 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .countOfPeaks(
-                    intArrayOf(3, 1, 4, 2, 5), arrayOf(intArrayOf(2, 3, 4), intArrayOf(1, 0, 4))
+                    intArrayOf(3, 1, 4, 2, 5),
+                    arrayOf(intArrayOf(2, 3, 4), intArrayOf(1, 0, 4)),
                 ),
-            equalTo(listOf(0))
+            equalTo(listOf(0)),
         )
     }
 
@@ -22,9 +23,9 @@ internal class SolutionTest {
             Solution()
                 .countOfPeaks(
                     intArrayOf(4, 1, 4, 2, 1, 5),
-                    arrayOf(intArrayOf(2, 2, 4), intArrayOf(1, 0, 2), intArrayOf(1, 0, 4))
+                    arrayOf(intArrayOf(2, 2, 4), intArrayOf(1, 0, 2), intArrayOf(1, 0, 4)),
                 ),
-            equalTo(listOf(0, 1))
+            equalTo(listOf(0, 1)),
         )
     }
 }
diff --git a/src/test/kotlin/g3101_3200/s3193_count_the_number_of_inversions/SolutionTest.kt b/src/test/kotlin/g3101_3200/s3193_count_the_number_of_inversions/SolutionTest.kt
index 889f0c150..b02718d89 100644
--- a/src/test/kotlin/g3101_3200/s3193_count_the_number_of_inversions/SolutionTest.kt
+++ b/src/test/kotlin/g3101_3200/s3193_count_the_number_of_inversions/SolutionTest.kt
@@ -8,7 +8,8 @@ internal class SolutionTest {
     @Test
     fun numberOfPermutations() {
         assertThat(
-            Solution().numberOfPermutations(3, arrayOf(intArrayOf(2, 2), intArrayOf(0, 0))), equalTo(2)
+            Solution().numberOfPermutations(3, arrayOf(intArrayOf(2, 2), intArrayOf(0, 0))),
+            equalTo(2),
         )
     }
 
@@ -16,14 +17,15 @@ internal class SolutionTest {
     fun numberOfPermutations2() {
         assertThat(
             Solution().numberOfPermutations(3, arrayOf(intArrayOf(2, 2), intArrayOf(1, 1), intArrayOf(0, 0))),
-            equalTo(1)
+            equalTo(1),
         )
     }
 
     @Test
     fun numberOfPermutations3() {
         assertThat(
-            Solution().numberOfPermutations(2, arrayOf(intArrayOf(0, 0), intArrayOf(1, 0))), equalTo(1)
+            Solution().numberOfPermutations(2, arrayOf(intArrayOf(0, 0), intArrayOf(1, 0))),
+            equalTo(1),
         )
     }
 }
diff --git a/src/test/kotlin/g3101_3200/s3194_minimum_average_of_smallest_and_largest_elements/SolutionTest.kt b/src/test/kotlin/g3101_3200/s3194_minimum_average_of_smallest_and_largest_elements/SolutionTest.kt
index a711e97c1..52e7ed16a 100644
--- a/src/test/kotlin/g3101_3200/s3194_minimum_average_of_smallest_and_largest_elements/SolutionTest.kt
+++ b/src/test/kotlin/g3101_3200/s3194_minimum_average_of_smallest_and_largest_elements/SolutionTest.kt
@@ -8,7 +8,8 @@ internal class SolutionTest {
     @Test
     fun minimumAverage() {
         assertThat(
-            Solution().minimumAverage(intArrayOf(7, 8, 3, 4, 15, 13, 4, 1)), equalTo(5.5)
+            Solution().minimumAverage(intArrayOf(7, 8, 3, 4, 15, 13, 4, 1)),
+            equalTo(5.5),
         )
     }
 
diff --git a/src/test/kotlin/g3101_3200/s3195_find_the_minimum_area_to_cover_all_ones_i/SolutionTest.kt b/src/test/kotlin/g3101_3200/s3195_find_the_minimum_area_to_cover_all_ones_i/SolutionTest.kt
index 3480937b4..996569791 100644
--- a/src/test/kotlin/g3101_3200/s3195_find_the_minimum_area_to_cover_all_ones_i/SolutionTest.kt
+++ b/src/test/kotlin/g3101_3200/s3195_find_the_minimum_area_to_cover_all_ones_i/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun minimumArea() {
         assertThat(
             Solution().minimumArea(arrayOf(intArrayOf(0, 1, 0), intArrayOf(1, 0, 1))),
-            equalTo(6)
+            equalTo(6),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun minimumArea2() {
         assertThat(
             Solution().minimumArea(arrayOf(intArrayOf(1, 0), intArrayOf(0, 0))),
-            equalTo(1)
+            equalTo(1),
         )
     }
 }
diff --git a/src/test/kotlin/g3101_3200/s3197_find_the_minimum_area_to_cover_all_ones_ii/SolutionTest.kt b/src/test/kotlin/g3101_3200/s3197_find_the_minimum_area_to_cover_all_ones_ii/SolutionTest.kt
index e0bf08693..48275af16 100644
--- a/src/test/kotlin/g3101_3200/s3197_find_the_minimum_area_to_cover_all_ones_ii/SolutionTest.kt
+++ b/src/test/kotlin/g3101_3200/s3197_find_the_minimum_area_to_cover_all_ones_ii/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun minimumSum() {
         assertThat(
             Solution().minimumSum(arrayOf(intArrayOf(1, 0, 1), intArrayOf(1, 1, 1))),
-            equalTo(5)
+            equalTo(5),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun minimumSum2() {
         assertThat(
             Solution().minimumSum(arrayOf(intArrayOf(1, 0, 1, 0), intArrayOf(0, 1, 0, 1))),
-            equalTo(5)
+            equalTo(5),
         )
     }
 }
diff --git a/src/test/kotlin/g3201_3300/s3203_find_minimum_diameter_after_merging_two_trees/SolutionTest.kt b/src/test/kotlin/g3201_3300/s3203_find_minimum_diameter_after_merging_two_trees/SolutionTest.kt
index 509563fe2..9387c8129 100644
--- a/src/test/kotlin/g3201_3300/s3203_find_minimum_diameter_after_merging_two_trees/SolutionTest.kt
+++ b/src/test/kotlin/g3201_3300/s3203_find_minimum_diameter_after_merging_two_trees/SolutionTest.kt
@@ -10,9 +10,10 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .minimumDiameterAfterMerge(
-                    arrayOf(intArrayOf(0, 1), intArrayOf(0, 2), intArrayOf(0, 3)), arrayOf(intArrayOf(0, 1))
+                    arrayOf(intArrayOf(0, 1), intArrayOf(0, 2), intArrayOf(0, 3)),
+                    arrayOf(intArrayOf(0, 1)),
                 ),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
@@ -28,7 +29,7 @@ internal class SolutionTest {
                         intArrayOf(2, 4),
                         intArrayOf(2, 5),
                         intArrayOf(3, 6),
-                        intArrayOf(2, 7)
+                        intArrayOf(2, 7),
                     ),
                     arrayOf(
                         intArrayOf(0, 1),
@@ -37,10 +38,10 @@ internal class SolutionTest {
                         intArrayOf(2, 4),
                         intArrayOf(2, 5),
                         intArrayOf(3, 6),
-                        intArrayOf(2, 7)
-                    )
+                        intArrayOf(2, 7),
+                    ),
                 ),
-            equalTo(5)
+            equalTo(5),
         )
     }
 }
diff --git a/src/test/kotlin/g3201_3300/s3206_alternating_groups_i/SolutionTest.kt b/src/test/kotlin/g3201_3300/s3206_alternating_groups_i/SolutionTest.kt
index 051e0635d..132d62a6f 100644
--- a/src/test/kotlin/g3201_3300/s3206_alternating_groups_i/SolutionTest.kt
+++ b/src/test/kotlin/g3201_3300/s3206_alternating_groups_i/SolutionTest.kt
@@ -14,7 +14,7 @@ internal class SolutionTest {
     fun numberOfAlternatingGroups2() {
         assertThat(
             Solution().numberOfAlternatingGroups(intArrayOf(0, 1, 0, 0, 1)),
-            equalTo(3)
+            equalTo(3),
         )
     }
 }
diff --git a/src/test/kotlin/g3201_3300/s3208_alternating_groups_ii/SolutionTest.kt b/src/test/kotlin/g3201_3300/s3208_alternating_groups_ii/SolutionTest.kt
index 327671b1f..b9e50b8e3 100644
--- a/src/test/kotlin/g3201_3300/s3208_alternating_groups_ii/SolutionTest.kt
+++ b/src/test/kotlin/g3201_3300/s3208_alternating_groups_ii/SolutionTest.kt
@@ -8,7 +8,8 @@ internal class SolutionTest {
     @Test
     fun numberOfAlternatingGroups() {
         assertThat(
-            Solution().numberOfAlternatingGroups(intArrayOf(0, 1, 0, 1, 0), 3), equalTo(3)
+            Solution().numberOfAlternatingGroups(intArrayOf(0, 1, 0, 1, 0), 3),
+            equalTo(3),
         )
     }
 
@@ -16,7 +17,7 @@ internal class SolutionTest {
     fun numberOfAlternatingGroups2() {
         assertThat(
             Solution().numberOfAlternatingGroups(intArrayOf(0, 1, 0, 0, 1, 0, 1), 6),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -24,7 +25,7 @@ internal class SolutionTest {
     fun numberOfAlternatingGroups3() {
         assertThat(
             Solution().numberOfAlternatingGroups(intArrayOf(1, 1, 0, 1), 4),
-            equalTo(0)
+            equalTo(0),
         )
     }
 }
diff --git a/src/test/kotlin/g3201_3300/s3211_generate_binary_strings_without_adjacent_zeros/SolutionTest.kt b/src/test/kotlin/g3201_3300/s3211_generate_binary_strings_without_adjacent_zeros/SolutionTest.kt
index c9e3f6ded..02bc72515 100644
--- a/src/test/kotlin/g3201_3300/s3211_generate_binary_strings_without_adjacent_zeros/SolutionTest.kt
+++ b/src/test/kotlin/g3201_3300/s3211_generate_binary_strings_without_adjacent_zeros/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun validStrings() {
         assertThat(
             Solution().validStrings(3),
-            equalTo(listOf("111", "110", "101", "011", "010"))
+            equalTo(listOf("111", "110", "101", "011", "010")),
         )
     }
 
diff --git a/src/test/kotlin/g3201_3300/s3212_count_submatrices_with_equal_frequency_of_x_and_y/SolutionTest.kt b/src/test/kotlin/g3201_3300/s3212_count_submatrices_with_equal_frequency_of_x_and_y/SolutionTest.kt
index 4f70810ac..d9b6cb7a2 100644
--- a/src/test/kotlin/g3201_3300/s3212_count_submatrices_with_equal_frequency_of_x_and_y/SolutionTest.kt
+++ b/src/test/kotlin/g3201_3300/s3212_count_submatrices_with_equal_frequency_of_x_and_y/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun numberOfSubmatrices() {
         assertThat(
             Solution().numberOfSubmatrices(arrayOf(charArrayOf('X', 'Y', '.'), charArrayOf('Y', '.', '.'))),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun numberOfSubmatrices2() {
         assertThat(
             Solution().numberOfSubmatrices(arrayOf(charArrayOf('X', 'X'), charArrayOf('X', 'Y'))),
-            equalTo(0)
+            equalTo(0),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun numberOfSubmatrices3() {
         assertThat(
             Solution().numberOfSubmatrices(arrayOf(charArrayOf('.', '.'), charArrayOf('.', '.'))),
-            equalTo(0)
+            equalTo(0),
         )
     }
 }
diff --git a/src/test/kotlin/g3201_3300/s3213_construct_string_with_minimum_cost/SolutionTest.kt b/src/test/kotlin/g3201_3300/s3213_construct_string_with_minimum_cost/SolutionTest.kt
index 8118aa527..a78ce402e 100644
--- a/src/test/kotlin/g3201_3300/s3213_construct_string_with_minimum_cost/SolutionTest.kt
+++ b/src/test/kotlin/g3201_3300/s3213_construct_string_with_minimum_cost/SolutionTest.kt
@@ -12,9 +12,9 @@ internal class SolutionTest {
                 .minimumCost(
                     "abcdef",
                     arrayOf("abdef", "abc", "d", "def", "ef"),
-                    intArrayOf(100, 1, 1, 10, 5)
+                    intArrayOf(100, 1, 1, 10, 5),
                 ),
-            equalTo(7)
+            equalTo(7),
         )
     }
 
@@ -23,9 +23,11 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .minimumCost(
-                    "aaaa", arrayOf("z", "zz", "zzz"), intArrayOf(1, 10, 100)
+                    "aaaa",
+                    arrayOf("z", "zz", "zzz"),
+                    intArrayOf(1, 10, 100),
                 ),
-            equalTo(-1)
+            equalTo(-1),
         )
     }
 }
diff --git a/src/test/kotlin/g3201_3300/s3217_delete_nodes_from_linked_list_present_in_array/SolutionTest.kt b/src/test/kotlin/g3201_3300/s3217_delete_nodes_from_linked_list_present_in_array/SolutionTest.kt
index c7d66f802..c605c57b2 100644
--- a/src/test/kotlin/g3201_3300/s3217_delete_nodes_from_linked_list_present_in_array/SolutionTest.kt
+++ b/src/test/kotlin/g3201_3300/s3217_delete_nodes_from_linked_list_present_in_array/SolutionTest.kt
@@ -12,10 +12,10 @@ internal class SolutionTest {
             Solution()
                 .modifiedList(
                     intArrayOf(1, 2, 3),
-                    contructLinkedList(intArrayOf(1, 2, 3, 4, 5))
+                    contructLinkedList(intArrayOf(1, 2, 3, 4, 5)),
                 )
                 .toString(),
-            equalTo("4, 5")
+            equalTo("4, 5"),
         )
     }
 
@@ -25,10 +25,10 @@ internal class SolutionTest {
             Solution()
                 .modifiedList(
                     intArrayOf(1),
-                    contructLinkedList(intArrayOf(1, 2, 1, 2, 1, 2))
+                    contructLinkedList(intArrayOf(1, 2, 1, 2, 1, 2)),
                 )
                 .toString(),
-            equalTo("2, 2, 2")
+            equalTo("2, 2, 2"),
         )
     }
 
@@ -38,10 +38,10 @@ internal class SolutionTest {
             Solution()
                 .modifiedList(
                     intArrayOf(5),
-                    contructLinkedList(intArrayOf(1, 2, 3, 4))
+                    contructLinkedList(intArrayOf(1, 2, 3, 4)),
                 )
                 .toString(),
-            equalTo("1, 2, 3, 4")
+            equalTo("1, 2, 3, 4"),
         )
     }
 }
diff --git a/src/test/kotlin/g3201_3300/s3218_minimum_cost_for_cutting_cake_i/SolutionTest.kt b/src/test/kotlin/g3201_3300/s3218_minimum_cost_for_cutting_cake_i/SolutionTest.kt
index a341dbaa9..87b7ad2c3 100644
--- a/src/test/kotlin/g3201_3300/s3218_minimum_cost_for_cutting_cake_i/SolutionTest.kt
+++ b/src/test/kotlin/g3201_3300/s3218_minimum_cost_for_cutting_cake_i/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun minimumCost() {
         assertThat(
             Solution().minimumCost(3, 2, intArrayOf(1, 3), intArrayOf(5)),
-            equalTo(13)
+            equalTo(13),
         )
     }
 
diff --git a/src/test/kotlin/g3201_3300/s3219_minimum_cost_for_cutting_cake_ii/SolutionTest.kt b/src/test/kotlin/g3201_3300/s3219_minimum_cost_for_cutting_cake_ii/SolutionTest.kt
index 8d6a3854c..0b136b2c2 100644
--- a/src/test/kotlin/g3201_3300/s3219_minimum_cost_for_cutting_cake_ii/SolutionTest.kt
+++ b/src/test/kotlin/g3201_3300/s3219_minimum_cost_for_cutting_cake_ii/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun minimumCost() {
         assertThat(
             Solution().minimumCost(3, 2, intArrayOf(1, 3), intArrayOf(5)),
-            equalTo(13L)
+            equalTo(13L),
         )
     }
 
diff --git a/src/test/kotlin/g3201_3300/s3220_odd_and_even_transactions/MysqlTest.kt b/src/test/kotlin/g3201_3300/s3220_odd_and_even_transactions/MysqlTest.kt
index 3314d6bfe..db774b823 100644
--- a/src/test/kotlin/g3201_3300/s3220_odd_and_even_transactions/MysqlTest.kt
+++ b/src/test/kotlin/g3201_3300/s3220_odd_and_even_transactions/MysqlTest.kt
@@ -31,8 +31,8 @@ import javax.sql.DataSource
                 " VALUES (5, 50, '2024-07-02'); " +
                 "INSERT INTO transactions(transaction_id, amount, transaction_date)" +
                 " VALUES (6, 120, '2024-07-03'); "
-            )
-    ]
+            ),
+    ],
 )
 internal class MysqlTest {
     @Test
@@ -44,31 +44,31 @@ internal class MysqlTest {
                     BufferedReader(
                         FileReader(
                             "src/main/kotlin/g3201_3300/" +
-                                "s3220_odd_and_even_transactions/script.sql"
-                        )
+                                "s3220_odd_and_even_transactions/script.sql",
+                        ),
                     )
                         .lines()
                         .collect(Collectors.joining("\n"))
-                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace("#.*?\\r?\\n".toRegex(), ""),
                 ).use { resultSet ->
                     assertThat<Boolean>(resultSet.next(), equalTo<Boolean>(true))
                     assertThat<String>(
                         resultSet.getNString(1),
-                        equalTo<String>("2024-07-01")
+                        equalTo<String>("2024-07-01"),
                     )
                     assertThat<String>(resultSet.getNString(2), equalTo<String>("75"))
                     assertThat<String>(resultSet.getNString(3), equalTo<String>("350"))
                     assertThat<Boolean>(resultSet.next(), equalTo<Boolean>(true))
                     assertThat<String>(
                         resultSet.getNString(1),
-                        equalTo<String>("2024-07-02")
+                        equalTo<String>("2024-07-02"),
                     )
                     assertThat<String>(resultSet.getNString(2), equalTo<String>("0"))
                     assertThat<String>(resultSet.getNString(3), equalTo<String>("350"))
                     assertThat<Boolean>(resultSet.next(), equalTo<Boolean>(true))
                     assertThat<String>(
                         resultSet.getNString(1),
-                        equalTo<String>("2024-07-03")
+                        equalTo<String>("2024-07-03"),
                     )
                     assertThat<String>(resultSet.getNString(2), equalTo<String>("0"))
                     assertThat<String>(resultSet.getNString(3), equalTo<String>("120"))
diff --git a/src/test/kotlin/g3201_3300/s3225_maximum_score_from_grid_operations/SolutionTest.kt b/src/test/kotlin/g3201_3300/s3225_maximum_score_from_grid_operations/SolutionTest.kt
index f9801d2ef..589e6307d 100644
--- a/src/test/kotlin/g3201_3300/s3225_maximum_score_from_grid_operations/SolutionTest.kt
+++ b/src/test/kotlin/g3201_3300/s3225_maximum_score_from_grid_operations/SolutionTest.kt
@@ -15,10 +15,10 @@ internal class SolutionTest {
                         intArrayOf(0, 0, 3, 0, 0),
                         intArrayOf(0, 1, 0, 0, 0),
                         intArrayOf(5, 0, 0, 3, 0),
-                        intArrayOf(0, 0, 0, 0, 2)
-                    )
+                        intArrayOf(0, 0, 0, 0, 2),
+                    ),
                 ),
-            equalTo(11L)
+            equalTo(11L),
         )
     }
 
@@ -32,10 +32,10 @@ internal class SolutionTest {
                         intArrayOf(7, 1, 0, 8, 0),
                         intArrayOf(5, 20, 0, 11, 0),
                         intArrayOf(0, 0, 0, 1, 2),
-                        intArrayOf(8, 12, 1, 10, 3)
-                    )
+                        intArrayOf(8, 12, 1, 10, 3),
+                    ),
                 ),
-            equalTo(94L)
+            equalTo(94L),
         )
     }
 }
diff --git a/src/test/kotlin/g3201_3300/s3229_minimum_operations_to_make_array_equal_to_target/SolutionTest.kt b/src/test/kotlin/g3201_3300/s3229_minimum_operations_to_make_array_equal_to_target/SolutionTest.kt
index 588d7f4cf..ede8c241f 100644
--- a/src/test/kotlin/g3201_3300/s3229_minimum_operations_to_make_array_equal_to_target/SolutionTest.kt
+++ b/src/test/kotlin/g3201_3300/s3229_minimum_operations_to_make_array_equal_to_target/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun minimumOperations() {
         assertThat(
             Solution().minimumOperations(intArrayOf(3, 5, 1, 2), intArrayOf(4, 6, 2, 4)),
-            equalTo(2L)
+            equalTo(2L),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun minimumOperations2() {
         assertThat(
             Solution().minimumOperations(intArrayOf(1, 3, 2), intArrayOf(2, 1, 4)),
-            equalTo(5L)
+            equalTo(5L),
         )
     }
 }
diff --git a/src/test/kotlin/g3201_3300/s3235_check_if_the_rectangle_corner_is_reachable/SolutionTest.kt b/src/test/kotlin/g3201_3300/s3235_check_if_the_rectangle_corner_is_reachable/SolutionTest.kt
index f44a63874..a6b1f0e1f 100644
--- a/src/test/kotlin/g3201_3300/s3235_check_if_the_rectangle_corner_is_reachable/SolutionTest.kt
+++ b/src/test/kotlin/g3201_3300/s3235_check_if_the_rectangle_corner_is_reachable/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun canReachCorner() {
         assertThat(
             Solution().canReachCorner(3, 4, arrayOf(intArrayOf(2, 1, 1))),
-            equalTo(true)
+            equalTo(true),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun canReachCorner2() {
         assertThat(
             Solution().canReachCorner(3, 3, arrayOf(intArrayOf(1, 1, 2))),
-            equalTo(false)
+            equalTo(false),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun canReachCorner3() {
         assertThat(
             Solution().canReachCorner(3, 3, arrayOf(intArrayOf(2, 1, 1), intArrayOf(1, 2, 1))),
-            equalTo(false)
+            equalTo(false),
         )
     }
 
@@ -33,7 +33,7 @@ internal class SolutionTest {
     fun canReachCorner4() {
         assertThat(
             Solution().canReachCorner(4, 4, arrayOf(intArrayOf(5, 5, 1))),
-            equalTo(true)
+            equalTo(true),
         )
     }
 }
diff --git a/src/test/kotlin/g3201_3300/s3238_find_the_number_of_winning_players/SolutionTest.kt b/src/test/kotlin/g3201_3300/s3238_find_the_number_of_winning_players/SolutionTest.kt
index faaea86aa..d3ad9324d 100644
--- a/src/test/kotlin/g3201_3300/s3238_find_the_number_of_winning_players/SolutionTest.kt
+++ b/src/test/kotlin/g3201_3300/s3238_find_the_number_of_winning_players/SolutionTest.kt
@@ -17,10 +17,10 @@ internal class SolutionTest {
                         intArrayOf(1, 0),
                         intArrayOf(2, 1),
                         intArrayOf(2, 1),
-                        intArrayOf(2, 0)
-                    )
+                        intArrayOf(2, 0),
+                    ),
                 ),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -29,9 +29,9 @@ internal class SolutionTest {
         assertThat(
             Solution().winningPlayerCount(
                 5,
-                arrayOf(intArrayOf(1, 1), intArrayOf(1, 2), intArrayOf(1, 3), intArrayOf(1, 4))
+                arrayOf(intArrayOf(1, 1), intArrayOf(1, 2), intArrayOf(1, 3), intArrayOf(1, 4)),
             ),
-            equalTo(0)
+            equalTo(0),
         )
     }
 
@@ -40,9 +40,9 @@ internal class SolutionTest {
         assertThat(
             Solution().winningPlayerCount(
                 5,
-                arrayOf(intArrayOf(1, 1), intArrayOf(2, 4), intArrayOf(2, 4), intArrayOf(2, 4))
+                arrayOf(intArrayOf(1, 1), intArrayOf(2, 4), intArrayOf(2, 4), intArrayOf(2, 4)),
             ),
-            equalTo(1)
+            equalTo(1),
         )
     }
 }
diff --git a/src/test/kotlin/g3201_3300/s3239_minimum_number_of_flips_to_make_binary_grid_palindromic_i/SolutionTest.kt b/src/test/kotlin/g3201_3300/s3239_minimum_number_of_flips_to_make_binary_grid_palindromic_i/SolutionTest.kt
index 7801b2408..dc8de0dfc 100644
--- a/src/test/kotlin/g3201_3300/s3239_minimum_number_of_flips_to_make_binary_grid_palindromic_i/SolutionTest.kt
+++ b/src/test/kotlin/g3201_3300/s3239_minimum_number_of_flips_to_make_binary_grid_palindromic_i/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun minFlips() {
         assertThat(
             Solution().minFlips(arrayOf(intArrayOf(1, 0, 0), intArrayOf(0, 0, 0), intArrayOf(0, 0, 1))),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun minFlips2() {
         assertThat(
             Solution().minFlips(arrayOf(intArrayOf(0, 1), intArrayOf(0, 1), intArrayOf(0, 0))),
-            equalTo(1)
+            equalTo(1),
         )
     }
 
diff --git a/src/test/kotlin/g3201_3300/s3240_minimum_number_of_flips_to_make_binary_grid_palindromic_ii/SolutionTest.kt b/src/test/kotlin/g3201_3300/s3240_minimum_number_of_flips_to_make_binary_grid_palindromic_ii/SolutionTest.kt
index 89a612d37..3d34abadb 100644
--- a/src/test/kotlin/g3201_3300/s3240_minimum_number_of_flips_to_make_binary_grid_palindromic_ii/SolutionTest.kt
+++ b/src/test/kotlin/g3201_3300/s3240_minimum_number_of_flips_to_make_binary_grid_palindromic_ii/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun minFlips() {
         assertThat(
             Solution().minFlips(arrayOf(intArrayOf(1, 0, 0), intArrayOf(0, 1, 0), intArrayOf(0, 0, 1))),
-            equalTo(3)
+            equalTo(3),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun minFlips2() {
         assertThat(
             Solution().minFlips(arrayOf(intArrayOf(0, 1), intArrayOf(0, 1), intArrayOf(0, 0))),
-            equalTo(2)
+            equalTo(2),
         )
     }
 
diff --git a/src/test/kotlin/g3201_3300/s3241_time_taken_to_mark_all_nodes/SolutionTest.kt b/src/test/kotlin/g3201_3300/s3241_time_taken_to_mark_all_nodes/SolutionTest.kt
index 44eaa9218..61ae0c7d7 100644
--- a/src/test/kotlin/g3201_3300/s3241_time_taken_to_mark_all_nodes/SolutionTest.kt
+++ b/src/test/kotlin/g3201_3300/s3241_time_taken_to_mark_all_nodes/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun timeTaken() {
         assertThat(
             Solution().timeTaken(arrayOf(intArrayOf(0, 1), intArrayOf(0, 2))),
-            equalTo(intArrayOf(2, 4, 3))
+            equalTo(intArrayOf(2, 4, 3)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun timeTaken2() {
         assertThat(
             Solution().timeTaken(arrayOf(intArrayOf(0, 1))),
-            equalTo(intArrayOf(1, 2))
+            equalTo(intArrayOf(1, 2)),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun timeTaken3() {
         assertThat(
             Solution().timeTaken(arrayOf(intArrayOf(2, 4), intArrayOf(0, 1), intArrayOf(2, 3), intArrayOf(0, 2))),
-            equalTo(intArrayOf(4, 6, 3, 5, 5))
+            equalTo(intArrayOf(4, 6, 3, 5, 5)),
         )
     }
 }
diff --git a/src/test/kotlin/g3201_3300/s3242_design_neighbor_sum_service/SolutionTest.kt b/src/test/kotlin/g3201_3300/s3242_design_neighbor_sum_service/SolutionTest.kt
index 64de4cca0..706565e84 100644
--- a/src/test/kotlin/g3201_3300/s3242_design_neighbor_sum_service/SolutionTest.kt
+++ b/src/test/kotlin/g3201_3300/s3242_design_neighbor_sum_service/SolutionTest.kt
@@ -22,8 +22,8 @@ internal class SolutionTest {
                     intArrayOf(1, 2, 0, 3),
                     intArrayOf(4, 7, 15, 6),
                     intArrayOf(8, 9, 10, 11),
-                    intArrayOf(12, 13, 14, 5)
-                )
+                    intArrayOf(12, 13, 14, 5),
+                ),
             )
         assertThat(neighborSum.adjacentSum(15), equalTo(23))
         assertThat(neighborSum.diagonalSum(9), equalTo(45))
diff --git a/src/test/kotlin/g3201_3300/s3243_shortest_distance_after_road_addition_queries_i/SolutionTest.kt b/src/test/kotlin/g3201_3300/s3243_shortest_distance_after_road_addition_queries_i/SolutionTest.kt
index 1782125fe..d37142e2f 100644
--- a/src/test/kotlin/g3201_3300/s3243_shortest_distance_after_road_addition_queries_i/SolutionTest.kt
+++ b/src/test/kotlin/g3201_3300/s3243_shortest_distance_after_road_addition_queries_i/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .shortestDistanceAfterQueries(5, arrayOf(intArrayOf(2, 4), intArrayOf(0, 2), intArrayOf(0, 4))),
-            equalTo(intArrayOf(3, 2, 1))
+            equalTo(intArrayOf(3, 2, 1)),
         )
     }
 
@@ -18,7 +18,7 @@ internal class SolutionTest {
     fun shortestDistanceAfterQueries2() {
         assertThat(
             Solution().shortestDistanceAfterQueries(4, arrayOf(intArrayOf(0, 3), intArrayOf(0, 2))),
-            equalTo(intArrayOf(1, 1))
+            equalTo(intArrayOf(1, 1)),
         )
     }
 }
diff --git a/src/test/kotlin/g3201_3300/s3244_shortest_distance_after_road_addition_queries_ii/SolutionTest.kt b/src/test/kotlin/g3201_3300/s3244_shortest_distance_after_road_addition_queries_ii/SolutionTest.kt
index 78634c940..fc5dbb3c2 100644
--- a/src/test/kotlin/g3201_3300/s3244_shortest_distance_after_road_addition_queries_ii/SolutionTest.kt
+++ b/src/test/kotlin/g3201_3300/s3244_shortest_distance_after_road_addition_queries_ii/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .shortestDistanceAfterQueries(5, arrayOf(intArrayOf(2, 4), intArrayOf(0, 2), intArrayOf(0, 4))),
-            equalTo(intArrayOf(3, 2, 1))
+            equalTo(intArrayOf(3, 2, 1)),
         )
     }
 
@@ -18,7 +18,7 @@ internal class SolutionTest {
     fun shortestDistanceAfterQueries2() {
         assertThat(
             Solution().shortestDistanceAfterQueries(4, arrayOf(intArrayOf(0, 3), intArrayOf(0, 2))),
-            equalTo(intArrayOf(1, 1))
+            equalTo(intArrayOf(1, 1)),
         )
     }
 }
diff --git a/src/test/kotlin/g3201_3300/s3245_alternating_groups_iii/SolutionTest.kt b/src/test/kotlin/g3201_3300/s3245_alternating_groups_iii/SolutionTest.kt
index d8352d3ec..2518012fb 100644
--- a/src/test/kotlin/g3201_3300/s3245_alternating_groups_iii/SolutionTest.kt
+++ b/src/test/kotlin/g3201_3300/s3245_alternating_groups_iii/SolutionTest.kt
@@ -10,9 +10,10 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .numberOfAlternatingGroups(
-                    intArrayOf(0, 1, 1, 0, 1), arrayOf(intArrayOf(2, 1, 0), intArrayOf(1, 4))
+                    intArrayOf(0, 1, 1, 0, 1),
+                    arrayOf(intArrayOf(2, 1, 0), intArrayOf(1, 4)),
                 ),
-            equalTo(listOf(2))
+            equalTo(listOf(2)),
         )
     }
 
@@ -22,9 +23,9 @@ internal class SolutionTest {
             Solution()
                 .numberOfAlternatingGroups(
                     intArrayOf(0, 0, 1, 0, 1, 1),
-                    arrayOf(intArrayOf(1, 3), intArrayOf(2, 3, 0), intArrayOf(1, 5))
+                    arrayOf(intArrayOf(1, 3), intArrayOf(2, 3, 0), intArrayOf(1, 5)),
                 ),
-            equalTo(listOf(2, 0))
+            equalTo(listOf(2, 0)),
         )
     }
 }
diff --git a/src/test/kotlin/g3201_3300/s3248_snake_in_matrix/SolutionTest.kt b/src/test/kotlin/g3201_3300/s3248_snake_in_matrix/SolutionTest.kt
index 3523313d4..780e87b0d 100644
--- a/src/test/kotlin/g3201_3300/s3248_snake_in_matrix/SolutionTest.kt
+++ b/src/test/kotlin/g3201_3300/s3248_snake_in_matrix/SolutionTest.kt
@@ -14,7 +14,8 @@ internal class SolutionTest {
     @Test
     fun finalPositionOfSnake2() {
         assertThat(
-            Solution().finalPositionOfSnake(3, listOf("DOWN", "RIGHT", "UP")), equalTo(1)
+            Solution().finalPositionOfSnake(3, listOf("DOWN", "RIGHT", "UP")),
+            equalTo(1),
         )
     }
 
diff --git a/src/test/kotlin/g3201_3300/s3249_count_the_number_of_good_nodes/SolutionTest.kt b/src/test/kotlin/g3201_3300/s3249_count_the_number_of_good_nodes/SolutionTest.kt
index c035a7bf9..b436dd1c6 100644
--- a/src/test/kotlin/g3201_3300/s3249_count_the_number_of_good_nodes/SolutionTest.kt
+++ b/src/test/kotlin/g3201_3300/s3249_count_the_number_of_good_nodes/SolutionTest.kt
@@ -16,10 +16,10 @@ internal class SolutionTest {
                         intArrayOf(1, 3),
                         intArrayOf(1, 4),
                         intArrayOf(2, 5),
-                        intArrayOf(2, 6)
-                    )
+                        intArrayOf(2, 6),
+                    ),
                 ),
-            equalTo(7)
+            equalTo(7),
         )
     }
 
@@ -36,10 +36,10 @@ internal class SolutionTest {
                         intArrayOf(0, 5),
                         intArrayOf(1, 6),
                         intArrayOf(2, 7),
-                        intArrayOf(3, 8)
-                    )
+                        intArrayOf(3, 8),
+                    ),
                 ),
-            equalTo(6)
+            equalTo(6),
         )
     }
 }
diff --git a/src/test/kotlin/g3201_3300/s3254_find_the_power_of_k_size_subarrays_i/SolutionTest.kt b/src/test/kotlin/g3201_3300/s3254_find_the_power_of_k_size_subarrays_i/SolutionTest.kt
index f9853c153..e678011d3 100644
--- a/src/test/kotlin/g3201_3300/s3254_find_the_power_of_k_size_subarrays_i/SolutionTest.kt
+++ b/src/test/kotlin/g3201_3300/s3254_find_the_power_of_k_size_subarrays_i/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun resultsArray() {
         assertThat(
             Solution().resultsArray(intArrayOf(1, 2, 3, 4, 3, 2, 5), 3),
-            equalTo(intArrayOf(3, 4, -1, -1, -1))
+            equalTo(intArrayOf(3, 4, -1, -1, -1)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun resultsArray2() {
         assertThat(
             Solution().resultsArray(intArrayOf(2, 2, 2, 2, 2), 4),
-            equalTo(intArrayOf(-1, -1))
+            equalTo(intArrayOf(-1, -1)),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun resultsArray3() {
         assertThat(
             Solution().resultsArray(intArrayOf(3, 2, 3, 2, 3, 2), 2),
-            equalTo(intArrayOf(-1, 3, -1, 3, -1))
+            equalTo(intArrayOf(-1, 3, -1, 3, -1)),
         )
     }
 }
diff --git a/src/test/kotlin/g3201_3300/s3255_find_the_power_of_k_size_subarrays_ii/SolutionTest.kt b/src/test/kotlin/g3201_3300/s3255_find_the_power_of_k_size_subarrays_ii/SolutionTest.kt
index 06c34ad4c..aca53faa2 100644
--- a/src/test/kotlin/g3201_3300/s3255_find_the_power_of_k_size_subarrays_ii/SolutionTest.kt
+++ b/src/test/kotlin/g3201_3300/s3255_find_the_power_of_k_size_subarrays_ii/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun resultsArray() {
         assertThat(
             Solution().resultsArray(intArrayOf(1, 2, 3, 4, 3, 2, 5), 3),
-            equalTo(intArrayOf(3, 4, -1, -1, -1))
+            equalTo(intArrayOf(3, 4, -1, -1, -1)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun resultsArray2() {
         assertThat(
             Solution().resultsArray(intArrayOf(2, 2, 2, 2, 2), 4),
-            equalTo(intArrayOf(-1, -1))
+            equalTo(intArrayOf(-1, -1)),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun resultsArray3() {
         assertThat(
             Solution().resultsArray(intArrayOf(3, 2, 3, 2, 3, 2), 2),
-            equalTo(intArrayOf(-1, 3, -1, 3, -1))
+            equalTo(intArrayOf(-1, 3, -1, 3, -1)),
         )
     }
 
diff --git a/src/test/kotlin/g3201_3300/s3256_maximum_value_sum_by_placing_three_rooks_i/SolutionTest.kt b/src/test/kotlin/g3201_3300/s3256_maximum_value_sum_by_placing_three_rooks_i/SolutionTest.kt
index caf2ad0b0..b6d34188d 100644
--- a/src/test/kotlin/g3201_3300/s3256_maximum_value_sum_by_placing_three_rooks_i/SolutionTest.kt
+++ b/src/test/kotlin/g3201_3300/s3256_maximum_value_sum_by_placing_three_rooks_i/SolutionTest.kt
@@ -10,9 +10,9 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .maximumValueSum(
-                    arrayOf(intArrayOf(-3, 1, 1, 1), intArrayOf(-3, 1, -3, 1), intArrayOf(-3, 2, 1, 1))
+                    arrayOf(intArrayOf(-3, 1, 1, 1), intArrayOf(-3, 1, -3, 1), intArrayOf(-3, 2, 1, 1)),
                 ),
-            equalTo(4L)
+            equalTo(4L),
         )
     }
 
@@ -20,7 +20,7 @@ internal class SolutionTest {
     fun maximumValueSum2() {
         assertThat(
             Solution().maximumValueSum(arrayOf(intArrayOf(1, 2, 3), intArrayOf(4, 5, 6), intArrayOf(7, 8, 9))),
-            equalTo(15L)
+            equalTo(15L),
         )
     }
 
@@ -28,7 +28,7 @@ internal class SolutionTest {
     fun maximumValueSum3() {
         assertThat(
             Solution().maximumValueSum(arrayOf(intArrayOf(1, 1, 1), intArrayOf(1, 1, 1), intArrayOf(1, 1, 1))),
-            equalTo(3L)
+            equalTo(3L),
         )
     }
 }
diff --git a/src/test/kotlin/g3201_3300/s3257_maximum_value_sum_by_placing_three_rooks_ii/SolutionTest.kt b/src/test/kotlin/g3201_3300/s3257_maximum_value_sum_by_placing_three_rooks_ii/SolutionTest.kt
index 3c6200253..480ca4cf2 100644
--- a/src/test/kotlin/g3201_3300/s3257_maximum_value_sum_by_placing_three_rooks_ii/SolutionTest.kt
+++ b/src/test/kotlin/g3201_3300/s3257_maximum_value_sum_by_placing_three_rooks_ii/SolutionTest.kt
@@ -10,9 +10,9 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .maximumValueSum(
-                    arrayOf(intArrayOf(-3, 1, 1, 1), intArrayOf(-3, 1, -3, 1), intArrayOf(-3, 2, 1, 1))
+                    arrayOf(intArrayOf(-3, 1, 1, 1), intArrayOf(-3, 1, -3, 1), intArrayOf(-3, 2, 1, 1)),
                 ),
-            equalTo(4L)
+            equalTo(4L),
         )
     }
 
@@ -20,7 +20,7 @@ internal class SolutionTest {
     fun maximumValueSum2() {
         assertThat(
             Solution().maximumValueSum(arrayOf(intArrayOf(1, 2, 3), intArrayOf(4, 5, 6), intArrayOf(7, 8, 9))),
-            equalTo(15L)
+            equalTo(15L),
         )
     }
 
@@ -28,7 +28,7 @@ internal class SolutionTest {
     fun maximumValueSum3() {
         assertThat(
             Solution().maximumValueSum(arrayOf(intArrayOf(1, 1, 1), intArrayOf(1, 1, 1), intArrayOf(1, 1, 1))),
-            equalTo(3L)
+            equalTo(3L),
         )
     }
 }
diff --git a/src/test/kotlin/g3201_3300/s3259_maximum_energy_boost_from_two_drinks/SolutionTest.kt b/src/test/kotlin/g3201_3300/s3259_maximum_energy_boost_from_two_drinks/SolutionTest.kt
index 52e56739b..9f035bde0 100644
--- a/src/test/kotlin/g3201_3300/s3259_maximum_energy_boost_from_two_drinks/SolutionTest.kt
+++ b/src/test/kotlin/g3201_3300/s3259_maximum_energy_boost_from_two_drinks/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun maxEnergyBoost() {
         assertThat(
             Solution().maxEnergyBoost(intArrayOf(1, 3, 1), intArrayOf(3, 1, 1)),
-            equalTo(5L)
+            equalTo(5L),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun maxEnergyBoost2() {
         assertThat(
             Solution().maxEnergyBoost(intArrayOf(4, 1, 1), intArrayOf(1, 1, 3)),
-            equalTo(7L)
+            equalTo(7L),
         )
     }
 }
diff --git a/src/test/kotlin/g3201_3300/s3261_count_substrings_that_satisfy_k_constraint_ii/SolutionTest.kt b/src/test/kotlin/g3201_3300/s3261_count_substrings_that_satisfy_k_constraint_ii/SolutionTest.kt
index b9182b1c7..c17914ecf 100644
--- a/src/test/kotlin/g3201_3300/s3261_count_substrings_that_satisfy_k_constraint_ii/SolutionTest.kt
+++ b/src/test/kotlin/g3201_3300/s3261_count_substrings_that_satisfy_k_constraint_ii/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun countKConstraintSubstrings() {
         assertThat(
             Solution().countKConstraintSubstrings("0001111", 2, arrayOf(intArrayOf(0, 6))),
-            equalTo(longArrayOf(26))
+            equalTo(longArrayOf(26)),
         )
     }
 
@@ -18,9 +18,11 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .countKConstraintSubstrings(
-                    "010101", 1, arrayOf(intArrayOf(0, 5), intArrayOf(1, 4), intArrayOf(2, 3))
+                    "010101",
+                    1,
+                    arrayOf(intArrayOf(0, 5), intArrayOf(1, 4), intArrayOf(2, 3)),
                 ),
-            equalTo(longArrayOf(15, 9, 3))
+            equalTo(longArrayOf(15, 9, 3)),
         )
     }
 }
diff --git a/src/test/kotlin/g3201_3300/s3264_final_array_state_after_k_multiplication_operations_i/SolutionTest.kt b/src/test/kotlin/g3201_3300/s3264_final_array_state_after_k_multiplication_operations_i/SolutionTest.kt
index 77d0a10bf..f3a18d140 100644
--- a/src/test/kotlin/g3201_3300/s3264_final_array_state_after_k_multiplication_operations_i/SolutionTest.kt
+++ b/src/test/kotlin/g3201_3300/s3264_final_array_state_after_k_multiplication_operations_i/SolutionTest.kt
@@ -9,14 +9,15 @@ internal class SolutionTest {
     fun finalState() {
         assertThat(
             Solution().getFinalState(intArrayOf(2, 1, 3, 5, 6), 5, 2),
-            equalTo(intArrayOf(8, 4, 6, 5, 6))
+            equalTo(intArrayOf(8, 4, 6, 5, 6)),
         )
     }
 
     @Test
     fun finalState2() {
         assertThat(
-            Solution().getFinalState(intArrayOf(1, 2), 3, 4), equalTo(intArrayOf(16, 8))
+            Solution().getFinalState(intArrayOf(1, 2), 3, 4),
+            equalTo(intArrayOf(16, 8)),
         )
     }
 }
diff --git a/src/test/kotlin/g3201_3300/s3266_final_array_state_after_k_multiplication_operations_ii/SolutionTest.kt b/src/test/kotlin/g3201_3300/s3266_final_array_state_after_k_multiplication_operations_ii/SolutionTest.kt
index 201101a64..1226ab073 100644
--- a/src/test/kotlin/g3201_3300/s3266_final_array_state_after_k_multiplication_operations_ii/SolutionTest.kt
+++ b/src/test/kotlin/g3201_3300/s3266_final_array_state_after_k_multiplication_operations_ii/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun finalState() {
         assertThat(
             Solution().getFinalState(intArrayOf(2, 1, 3, 5, 6), 5, 2),
-            equalTo(intArrayOf(8, 4, 6, 5, 6))
+            equalTo(intArrayOf(8, 4, 6, 5, 6)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun finalState2() {
         assertThat(
             Solution().getFinalState(intArrayOf(100000, 2000), 2, 1000000),
-            equalTo(intArrayOf(999999307, 999999993))
+            equalTo(intArrayOf(999999307, 999999993)),
         )
     }
 }
diff --git a/src/test/kotlin/g3201_3300/s3273_minimum_amount_of_damage_dealt_to_bob/SolutionTest.kt b/src/test/kotlin/g3201_3300/s3273_minimum_amount_of_damage_dealt_to_bob/SolutionTest.kt
index 568964cc8..f3a67dc84 100644
--- a/src/test/kotlin/g3201_3300/s3273_minimum_amount_of_damage_dealt_to_bob/SolutionTest.kt
+++ b/src/test/kotlin/g3201_3300/s3273_minimum_amount_of_damage_dealt_to_bob/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun minDamage() {
         assertThat(
             Solution().minDamage(4, intArrayOf(1, 2, 3, 4), intArrayOf(4, 5, 6, 8)),
-            equalTo(39L)
+            equalTo(39L),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun minDamage2() {
         assertThat(
             Solution().minDamage(1, intArrayOf(1, 1, 1, 1), intArrayOf(1, 2, 3, 4)),
-            equalTo(20L)
+            equalTo(20L),
         )
     }
 
diff --git a/src/test/kotlin/g3201_3300/s3275_k_th_nearest_obstacle_queries/SolutionTest.kt b/src/test/kotlin/g3201_3300/s3275_k_th_nearest_obstacle_queries/SolutionTest.kt
index b1d482ebb..80456af37 100644
--- a/src/test/kotlin/g3201_3300/s3275_k_th_nearest_obstacle_queries/SolutionTest.kt
+++ b/src/test/kotlin/g3201_3300/s3275_k_th_nearest_obstacle_queries/SolutionTest.kt
@@ -10,9 +10,9 @@ internal class SolutionTest {
         assertThat(
             Solution().resultsArray(
                 arrayOf(intArrayOf(1, 2), intArrayOf(3, 4), intArrayOf(2, 3), intArrayOf(-3, 0)),
-                2
+                2,
             ),
-            equalTo(intArrayOf(-1, 7, 5, 3))
+            equalTo(intArrayOf(-1, 7, 5, 3)),
         )
     }
 
@@ -20,7 +20,7 @@ internal class SolutionTest {
     fun resultsArray2() {
         assertThat(
             Solution().resultsArray(arrayOf(intArrayOf(5, 5), intArrayOf(4, 4), intArrayOf(3, 3)), 1),
-            equalTo(intArrayOf(10, 8, 6))
+            equalTo(intArrayOf(10, 8, 6)),
         )
     }
 }
diff --git a/src/test/kotlin/g3201_3300/s3276_select_cells_in_grid_with_maximum_score/SolutionTest.kt b/src/test/kotlin/g3201_3300/s3276_select_cells_in_grid_with_maximum_score/SolutionTest.kt
index cec38b8e4..a2cfe4338 100644
--- a/src/test/kotlin/g3201_3300/s3276_select_cells_in_grid_with_maximum_score/SolutionTest.kt
+++ b/src/test/kotlin/g3201_3300/s3276_select_cells_in_grid_with_maximum_score/SolutionTest.kt
@@ -11,9 +11,9 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .maxScore(
-                    getLists(arrayOf(intArrayOf(1, 2, 3), intArrayOf(4, 3, 2), intArrayOf(1, 1, 1)))
+                    getLists(arrayOf(intArrayOf(1, 2, 3), intArrayOf(4, 3, 2), intArrayOf(1, 1, 1))),
                 ),
-            equalTo(8)
+            equalTo(8),
         )
     }
 
@@ -21,7 +21,7 @@ internal class SolutionTest {
     fun maxScore2() {
         assertThat(
             Solution().maxScore(getLists(arrayOf(intArrayOf(8, 7, 6), intArrayOf(8, 3, 2)))),
-            equalTo(15)
+            equalTo(15),
         )
     }
 }
diff --git a/src/test/kotlin/g3201_3300/s3277_maximum_xor_score_subarray_queries/SolutionTest.kt b/src/test/kotlin/g3201_3300/s3277_maximum_xor_score_subarray_queries/SolutionTest.kt
index f6b59c4fc..d2b1ccfd2 100644
--- a/src/test/kotlin/g3201_3300/s3277_maximum_xor_score_subarray_queries/SolutionTest.kt
+++ b/src/test/kotlin/g3201_3300/s3277_maximum_xor_score_subarray_queries/SolutionTest.kt
@@ -11,9 +11,9 @@ internal class SolutionTest {
             Solution()
                 .maximumSubarrayXor(
                     intArrayOf(2, 8, 4, 32, 16, 1),
-                    arrayOf(intArrayOf(0, 2), intArrayOf(1, 4), intArrayOf(0, 5))
+                    arrayOf(intArrayOf(0, 2), intArrayOf(1, 4), intArrayOf(0, 5)),
                 ),
-            equalTo(intArrayOf(12, 60, 60))
+            equalTo(intArrayOf(12, 60, 60)),
         )
     }
 
@@ -23,9 +23,9 @@ internal class SolutionTest {
             Solution()
                 .maximumSubarrayXor(
                     intArrayOf(0, 7, 3, 2, 8, 5, 1),
-                    arrayOf(intArrayOf(0, 3), intArrayOf(1, 5), intArrayOf(2, 4), intArrayOf(2, 6), intArrayOf(5, 6))
+                    arrayOf(intArrayOf(0, 3), intArrayOf(1, 5), intArrayOf(2, 4), intArrayOf(2, 6), intArrayOf(5, 6)),
                 ),
-            equalTo(intArrayOf(7, 14, 11, 14, 5))
+            equalTo(intArrayOf(7, 14, 11, 14, 5)),
         )
     }
 }
diff --git a/src/test/kotlin/g3201_3300/s3280_convert_date_to_binary/SolutionTest.kt b/src/test/kotlin/g3201_3300/s3280_convert_date_to_binary/SolutionTest.kt
index 0ad03638b..018aea0f8 100644
--- a/src/test/kotlin/g3201_3300/s3280_convert_date_to_binary/SolutionTest.kt
+++ b/src/test/kotlin/g3201_3300/s3280_convert_date_to_binary/SolutionTest.kt
@@ -8,7 +8,8 @@ internal class SolutionTest {
     @Test
     fun convertDateToBinary() {
         assertThat<String?>(
-            Solution().convertDateToBinary("2080-02-29"), equalTo<String?>("100000100000-10-11101")
+            Solution().convertDateToBinary("2080-02-29"),
+            equalTo<String?>("100000100000-10-11101"),
         )
     }
 
@@ -16,7 +17,7 @@ internal class SolutionTest {
     fun convertDateToBinary2() {
         assertThat<String?>(
             Solution().convertDateToBinary("1900-01-01"),
-            equalTo<String?>("11101101100-1-1")
+            equalTo<String?>("11101101100-1-1"),
         )
     }
 }
diff --git a/src/test/kotlin/g3201_3300/s3281_maximize_score_of_numbers_in_ranges/SolutionTest.kt b/src/test/kotlin/g3201_3300/s3281_maximize_score_of_numbers_in_ranges/SolutionTest.kt
index 2c02c8112..568a68d65 100644
--- a/src/test/kotlin/g3201_3300/s3281_maximize_score_of_numbers_in_ranges/SolutionTest.kt
+++ b/src/test/kotlin/g3201_3300/s3281_maximize_score_of_numbers_in_ranges/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun maxPossibleScore() {
         assertThat<Int?>(
             Solution().maxPossibleScore(intArrayOf(6, 0, 3), 2),
-            equalTo<Int?>(4)
+            equalTo<Int?>(4),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun maxPossibleScore2() {
         assertThat<Int?>(
             Solution().maxPossibleScore(intArrayOf(2, 6, 13, 13), 5),
-            equalTo<Int?>(5)
+            equalTo<Int?>(5),
         )
     }
 }
diff --git a/src/test/kotlin/g3201_3300/s3282_reach_end_of_array_with_max_score/SolutionTest.kt b/src/test/kotlin/g3201_3300/s3282_reach_end_of_array_with_max_score/SolutionTest.kt
index a66b0515e..7fcc390fd 100644
--- a/src/test/kotlin/g3201_3300/s3282_reach_end_of_array_with_max_score/SolutionTest.kt
+++ b/src/test/kotlin/g3201_3300/s3282_reach_end_of_array_with_max_score/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun findMaximumScore() {
         assertThat<Long?>(
             Solution().findMaximumScore(mutableListOf<Int>(1, 3, 1, 5)),
-            equalTo<Long?>(7L)
+            equalTo<Long?>(7L),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun findMaximumScore2() {
         assertThat<Long?>(
             Solution().findMaximumScore(mutableListOf<Int>(4, 3, 1, 3, 2)),
-            equalTo<Long?>(16L)
+            equalTo<Long?>(16L),
         )
     }
 }
diff --git a/src/test/kotlin/g3201_3300/s3283_maximum_number_of_moves_to_kill_all_pawns/SolutionTest.kt b/src/test/kotlin/g3201_3300/s3283_maximum_number_of_moves_to_kill_all_pawns/SolutionTest.kt
index 856e51a2d..c88205095 100644
--- a/src/test/kotlin/g3201_3300/s3283_maximum_number_of_moves_to_kill_all_pawns/SolutionTest.kt
+++ b/src/test/kotlin/g3201_3300/s3283_maximum_number_of_moves_to_kill_all_pawns/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun maxMoves() {
         assertThat<Int?>(
             Solution().maxMoves(1, 1, arrayOf(intArrayOf(0, 0))),
-            equalTo<Int?>(4)
+            equalTo<Int?>(4),
         )
     }
 
@@ -19,9 +19,9 @@ internal class SolutionTest {
             Solution().maxMoves(
                 0,
                 2,
-                arrayOf(intArrayOf(1, 1), intArrayOf(2, 2), intArrayOf(3, 3))
+                arrayOf(intArrayOf(1, 1), intArrayOf(2, 2), intArrayOf(3, 3)),
             ),
-            equalTo<Int?>(8)
+            equalTo<Int?>(8),
         )
     }
 
@@ -31,9 +31,9 @@ internal class SolutionTest {
             Solution().maxMoves(
                 0,
                 0,
-                arrayOf(intArrayOf(1, 2), intArrayOf(2, 4))
+                arrayOf(intArrayOf(1, 2), intArrayOf(2, 4)),
             ),
-            equalTo<Int?>(3)
+            equalTo<Int?>(3),
         )
     }
 }
diff --git a/src/test/kotlin/g3201_3300/s3285_find_indices_of_stable_mountains/SolutionTest.kt b/src/test/kotlin/g3201_3300/s3285_find_indices_of_stable_mountains/SolutionTest.kt
index 5b8873dce..babeebf77 100644
--- a/src/test/kotlin/g3201_3300/s3285_find_indices_of_stable_mountains/SolutionTest.kt
+++ b/src/test/kotlin/g3201_3300/s3285_find_indices_of_stable_mountains/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun stableMountains() {
         assertThat<List<Int>>(
             Solution().stableMountains(intArrayOf(1, 2, 3, 4, 5), 2),
-            equalTo<List<Int>>(listOf<Int>(3, 4))
+            equalTo<List<Int>>(listOf<Int>(3, 4)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun stableMountains2() {
         assertThat<List<Int>>(
             Solution().stableMountains(intArrayOf(10, 1, 10, 1, 10), 3),
-            equalTo<List<Int>>(listOf<Int>(1, 3))
+            equalTo<List<Int>>(listOf<Int>(1, 3)),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun stableMountains3() {
         assertThat<List<Int>>(
             Solution().stableMountains(intArrayOf(10, 1, 10, 1, 10), 10),
-            equalTo<List<Int>>(listOf<Int>())
+            equalTo<List<Int>>(listOf<Int>()),
         )
     }
 }
diff --git a/src/test/kotlin/g3201_3300/s3286_find_a_safe_walk_through_a_grid/SolutionTest.kt b/src/test/kotlin/g3201_3300/s3286_find_a_safe_walk_through_a_grid/SolutionTest.kt
index 901602fa3..58faf37ae 100644
--- a/src/test/kotlin/g3201_3300/s3286_find_a_safe_walk_through_a_grid/SolutionTest.kt
+++ b/src/test/kotlin/g3201_3300/s3286_find_a_safe_walk_through_a_grid/SolutionTest.kt
@@ -13,12 +13,14 @@ internal class SolutionTest {
                 .findSafeWalk(
                     getLists(
                         arrayOf<IntArray>(
-                            intArrayOf(0, 1, 0, 0, 0), intArrayOf(0, 1, 0, 1, 0), intArrayOf(0, 0, 0, 1, 0)
-                        )
+                            intArrayOf(0, 1, 0, 0, 0),
+                            intArrayOf(0, 1, 0, 1, 0),
+                            intArrayOf(0, 0, 0, 1, 0),
+                        ),
                     ),
-                    1
+                    1,
                 ),
-            CoreMatchers.equalTo<Boolean?>(true)
+            CoreMatchers.equalTo<Boolean?>(true),
         )
     }
 
@@ -32,12 +34,12 @@ internal class SolutionTest {
                             intArrayOf(0, 1, 1, 0, 0, 0),
                             intArrayOf(1, 0, 1, 0, 0, 0),
                             intArrayOf(0, 1, 1, 1, 0, 1),
-                            intArrayOf(0, 0, 1, 0, 1, 0)
-                        )
+                            intArrayOf(0, 0, 1, 0, 1, 0),
+                        ),
                     ),
-                    3
+                    3,
                 ),
-            CoreMatchers.equalTo<Boolean?>(false)
+            CoreMatchers.equalTo<Boolean?>(false),
         )
     }
 
@@ -50,12 +52,12 @@ internal class SolutionTest {
                         arrayOf(
                             intArrayOf(1, 1, 1),
                             intArrayOf(1, 0, 1),
-                            intArrayOf(1, 1, 1)
-                        )
+                            intArrayOf(1, 1, 1),
+                        ),
                     ),
-                    5
+                    5,
                 ),
-            CoreMatchers.equalTo<Boolean?>(true)
+            CoreMatchers.equalTo<Boolean?>(true),
         )
     }
 }
diff --git a/src/test/kotlin/g3201_3300/s3288_length_of_the_longest_increasing_path/SolutionTest.kt b/src/test/kotlin/g3201_3300/s3288_length_of_the_longest_increasing_path/SolutionTest.kt
index f4138e6f9..b0e781e2e 100644
--- a/src/test/kotlin/g3201_3300/s3288_length_of_the_longest_increasing_path/SolutionTest.kt
+++ b/src/test/kotlin/g3201_3300/s3288_length_of_the_longest_increasing_path/SolutionTest.kt
@@ -15,11 +15,11 @@ internal class SolutionTest {
                         intArrayOf(2, 2),
                         intArrayOf(4, 1),
                         intArrayOf(0, 0),
-                        intArrayOf(5, 3)
+                        intArrayOf(5, 3),
                     ),
-                    1
+                    1,
                 ),
-            equalTo<Int?>(3)
+            equalTo<Int?>(3),
         )
     }
 
@@ -27,7 +27,7 @@ internal class SolutionTest {
     fun maxPathLength2() {
         assertThat<Int?>(
             Solution().maxPathLength(arrayOf<IntArray>(intArrayOf(2, 1), intArrayOf(7, 0), intArrayOf(5, 6)), 2),
-            equalTo<Int?>(2)
+            equalTo<Int?>(2),
         )
     }
 
@@ -35,7 +35,7 @@ internal class SolutionTest {
     fun maxPathLength3() {
         assertThat<Int?>(
             Solution().maxPathLength(arrayOf<IntArray>(intArrayOf(0, 3), intArrayOf(8, 5), intArrayOf(6, 8)), 0),
-            equalTo<Int?>(2)
+            equalTo<Int?>(2),
         )
     }
 
@@ -47,11 +47,11 @@ internal class SolutionTest {
                     intArrayOf(8, 8),
                     intArrayOf(7, 0),
                     intArrayOf(5, 6),
-                    intArrayOf(9, 1)
+                    intArrayOf(9, 1),
                 ),
-                0
+                0,
             ),
-            equalTo<Int?>(2)
+            equalTo<Int?>(2),
         )
     }
 
@@ -67,11 +67,11 @@ internal class SolutionTest {
                         intArrayOf(3, 3),
                         intArrayOf(2, 0),
                         intArrayOf(1, 4),
-                        intArrayOf(6, 8)
+                        intArrayOf(6, 8),
                     ),
-                    6
+                    6,
                 ),
-            equalTo<Int?>(4)
+            equalTo<Int?>(4),
         )
     }
 }
diff --git a/src/test/kotlin/g3201_3300/s3289_the_two_sneaky_numbers_of_digitville/SolutionTest.kt b/src/test/kotlin/g3201_3300/s3289_the_two_sneaky_numbers_of_digitville/SolutionTest.kt
index 9f256c9c9..ea3541a44 100644
--- a/src/test/kotlin/g3201_3300/s3289_the_two_sneaky_numbers_of_digitville/SolutionTest.kt
+++ b/src/test/kotlin/g3201_3300/s3289_the_two_sneaky_numbers_of_digitville/SolutionTest.kt
@@ -8,7 +8,8 @@ internal class SolutionTest {
     @Test
     fun getSneakyNumbers() {
         assertThat<IntArray?>(
-            Solution().getSneakyNumbers(intArrayOf(0, 1, 1, 0)), equalTo<IntArray?>(intArrayOf(0, 1))
+            Solution().getSneakyNumbers(intArrayOf(0, 1, 1, 0)),
+            equalTo<IntArray?>(intArrayOf(0, 1)),
         )
     }
 
@@ -16,7 +17,7 @@ internal class SolutionTest {
     fun getSneakyNumbers2() {
         assertThat<IntArray?>(
             Solution().getSneakyNumbers(intArrayOf(0, 3, 2, 1, 3, 2)),
-            equalTo<IntArray?>(intArrayOf(2, 3))
+            equalTo<IntArray?>(intArrayOf(2, 3)),
         )
     }
 
@@ -24,7 +25,7 @@ internal class SolutionTest {
     fun getSneakyNumbers3() {
         assertThat<IntArray?>(
             Solution().getSneakyNumbers(intArrayOf(7, 1, 5, 4, 3, 4, 6, 0, 9, 5, 8, 2)),
-            equalTo<IntArray?>(intArrayOf(4, 5))
+            equalTo<IntArray?>(intArrayOf(4, 5)),
         )
     }
 }
diff --git a/src/test/kotlin/g3201_3300/s3290_maximum_multiplication_score/SolutionTest.kt b/src/test/kotlin/g3201_3300/s3290_maximum_multiplication_score/SolutionTest.kt
index bb71feeff..b6a115801 100644
--- a/src/test/kotlin/g3201_3300/s3290_maximum_multiplication_score/SolutionTest.kt
+++ b/src/test/kotlin/g3201_3300/s3290_maximum_multiplication_score/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat<Long?>(
             Solution()
                 .maxScore(intArrayOf(3, 2, 5, 6), intArrayOf(2, -6, 4, -5, -3, 2, -7)),
-            equalTo<Long?>(26L)
+            equalTo<Long?>(26L),
         )
     }
 
@@ -18,7 +18,7 @@ internal class SolutionTest {
     fun maxScore2() {
         assertThat<Long?>(
             Solution().maxScore(intArrayOf(-1, 4, 5, -2), intArrayOf(-5, -1, -3, -2, -4)),
-            equalTo<Long?>(-1L)
+            equalTo<Long?>(-1L),
         )
     }
 }
diff --git a/src/test/kotlin/g3201_3300/s3291_minimum_number_of_valid_strings_to_form_target_i/SolutionTest.kt b/src/test/kotlin/g3201_3300/s3291_minimum_number_of_valid_strings_to_form_target_i/SolutionTest.kt
index 8073cbbb0..6dd52e7e2 100644
--- a/src/test/kotlin/g3201_3300/s3291_minimum_number_of_valid_strings_to_form_target_i/SolutionTest.kt
+++ b/src/test/kotlin/g3201_3300/s3291_minimum_number_of_valid_strings_to_form_target_i/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun minValidStrings() {
         assertThat<Int?>(
             Solution().minValidStrings(arrayOf<String>("abc", "aaaaa", "bcdef"), "aabcdabc"),
-            equalTo<Int?>(3)
+            equalTo<Int?>(3),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun minValidStrings2() {
         assertThat<Int?>(
             Solution().minValidStrings(arrayOf<String>("abababab", "ab"), "ababaababa"),
-            equalTo<Int?>(2)
+            equalTo<Int?>(2),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun minValidStrings3() {
         assertThat<Int?>(
             Solution().minValidStrings(arrayOf<String>("abcdef"), "xyz"),
-            equalTo<Int?>(-1)
+            equalTo<Int?>(-1),
         )
     }
 }
diff --git a/src/test/kotlin/g3201_3300/s3292_minimum_number_of_valid_strings_to_form_target_ii/SolutionTest.kt b/src/test/kotlin/g3201_3300/s3292_minimum_number_of_valid_strings_to_form_target_ii/SolutionTest.kt
index 1d38683b6..ca2d30c46 100644
--- a/src/test/kotlin/g3201_3300/s3292_minimum_number_of_valid_strings_to_form_target_ii/SolutionTest.kt
+++ b/src/test/kotlin/g3201_3300/s3292_minimum_number_of_valid_strings_to_form_target_ii/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun minValidStrings() {
         assertThat<Int?>(
             Solution().minValidStrings(arrayOf<String>("abc", "aaaaa", "bcdef"), "aabcdabc"),
-            equalTo<Int?>(3)
+            equalTo<Int?>(3),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun minValidStrings2() {
         assertThat<Int?>(
             Solution().minValidStrings(arrayOf<String>("abababab", "ab"), "ababaababa"),
-            equalTo<Int?>(2)
+            equalTo<Int?>(2),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun minValidStrings3() {
         assertThat<Int?>(
             Solution().minValidStrings(arrayOf<String>("abcdef"), "xyz"),
-            equalTo<Int?>(-1)
+            equalTo<Int?>(-1),
         )
     }
 }
diff --git a/src/test/kotlin/g3201_3300/s3295_report_spam_message/SolutionTest.kt b/src/test/kotlin/g3201_3300/s3295_report_spam_message/SolutionTest.kt
index b82f54317..9f1036e79 100644
--- a/src/test/kotlin/g3201_3300/s3295_report_spam_message/SolutionTest.kt
+++ b/src/test/kotlin/g3201_3300/s3295_report_spam_message/SolutionTest.kt
@@ -11,9 +11,9 @@ internal class SolutionTest {
             Solution()
                 .reportSpam(
                     arrayOf<String>("hello", "world", "leetcode"),
-                    arrayOf<String>("world", "hello")
+                    arrayOf<String>("world", "hello"),
                 ),
-            equalTo<Boolean>(true)
+            equalTo<Boolean>(true),
         )
     }
 
@@ -23,9 +23,9 @@ internal class SolutionTest {
             Solution()
                 .reportSpam(
                     arrayOf<String>("hello", "programming", "fun"),
-                    arrayOf<String>("world", "programming", "leetcode")
+                    arrayOf<String>("world", "programming", "leetcode"),
                 ),
-            equalTo<Boolean>(false)
+            equalTo<Boolean>(false),
         )
     }
 }
diff --git a/src/test/kotlin/g3201_3300/s3296_minimum_number_of_seconds_to_make_mountain_height_zero/SolutionTest.kt b/src/test/kotlin/g3201_3300/s3296_minimum_number_of_seconds_to_make_mountain_height_zero/SolutionTest.kt
index f5e7e1656..3eee0c23c 100644
--- a/src/test/kotlin/g3201_3300/s3296_minimum_number_of_seconds_to_make_mountain_height_zero/SolutionTest.kt
+++ b/src/test/kotlin/g3201_3300/s3296_minimum_number_of_seconds_to_make_mountain_height_zero/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun minNumberOfSeconds() {
         assertThat<Long>(
             Solution().minNumberOfSeconds(4, intArrayOf(2, 1, 1)),
-            equalTo<Long>(3L)
+            equalTo<Long>(3L),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun minNumberOfSeconds2() {
         assertThat<Long>(
             Solution().minNumberOfSeconds(10, intArrayOf(3, 2, 2, 4)),
-            equalTo<Long>(12L)
+            equalTo<Long>(12L),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun minNumberOfSeconds3() {
         assertThat<Long>(
             Solution().minNumberOfSeconds(5, intArrayOf(1)),
-            equalTo<Long>(15L)
+            equalTo<Long>(15L),
         )
     }
 }
diff --git a/src/test/kotlin/g3201_3300/s3297_count_substrings_that_can_be_rearranged_to_contain_a_string_i/SolutionTest.kt b/src/test/kotlin/g3201_3300/s3297_count_substrings_that_can_be_rearranged_to_contain_a_string_i/SolutionTest.kt
index 71967ccc3..483c58a09 100644
--- a/src/test/kotlin/g3201_3300/s3297_count_substrings_that_can_be_rearranged_to_contain_a_string_i/SolutionTest.kt
+++ b/src/test/kotlin/g3201_3300/s3297_count_substrings_that_can_be_rearranged_to_contain_a_string_i/SolutionTest.kt
@@ -14,7 +14,7 @@ internal class SolutionTest {
     fun validSubstringCount2() {
         assertThat<Long>(
             Solution().validSubstringCount("abcabc", "abc"),
-            equalTo<Long>(10L)
+            equalTo<Long>(10L),
         )
     }
 
@@ -22,7 +22,7 @@ internal class SolutionTest {
     fun validSubstringCount3() {
         assertThat<Long>(
             Solution().validSubstringCount("abcabc", "aaabc"),
-            equalTo<Long>(0L)
+            equalTo<Long>(0L),
         )
     }
 
@@ -30,7 +30,7 @@ internal class SolutionTest {
     fun validSubstringCount4() {
         assertThat<Long>(
             Solution().validSubstringCount("dcbdcdccb", "cdd"),
-            equalTo<Long>(18L)
+            equalTo<Long>(18L),
         )
     }
 }
diff --git a/src/test/kotlin/g3201_3300/s3298_count_substrings_that_can_be_rearranged_to_contain_a_string_ii/SolutionTest.kt b/src/test/kotlin/g3201_3300/s3298_count_substrings_that_can_be_rearranged_to_contain_a_string_ii/SolutionTest.kt
index bac0ad779..29a845c20 100644
--- a/src/test/kotlin/g3201_3300/s3298_count_substrings_that_can_be_rearranged_to_contain_a_string_ii/SolutionTest.kt
+++ b/src/test/kotlin/g3201_3300/s3298_count_substrings_that_can_be_rearranged_to_contain_a_string_ii/SolutionTest.kt
@@ -14,7 +14,7 @@ internal class SolutionTest {
     fun validSubstringCount2() {
         assertThat<Long>(
             Solution().validSubstringCount("abcabc", "abc"),
-            equalTo<Long>(10L)
+            equalTo<Long>(10L),
         )
     }
 
@@ -22,7 +22,7 @@ internal class SolutionTest {
     fun validSubstringCount3() {
         assertThat<Long>(
             Solution().validSubstringCount("abcabc", "aaabc"),
-            equalTo<Long>(0L)
+            equalTo<Long>(0L),
         )
     }
 }
diff --git a/src/test/kotlin/g3301_3400/s3301_maximize_the_total_height_of_unique_towers/SolutionTest.kt b/src/test/kotlin/g3301_3400/s3301_maximize_the_total_height_of_unique_towers/SolutionTest.kt
index c82c8c7b5..6c11ce41a 100644
--- a/src/test/kotlin/g3301_3400/s3301_maximize_the_total_height_of_unique_towers/SolutionTest.kt
+++ b/src/test/kotlin/g3301_3400/s3301_maximize_the_total_height_of_unique_towers/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun maximumTotalSum() {
         assertThat<Long>(
             Solution().maximumTotalSum(intArrayOf(2, 3, 4, 3)),
-            equalTo<Long>(10L)
+            equalTo<Long>(10L),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun maximumTotalSum2() {
         assertThat<Long>(
             Solution().maximumTotalSum(intArrayOf(15, 10)),
-            equalTo<Long>(25L)
+            equalTo<Long>(25L),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun maximumTotalSum3() {
         assertThat<Long>(
             Solution().maximumTotalSum(intArrayOf(2, 2, 1)),
-            equalTo<Long>(-1L)
+            equalTo<Long>(-1L),
         )
     }
 }
diff --git a/src/test/kotlin/g3301_3400/s3302_find_the_lexicographically_smallest_valid_sequence/SolutionTest.kt b/src/test/kotlin/g3301_3400/s3302_find_the_lexicographically_smallest_valid_sequence/SolutionTest.kt
index 8c6d1bfd0..b6bce7252 100644
--- a/src/test/kotlin/g3301_3400/s3302_find_the_lexicographically_smallest_valid_sequence/SolutionTest.kt
+++ b/src/test/kotlin/g3301_3400/s3302_find_the_lexicographically_smallest_valid_sequence/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun validSequence() {
         assertThat<IntArray>(
             Solution().validSequence("vbcca", "abc"),
-            equalTo<IntArray>(intArrayOf(0, 1, 2))
+            equalTo<IntArray>(intArrayOf(0, 1, 2)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun validSequence2() {
         assertThat<IntArray>(
             Solution().validSequence("bacdc", "abc"),
-            equalTo<IntArray>(intArrayOf(1, 2, 4))
+            equalTo<IntArray>(intArrayOf(1, 2, 4)),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun validSequence3() {
         assertThat<IntArray>(
             Solution().validSequence("aaaaaa", "aaabc"),
-            equalTo<IntArray>(intArrayOf())
+            equalTo<IntArray>(intArrayOf()),
         )
     }
 
@@ -33,7 +33,7 @@ internal class SolutionTest {
     fun validSequence4() {
         assertThat<IntArray>(
             Solution().validSequence("abc", "ab"),
-            equalTo<IntArray>(intArrayOf(0, 1))
+            equalTo<IntArray>(intArrayOf(0, 1)),
         )
     }
 }
diff --git a/src/test/kotlin/g3301_3400/s3303_find_the_occurrence_of_first_almost_equal_substring/SolutionTest.kt b/src/test/kotlin/g3301_3400/s3303_find_the_occurrence_of_first_almost_equal_substring/SolutionTest.kt
index 1c2dbe3bf..5a959e09c 100644
--- a/src/test/kotlin/g3301_3400/s3303_find_the_occurrence_of_first_almost_equal_substring/SolutionTest.kt
+++ b/src/test/kotlin/g3301_3400/s3303_find_the_occurrence_of_first_almost_equal_substring/SolutionTest.kt
@@ -14,7 +14,7 @@ internal class SolutionTest {
     fun minStartingIndex2() {
         assertThat<Int>(
             Solution().minStartingIndex("ababbababa", "bacaba"),
-            equalTo<Int>(4)
+            equalTo<Int>(4),
         )
     }
 
diff --git a/src/test/kotlin/g3301_3400/s3306_count_of_substrings_containing_every_vowel_and_k_consonants_ii/SolutionTest.kt b/src/test/kotlin/g3301_3400/s3306_count_of_substrings_containing_every_vowel_and_k_consonants_ii/SolutionTest.kt
index 0cf52341c..d18a70a6d 100644
--- a/src/test/kotlin/g3301_3400/s3306_count_of_substrings_containing_every_vowel_and_k_consonants_ii/SolutionTest.kt
+++ b/src/test/kotlin/g3301_3400/s3306_count_of_substrings_containing_every_vowel_and_k_consonants_ii/SolutionTest.kt
@@ -19,7 +19,7 @@ internal class SolutionTest {
     fun countOfSubstrings3() {
         assertThat<Long>(
             Solution().countOfSubstrings("ieaouqqieaouqq", 1),
-            equalTo<Long>(3L)
+            equalTo<Long>(3L),
         )
     }
 }
diff --git a/src/test/kotlin/g3301_3400/s3307_find_the_k_th_character_in_string_game_ii/SolutionTest.kt b/src/test/kotlin/g3301_3400/s3307_find_the_k_th_character_in_string_game_ii/SolutionTest.kt
index f1faea789..2d1e29dbc 100644
--- a/src/test/kotlin/g3301_3400/s3307_find_the_k_th_character_in_string_game_ii/SolutionTest.kt
+++ b/src/test/kotlin/g3301_3400/s3307_find_the_k_th_character_in_string_game_ii/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun kthCharacter() {
         assertThat<Char>(
             Solution().kthCharacter(5, intArrayOf(0, 0, 0)),
-            equalTo<Char>('a')
+            equalTo<Char>('a'),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun kthCharacter2() {
         assertThat<Char>(
             Solution().kthCharacter(10, intArrayOf(0, 1, 0, 1)),
-            equalTo<Char>('b')
+            equalTo<Char>('b'),
         )
     }
 }
diff --git a/src/test/kotlin/g3301_3400/s3310_remove_methods_from_project/SolutionTest.kt b/src/test/kotlin/g3301_3400/s3310_remove_methods_from_project/SolutionTest.kt
index ce5848447..c426ecc56 100644
--- a/src/test/kotlin/g3301_3400/s3310_remove_methods_from_project/SolutionTest.kt
+++ b/src/test/kotlin/g3301_3400/s3310_remove_methods_from_project/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun remainingMethods() {
         assertThat<List<Int>>(
             Solution().remainingMethods(4, 1, arrayOf<IntArray>(intArrayOf(1, 2), intArrayOf(0, 1), intArrayOf(3, 2))),
-            equalTo<List<Int>>(listOf<Int>(0, 1, 2, 3))
+            equalTo<List<Int>>(listOf<Int>(0, 1, 2, 3)),
         )
     }
 
@@ -19,9 +19,9 @@ internal class SolutionTest {
             Solution().remainingMethods(
                 5,
                 0,
-                arrayOf<IntArray>(intArrayOf(1, 2), intArrayOf(0, 2), intArrayOf(0, 1), intArrayOf(3, 4))
+                arrayOf<IntArray>(intArrayOf(1, 2), intArrayOf(0, 2), intArrayOf(0, 1), intArrayOf(3, 4)),
             ),
-            equalTo<List<Int>>(listOf<Int>(3, 4))
+            equalTo<List<Int>>(listOf<Int>(3, 4)),
         )
     }
 
@@ -29,7 +29,7 @@ internal class SolutionTest {
     fun remainingMethods3() {
         assertThat<List<Int>>(
             Solution().remainingMethods(3, 2, arrayOf<IntArray>(intArrayOf(1, 2), intArrayOf(0, 1), intArrayOf(2, 0))),
-            equalTo<List<out Any>>(listOf<Any>())
+            equalTo<List<out Any>>(listOf<Any>()),
         )
     }
 }
diff --git a/src/test/kotlin/g3301_3400/s3311_construct_2d_grid_matching_graph_layout/SolutionTest.kt b/src/test/kotlin/g3301_3400/s3311_construct_2d_grid_matching_graph_layout/SolutionTest.kt
index 9c604d243..2694d8424 100644
--- a/src/test/kotlin/g3301_3400/s3311_construct_2d_grid_matching_graph_layout/SolutionTest.kt
+++ b/src/test/kotlin/g3301_3400/s3311_construct_2d_grid_matching_graph_layout/SolutionTest.kt
@@ -10,9 +10,9 @@ internal class SolutionTest {
         assertThat<Array<IntArray>>(
             Solution().constructGridLayout(
                 4,
-                arrayOf<IntArray>(intArrayOf(0, 1), intArrayOf(0, 2), intArrayOf(1, 3), intArrayOf(2, 3))
+                arrayOf<IntArray>(intArrayOf(0, 1), intArrayOf(0, 2), intArrayOf(1, 3), intArrayOf(2, 3)),
             ),
-            equalTo<Array<IntArray>>(arrayOf<IntArray>(intArrayOf(0, 2), intArrayOf(1, 3)))
+            equalTo<Array<IntArray>>(arrayOf<IntArray>(intArrayOf(0, 2), intArrayOf(1, 3))),
         )
     }
 
@@ -21,9 +21,9 @@ internal class SolutionTest {
         assertThat<Array<IntArray>>(
             Solution().constructGridLayout(
                 5,
-                arrayOf<IntArray>(intArrayOf(0, 1), intArrayOf(1, 3), intArrayOf(2, 3), intArrayOf(2, 4))
+                arrayOf<IntArray>(intArrayOf(0, 1), intArrayOf(1, 3), intArrayOf(2, 3), intArrayOf(2, 4)),
             ),
-            equalTo<Array<IntArray>>(arrayOf<IntArray>(intArrayOf(0, 1, 3, 2, 4)))
+            equalTo<Array<IntArray>>(arrayOf<IntArray>(intArrayOf(0, 1, 3, 2, 4))),
         )
     }
 
@@ -45,16 +45,16 @@ internal class SolutionTest {
                         intArrayOf(4, 6),
                         intArrayOf(4, 7),
                         intArrayOf(6, 8),
-                        intArrayOf(7, 8)
-                    )
+                        intArrayOf(7, 8),
+                    ),
                 ),
             equalTo<Array<IntArray>>(
                 arrayOf<IntArray>(
                     intArrayOf(1, 0, 5),
                     intArrayOf(7, 4, 2),
-                    intArrayOf(8, 6, 3)
-                )
-            )
+                    intArrayOf(8, 6, 3),
+                ),
+            ),
         )
     }
 }
diff --git a/src/test/kotlin/g3301_3400/s3312_sorted_gcd_pair_queries/SolutionTest.kt b/src/test/kotlin/g3301_3400/s3312_sorted_gcd_pair_queries/SolutionTest.kt
index a1073118d..986272a32 100644
--- a/src/test/kotlin/g3301_3400/s3312_sorted_gcd_pair_queries/SolutionTest.kt
+++ b/src/test/kotlin/g3301_3400/s3312_sorted_gcd_pair_queries/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun gcdValues() {
         assertThat<IntArray?>(
             Solution().gcdValues(intArrayOf(2, 3, 4), longArrayOf(0L, 2L, 2L)),
-            equalTo<IntArray?>(intArrayOf(1, 2, 2))
+            equalTo<IntArray?>(intArrayOf(1, 2, 2)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun gcdValues2() {
         assertThat<IntArray?>(
             Solution().gcdValues(intArrayOf(4, 4, 2, 1), longArrayOf(5L, 3L, 1L, 0L)),
-            equalTo<IntArray?>(intArrayOf(4, 2, 1, 1))
+            equalTo<IntArray?>(intArrayOf(4, 2, 1, 1)),
         )
     }
 }
diff --git a/src/test/kotlin/g3301_3400/s3314_construct_the_minimum_bitwise_array_i/SolutionTest.kt b/src/test/kotlin/g3301_3400/s3314_construct_the_minimum_bitwise_array_i/SolutionTest.kt
index 9dd7fb008..ebbe48dc3 100644
--- a/src/test/kotlin/g3301_3400/s3314_construct_the_minimum_bitwise_array_i/SolutionTest.kt
+++ b/src/test/kotlin/g3301_3400/s3314_construct_the_minimum_bitwise_array_i/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun minBitwiseArray() {
         assertThat<IntArray?>(
             Solution().minBitwiseArray(mutableListOf<Int>(2, 3, 5, 7)),
-            equalTo<IntArray?>(intArrayOf(-1, 1, 4, 3))
+            equalTo<IntArray?>(intArrayOf(-1, 1, 4, 3)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun minBitwiseArray2() {
         assertThat<IntArray?>(
             Solution().minBitwiseArray(mutableListOf<Int>(11, 13, 31)),
-            equalTo<IntArray?>(intArrayOf(9, 12, 15))
+            equalTo<IntArray?>(intArrayOf(9, 12, 15)),
         )
     }
 }
diff --git a/src/test/kotlin/g3301_3400/s3315_construct_the_minimum_bitwise_array_ii/SolutionTest.kt b/src/test/kotlin/g3301_3400/s3315_construct_the_minimum_bitwise_array_ii/SolutionTest.kt
index 5e7708c11..c070800a9 100644
--- a/src/test/kotlin/g3301_3400/s3315_construct_the_minimum_bitwise_array_ii/SolutionTest.kt
+++ b/src/test/kotlin/g3301_3400/s3315_construct_the_minimum_bitwise_array_ii/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun minBitwiseArray() {
         assertThat<IntArray?>(
             Solution().minBitwiseArray(mutableListOf<Int>(2, 3, 5, 7)),
-            equalTo<IntArray?>(intArrayOf(-1, 1, 4, 3))
+            equalTo<IntArray?>(intArrayOf(-1, 1, 4, 3)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun minBitwiseArray2() {
         assertThat<IntArray?>(
             Solution().minBitwiseArray(mutableListOf<Int>(11, 13, 31)),
-            equalTo<IntArray?>(intArrayOf(9, 12, 15))
+            equalTo<IntArray?>(intArrayOf(9, 12, 15)),
         )
     }
 }
diff --git a/src/test/kotlin/g3301_3400/s3316_find_maximum_removals_from_source_string/SolutionTest.kt b/src/test/kotlin/g3301_3400/s3316_find_maximum_removals_from_source_string/SolutionTest.kt
index 9e4a79831..f6677858b 100644
--- a/src/test/kotlin/g3301_3400/s3316_find_maximum_removals_from_source_string/SolutionTest.kt
+++ b/src/test/kotlin/g3301_3400/s3316_find_maximum_removals_from_source_string/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun maxRemovals() {
         assertThat<Int?>(
             Solution().maxRemovals("abbaa", "aba", intArrayOf(0, 1, 2)),
-            equalTo<Int?>(1)
+            equalTo<Int?>(1),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun maxRemovals2() {
         assertThat<Int?>(
             Solution().maxRemovals("bcda", "d", intArrayOf(0, 3)),
-            equalTo<Int?>(2)
+            equalTo<Int?>(2),
         )
     }
 
@@ -25,7 +25,7 @@ internal class SolutionTest {
     fun maxRemovals3() {
         assertThat<Int?>(
             Solution().maxRemovals("dda", "dda", intArrayOf(0, 1, 2)),
-            equalTo<Int?>(0)
+            equalTo<Int?>(0),
         )
     }
 
@@ -33,7 +33,7 @@ internal class SolutionTest {
     fun maxRemovals4() {
         assertThat<Int?>(
             Solution().maxRemovals("yeyeykyded", "yeyyd", intArrayOf(0, 2, 3, 4)),
-            equalTo<Int?>(2)
+            equalTo<Int?>(2),
         )
     }
 }
diff --git a/src/test/kotlin/g3301_3400/s3318_find_x_sum_of_all_k_long_subarrays_i/SolutionTest.kt b/src/test/kotlin/g3301_3400/s3318_find_x_sum_of_all_k_long_subarrays_i/SolutionTest.kt
index 568b2a647..633883f6e 100644
--- a/src/test/kotlin/g3301_3400/s3318_find_x_sum_of_all_k_long_subarrays_i/SolutionTest.kt
+++ b/src/test/kotlin/g3301_3400/s3318_find_x_sum_of_all_k_long_subarrays_i/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun findXSum() {
         assertThat<IntArray?>(
             Solution().findXSum(intArrayOf(1, 1, 2, 2, 3, 4, 2, 3), 6, 2),
-            equalTo<IntArray?>(intArrayOf(6, 10, 12))
+            equalTo<IntArray?>(intArrayOf(6, 10, 12)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun findXSum2() {
         assertThat<IntArray?>(
             Solution().findXSum(intArrayOf(3, 8, 7, 8, 7, 5), 2, 2),
-            equalTo<IntArray?>(intArrayOf(11, 15, 15, 15, 12))
+            equalTo<IntArray?>(intArrayOf(11, 15, 15, 15, 12)),
         )
     }
 }
diff --git a/src/test/kotlin/g3301_3400/s3319_k_th_largest_perfect_subtree_size_in_binary_tree/SolutionTest.kt b/src/test/kotlin/g3301_3400/s3319_k_th_largest_perfect_subtree_size_in_binary_tree/SolutionTest.kt
index 326fbd292..5c62fd749 100644
--- a/src/test/kotlin/g3301_3400/s3319_k_th_largest_perfect_subtree_size_in_binary_tree/SolutionTest.kt
+++ b/src/test/kotlin/g3301_3400/s3319_k_th_largest_perfect_subtree_size_in_binary_tree/SolutionTest.kt
@@ -12,11 +12,11 @@ internal class SolutionTest {
             Solution()
                 .kthLargestPerfectSubtree(
                     TreeNode.create(
-                        mutableListOf(5, 3, 6, 5, 2, 5, 7, 1, 8, null, null, 6, 8)
+                        mutableListOf(5, 3, 6, 5, 2, 5, 7, 1, 8, null, null, 6, 8),
                     ),
-                    2
+                    2,
                 ),
-            equalTo<Int?>(3)
+            equalTo<Int?>(3),
         )
     }
 
@@ -25,9 +25,10 @@ internal class SolutionTest {
         assertThat<Int?>(
             Solution()
                 .kthLargestPerfectSubtree(
-                    TreeNode.create(mutableListOf(1, 2, 3, 4, 5, 6, 7)), 1
+                    TreeNode.create(mutableListOf(1, 2, 3, 4, 5, 6, 7)),
+                    1,
                 ),
-            equalTo<Int?>(7)
+            equalTo<Int?>(7),
         )
     }
 
@@ -36,9 +37,10 @@ internal class SolutionTest {
         assertThat<Int?>(
             Solution()
                 .kthLargestPerfectSubtree(
-                    TreeNode.create(mutableListOf(1, 2, 3, null, 4)), 3
+                    TreeNode.create(mutableListOf(1, 2, 3, null, 4)),
+                    3,
                 ),
-            equalTo<Int?>(-1)
+            equalTo<Int?>(-1),
         )
     }
 }
diff --git a/src/test/kotlin/g3301_3400/s3321_find_x_sum_of_all_k_long_subarrays_ii/SolutionTest.kt b/src/test/kotlin/g3301_3400/s3321_find_x_sum_of_all_k_long_subarrays_ii/SolutionTest.kt
index 3c24229c6..0e2c9d0d6 100644
--- a/src/test/kotlin/g3301_3400/s3321_find_x_sum_of_all_k_long_subarrays_ii/SolutionTest.kt
+++ b/src/test/kotlin/g3301_3400/s3321_find_x_sum_of_all_k_long_subarrays_ii/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun findXSum() {
         assertThat<LongArray?>(
             Solution().findXSum(intArrayOf(1, 1, 2, 2, 3, 4, 2, 3), 6, 2),
-            equalTo<LongArray?>(longArrayOf(6L, 10L, 12L))
+            equalTo<LongArray?>(longArrayOf(6L, 10L, 12L)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun findXSum2() {
         assertThat<LongArray?>(
             Solution().findXSum(intArrayOf(3, 8, 7, 8, 7, 5), 2, 2),
-            equalTo<LongArray?>(longArrayOf(11L, 15L, 15L, 15L, 12L))
+            equalTo<LongArray?>(longArrayOf(11L, 15L, 15L, 15L, 12L)),
         )
     }
 }
diff --git a/src/test/kotlin/g3301_3400/s3324_find_the_sequence_of_strings_appeared_on_the_screen/SolutionTest.kt b/src/test/kotlin/g3301_3400/s3324_find_the_sequence_of_strings_appeared_on_the_screen/SolutionTest.kt
index 6c00aefdc..1d7ef0afc 100644
--- a/src/test/kotlin/g3301_3400/s3324_find_the_sequence_of_strings_appeared_on_the_screen/SolutionTest.kt
+++ b/src/test/kotlin/g3301_3400/s3324_find_the_sequence_of_strings_appeared_on_the_screen/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun stringSequence() {
         assertThat<List<String>>(
             Solution().stringSequence("abc"),
-            equalTo<List<String>>(listOf<String>("a", "aa", "ab", "aba", "abb", "abc"))
+            equalTo<List<String>>(listOf<String>("a", "aa", "ab", "aba", "abb", "abc")),
         )
     }
 
@@ -20,9 +20,9 @@ internal class SolutionTest {
             equalTo<List<String>>(
                 listOf<String>(
                     "a", "b", "c", "d", "e", "f", "g", "h", "ha", "hb", "hc", "hd",
-                    "he"
-                )
-            )
+                    "he",
+                ),
+            ),
         )
     }
 }
diff --git a/src/test/kotlin/g3301_3400/s3327_check_if_dfs_strings_are_palindromes/SolutionTest.kt b/src/test/kotlin/g3301_3400/s3327_check_if_dfs_strings_are_palindromes/SolutionTest.kt
index 61fb2dd0b..aacc25faa 100644
--- a/src/test/kotlin/g3301_3400/s3327_check_if_dfs_strings_are_palindromes/SolutionTest.kt
+++ b/src/test/kotlin/g3301_3400/s3327_check_if_dfs_strings_are_palindromes/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun findAnswer() {
         assertThat<BooleanArray>(
             Solution().findAnswer(intArrayOf(-1, 0, 0, 1, 1, 2), "aababa"),
-            equalTo<BooleanArray>(booleanArrayOf(true, true, false, true, true, true))
+            equalTo<BooleanArray>(booleanArrayOf(true, true, false, true, true, true)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun findAnswer2() {
         assertThat<BooleanArray>(
             Solution().findAnswer(intArrayOf(-1, 0, 0, 0, 0), "aabcb"),
-            equalTo<BooleanArray>(booleanArrayOf(true, true, true, true, true))
+            equalTo<BooleanArray>(booleanArrayOf(true, true, true, true, true)),
         )
     }
 }
diff --git a/src/test/kotlin/g3301_3400/s3331_find_subtree_sizes_after_changes/SolutionTest.kt b/src/test/kotlin/g3301_3400/s3331_find_subtree_sizes_after_changes/SolutionTest.kt
index 18924f5c2..abc2c79a7 100644
--- a/src/test/kotlin/g3301_3400/s3331_find_subtree_sizes_after_changes/SolutionTest.kt
+++ b/src/test/kotlin/g3301_3400/s3331_find_subtree_sizes_after_changes/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun findSubtreeSizes() {
         assertThat<IntArray?>(
             Solution().findSubtreeSizes(intArrayOf(-1, 0, 0, 1, 1, 1), "abaabc"),
-            equalTo<IntArray?>(intArrayOf(6, 3, 1, 1, 1, 1))
+            equalTo<IntArray?>(intArrayOf(6, 3, 1, 1, 1, 1)),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun findSubtreeSizes2() {
         assertThat<IntArray?>(
             Solution().findSubtreeSizes(intArrayOf(-1, 0, 4, 0, 1), "abbba"),
-            equalTo<IntArray?>(intArrayOf(5, 2, 1, 1, 1))
+            equalTo<IntArray?>(intArrayOf(5, 2, 1, 1, 1)),
         )
     }
 }
diff --git a/src/test/kotlin/g3301_3400/s3332_maximum_points_tourist_can_earn/SolutionTest.kt b/src/test/kotlin/g3301_3400/s3332_maximum_points_tourist_can_earn/SolutionTest.kt
index 896d918fb..61baa7bc2 100644
--- a/src/test/kotlin/g3301_3400/s3332_maximum_points_tourist_can_earn/SolutionTest.kt
+++ b/src/test/kotlin/g3301_3400/s3332_maximum_points_tourist_can_earn/SolutionTest.kt
@@ -12,9 +12,9 @@ internal class SolutionTest {
                 2,
                 1,
                 arrayOf<IntArray>(intArrayOf(2, 3)),
-                arrayOf<IntArray>(intArrayOf(0, 2), intArrayOf(1, 0))
+                arrayOf<IntArray>(intArrayOf(0, 2), intArrayOf(1, 0)),
             ),
-            equalTo<Int>(3)
+            equalTo<Int>(3),
         )
     }
 
@@ -26,9 +26,9 @@ internal class SolutionTest {
                     3,
                     2,
                     arrayOf<IntArray>(intArrayOf(3, 4, 2), intArrayOf(2, 1, 2)),
-                    arrayOf<IntArray>(intArrayOf(0, 2, 1), intArrayOf(2, 0, 4), intArrayOf(3, 2, 0))
+                    arrayOf<IntArray>(intArrayOf(0, 2, 1), intArrayOf(2, 0, 4), intArrayOf(3, 2, 0)),
                 ),
-            equalTo<Int>(8)
+            equalTo<Int>(8),
         )
     }
 }
diff --git a/src/test/kotlin/g3301_3400/s3334_find_the_maximum_factor_score_of_array/SolutionTest.kt b/src/test/kotlin/g3301_3400/s3334_find_the_maximum_factor_score_of_array/SolutionTest.kt
index 1ee0cd76d..c7f7b17be 100644
--- a/src/test/kotlin/g3301_3400/s3334_find_the_maximum_factor_score_of_array/SolutionTest.kt
+++ b/src/test/kotlin/g3301_3400/s3334_find_the_maximum_factor_score_of_array/SolutionTest.kt
@@ -14,7 +14,7 @@ internal class SolutionTest {
     fun maxScore2() {
         assertThat<Long?>(
             Solution().maxScore(intArrayOf(1, 2, 3, 4, 5)),
-            equalTo<Long?>(60L)
+            equalTo<Long?>(60L),
         )
     }
 
diff --git a/src/test/kotlin/g3301_3400/s3336_find_the_number_of_subsequences_with_equal_gcd/SolutionTest.kt b/src/test/kotlin/g3301_3400/s3336_find_the_number_of_subsequences_with_equal_gcd/SolutionTest.kt
index a68c664c9..a56b337cd 100644
--- a/src/test/kotlin/g3301_3400/s3336_find_the_number_of_subsequences_with_equal_gcd/SolutionTest.kt
+++ b/src/test/kotlin/g3301_3400/s3336_find_the_number_of_subsequences_with_equal_gcd/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun subsequencePairCount() {
         assertThat<Int?>(
             Solution().subsequencePairCount(intArrayOf(1, 2, 3, 4)),
-            equalTo<Int?>(10)
+            equalTo<Int?>(10),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun subsequencePairCount2() {
         assertThat<Int?>(
             Solution().subsequencePairCount(intArrayOf(10, 20, 30)),
-            equalTo<Int?>(2)
+            equalTo<Int?>(2),
         )
     }
 }
diff --git a/src/test/kotlin/g3301_3400/s3337_total_characters_in_string_after_transformations_ii/SolutionTest.kt b/src/test/kotlin/g3301_3400/s3337_total_characters_in_string_after_transformations_ii/SolutionTest.kt
index a5d4182b4..818bc129c 100644
--- a/src/test/kotlin/g3301_3400/s3337_total_characters_in_string_after_transformations_ii/SolutionTest.kt
+++ b/src/test/kotlin/g3301_3400/s3337_total_characters_in_string_after_transformations_ii/SolutionTest.kt
@@ -14,10 +14,10 @@ internal class SolutionTest {
                     2,
                     listOf<Int>(
                         1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-                        1, 1, 1, 1, 1, 2
-                    )
+                        1, 1, 1, 1, 1, 2,
+                    ),
                 ),
-            equalTo<Int>(7)
+            equalTo<Int>(7),
         )
     }
 
@@ -30,10 +30,10 @@ internal class SolutionTest {
                     1,
                     listOf<Int>(
                         2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
-                        2, 2, 2, 2, 2, 2
-                    )
+                        2, 2, 2, 2, 2, 2,
+                    ),
                 ),
-            equalTo<Int>(8)
+            equalTo<Int>(8),
         )
     }
 
@@ -46,10 +46,10 @@ internal class SolutionTest {
                     2826,
                     listOf<Int>(
                         9, 1, 6, 3, 2, 7, 8, 10, 8, 3, 9, 5, 10, 8, 10, 2, 2, 9, 10,
-                        1, 3, 5, 4, 4, 8, 10
-                    )
+                        1, 3, 5, 4, 4, 8, 10,
+                    ),
                 ),
-            equalTo<Int>(557232981)
+            equalTo<Int>(557232981),
         )
     }
 
@@ -62,10 +62,10 @@ internal class SolutionTest {
                     3719,
                     listOf<Int>(
                         5, 3, 8, 1, 4, 2, 2, 4, 5, 2, 8, 5, 8, 2, 6, 10, 8, 1, 4, 1,
-                        7, 4, 2, 4, 7, 5
-                    )
+                        7, 4, 2, 4, 7, 5,
+                    ),
                 ),
-            equalTo<Int>(467065288)
+            equalTo<Int>(467065288),
         )
     }
 }
diff --git a/src/test/kotlin/g3301_3400/s3341_find_minimum_time_to_reach_last_room_i/SolutionTest.kt b/src/test/kotlin/g3301_3400/s3341_find_minimum_time_to_reach_last_room_i/SolutionTest.kt
index 8b5200ff0..0ac218a1d 100644
--- a/src/test/kotlin/g3301_3400/s3341_find_minimum_time_to_reach_last_room_i/SolutionTest.kt
+++ b/src/test/kotlin/g3301_3400/s3341_find_minimum_time_to_reach_last_room_i/SolutionTest.kt
@@ -11,10 +11,10 @@ internal class SolutionTest {
             Solution().minTimeToReach(
                 arrayOf<IntArray>(
                     intArrayOf(0, 4),
-                    intArrayOf(4, 4)
-                )
+                    intArrayOf(4, 4),
+                ),
             ),
-            equalTo<Int?>(6)
+            equalTo<Int?>(6),
         )
     }
 
@@ -24,10 +24,10 @@ internal class SolutionTest {
             Solution().minTimeToReach(
                 arrayOf<IntArray>(
                     intArrayOf(0, 0, 0),
-                    intArrayOf(0, 0, 0)
-                )
+                    intArrayOf(0, 0, 0),
+                ),
             ),
-            equalTo<Int?>(3)
+            equalTo<Int?>(3),
         )
     }
 
@@ -37,10 +37,10 @@ internal class SolutionTest {
             Solution().minTimeToReach(
                 arrayOf<IntArray>(
                     intArrayOf(0, 1),
-                    intArrayOf(1, 2)
-                )
+                    intArrayOf(1, 2),
+                ),
             ),
-            equalTo<Int?>(3)
+            equalTo<Int?>(3),
         )
     }
 }
diff --git a/src/test/kotlin/g3301_3400/s3342_find_minimum_time_to_reach_last_room_ii/SolutionTest.kt b/src/test/kotlin/g3301_3400/s3342_find_minimum_time_to_reach_last_room_ii/SolutionTest.kt
index c694b98f4..74cee9752 100644
--- a/src/test/kotlin/g3301_3400/s3342_find_minimum_time_to_reach_last_room_ii/SolutionTest.kt
+++ b/src/test/kotlin/g3301_3400/s3342_find_minimum_time_to_reach_last_room_ii/SolutionTest.kt
@@ -11,10 +11,10 @@ internal class SolutionTest {
             Solution().minTimeToReach(
                 arrayOf<IntArray>(
                     intArrayOf(0, 4),
-                    intArrayOf(4, 4)
-                )
+                    intArrayOf(4, 4),
+                ),
             ),
-            equalTo<Int?>(7)
+            equalTo<Int?>(7),
         )
     }
 
@@ -22,7 +22,7 @@ internal class SolutionTest {
     fun minTimeToReach2() {
         assertThat<Int?>(
             Solution().minTimeToReach(arrayOf<IntArray>(intArrayOf(0, 0, 0, 0), intArrayOf(0, 0, 0, 0))),
-            equalTo<Int?>(6)
+            equalTo<Int?>(6),
         )
     }
 
@@ -32,10 +32,10 @@ internal class SolutionTest {
             Solution().minTimeToReach(
                 arrayOf<IntArray>(
                     intArrayOf(0, 1),
-                    intArrayOf(1, 2)
-                )
+                    intArrayOf(1, 2),
+                ),
             ),
-            equalTo<Int?>(4)
+            equalTo<Int?>(4),
         )
     }
 }
diff --git a/src/test/kotlin/g3301_3400/s3346_maximum_frequency_of_an_element_after_performing_operations_i/SolutionTest.kt b/src/test/kotlin/g3301_3400/s3346_maximum_frequency_of_an_element_after_performing_operations_i/SolutionTest.kt
index c440d46df..03be30c62 100644
--- a/src/test/kotlin/g3301_3400/s3346_maximum_frequency_of_an_element_after_performing_operations_i/SolutionTest.kt
+++ b/src/test/kotlin/g3301_3400/s3346_maximum_frequency_of_an_element_after_performing_operations_i/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun maxFrequency() {
         assertThat<Int>(
             Solution().maxFrequency(intArrayOf(1, 4, 5), 1, 2),
-            equalTo<Int>(2)
+            equalTo<Int>(2),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun maxFrequency2() {
         assertThat<Int>(
             Solution().maxFrequency(intArrayOf(5, 11, 20, 20), 5, 1),
-            equalTo<Int>(2)
+            equalTo<Int>(2),
         )
     }
 }
diff --git a/src/test/kotlin/g3301_3400/s3347_maximum_frequency_of_an_element_after_performing_operations_ii/SolutionTest.kt b/src/test/kotlin/g3301_3400/s3347_maximum_frequency_of_an_element_after_performing_operations_ii/SolutionTest.kt
index dc4a5faa2..a1afabc22 100644
--- a/src/test/kotlin/g3301_3400/s3347_maximum_frequency_of_an_element_after_performing_operations_ii/SolutionTest.kt
+++ b/src/test/kotlin/g3301_3400/s3347_maximum_frequency_of_an_element_after_performing_operations_ii/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun maxFrequency() {
         assertThat<Int>(
             Solution().maxFrequency(intArrayOf(1, 4, 5), 1, 2),
-            equalTo<Int>(2)
+            equalTo<Int>(2),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun maxFrequency2() {
         assertThat<Int>(
             Solution().maxFrequency(intArrayOf(5, 11, 20, 20), 5, 1),
-            equalTo<Int>(2)
+            equalTo<Int>(2),
         )
     }
 }
diff --git a/src/test/kotlin/g3301_3400/s3348_smallest_divisible_digit_product_ii/SolutionTest.kt b/src/test/kotlin/g3301_3400/s3348_smallest_divisible_digit_product_ii/SolutionTest.kt
index 5f22c77ea..e4066b119 100644
--- a/src/test/kotlin/g3301_3400/s3348_smallest_divisible_digit_product_ii/SolutionTest.kt
+++ b/src/test/kotlin/g3301_3400/s3348_smallest_divisible_digit_product_ii/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun smallestNumber() {
         assertThat<String>(
             Solution().smallestNumber("1234", 256L),
-            equalTo<String>("1488")
+            equalTo<String>("1488"),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun smallestNumber2() {
         assertThat<String>(
             Solution().smallestNumber("12355", 50L),
-            equalTo<String>("12355")
+            equalTo<String>("12355"),
         )
     }
 
diff --git a/src/test/kotlin/g3301_3400/s3349_adjacent_increasing_subarrays_detection_i/SolutionTest.kt b/src/test/kotlin/g3301_3400/s3349_adjacent_increasing_subarrays_detection_i/SolutionTest.kt
index 91b7d6071..b3dd77897 100644
--- a/src/test/kotlin/g3301_3400/s3349_adjacent_increasing_subarrays_detection_i/SolutionTest.kt
+++ b/src/test/kotlin/g3301_3400/s3349_adjacent_increasing_subarrays_detection_i/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun hasIncreasingSubarrays() {
         assertThat<Boolean>(
             Solution().hasIncreasingSubarrays(listOf<Int>(2, 5, 7, 8, 9, 2, 3, 4, 3, 1), 3),
-            equalTo<Boolean>(true)
+            equalTo<Boolean>(true),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun hasIncreasingSubarrays2() {
         assertThat<Boolean>(
             Solution().hasIncreasingSubarrays(listOf<Int>(1, 2, 3, 4, 4, 4, 4, 5, 6, 7), 5),
-            equalTo<Boolean>(false)
+            equalTo<Boolean>(false),
         )
     }
 }
diff --git a/src/test/kotlin/g3301_3400/s3350_adjacent_increasing_subarrays_detection_ii/SolutionTest.kt b/src/test/kotlin/g3301_3400/s3350_adjacent_increasing_subarrays_detection_ii/SolutionTest.kt
index 5985b54ff..72a1657b4 100644
--- a/src/test/kotlin/g3301_3400/s3350_adjacent_increasing_subarrays_detection_ii/SolutionTest.kt
+++ b/src/test/kotlin/g3301_3400/s3350_adjacent_increasing_subarrays_detection_ii/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun maxIncreasingSubarrays() {
         assertThat<Int>(
             Solution().maxIncreasingSubarrays(listOf<Int>(2, 5, 7, 8, 9, 2, 3, 4, 3, 1)),
-            equalTo<Int>(3)
+            equalTo<Int>(3),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun maxIncreasingSubarrays2() {
         assertThat<Int>(
             Solution().maxIncreasingSubarrays(listOf<Int>(1, 2, 3, 4, 4, 4, 4, 5, 6, 7)),
-            equalTo<Int>(2)
+            equalTo<Int>(2),
         )
     }
 }
diff --git a/src/test/kotlin/g3301_3400/s3351_sum_of_good_subsequences/SolutionTest.kt b/src/test/kotlin/g3301_3400/s3351_sum_of_good_subsequences/SolutionTest.kt
index 06db76958..1edc51785 100644
--- a/src/test/kotlin/g3301_3400/s3351_sum_of_good_subsequences/SolutionTest.kt
+++ b/src/test/kotlin/g3301_3400/s3351_sum_of_good_subsequences/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun sumOfGoodSubsequences() {
         assertThat<Int>(
             Solution().sumOfGoodSubsequences(intArrayOf(1, 2, 1)),
-            equalTo<Int>(14)
+            equalTo<Int>(14),
         )
     }
 
@@ -17,7 +17,7 @@ internal class SolutionTest {
     fun sumOfGoodSubsequences2() {
         assertThat<Int>(
             Solution().sumOfGoodSubsequences(intArrayOf(3, 4, 5)),
-            equalTo<Int>(40)
+            equalTo<Int>(40),
         )
     }
 }
diff --git a/src/test/kotlin/g3301_3400/s3354_make_array_elements_equal_to_zero/SolutionTest.kt b/src/test/kotlin/g3301_3400/s3354_make_array_elements_equal_to_zero/SolutionTest.kt
index 902e26996..0a93f3070 100644
--- a/src/test/kotlin/g3301_3400/s3354_make_array_elements_equal_to_zero/SolutionTest.kt
+++ b/src/test/kotlin/g3301_3400/s3354_make_array_elements_equal_to_zero/SolutionTest.kt
@@ -9,14 +9,15 @@ internal class SolutionTest {
     fun countValidSelections() {
         assertThat<Int>(
             Solution().countValidSelections(intArrayOf(1, 0, 2, 0, 3)),
-            equalTo<Int>(2)
+            equalTo<Int>(2),
         )
     }
 
     @Test
     fun countValidSelections2() {
         assertThat<Int>(
-            Solution().countValidSelections(intArrayOf(2, 3, 4, 0, 4, 1, 0)), equalTo<Int>(0)
+            Solution().countValidSelections(intArrayOf(2, 3, 4, 0, 4, 1, 0)),
+            equalTo<Int>(0),
         )
     }
 
@@ -25,7 +26,7 @@ internal class SolutionTest {
         assertThat<Int>(
             Solution()
                 .countValidSelections(intArrayOf(16, 13, 10, 0, 0, 0, 10, 6, 7, 8, 7)),
-            equalTo<Int>(3)
+            equalTo<Int>(3),
         )
     }
 }
diff --git a/src/test/kotlin/g3301_3400/s3355_zero_array_transformation_i/SolutionTest.kt b/src/test/kotlin/g3301_3400/s3355_zero_array_transformation_i/SolutionTest.kt
index efff23361..bfd91c14b 100644
--- a/src/test/kotlin/g3301_3400/s3355_zero_array_transformation_i/SolutionTest.kt
+++ b/src/test/kotlin/g3301_3400/s3355_zero_array_transformation_i/SolutionTest.kt
@@ -10,7 +10,7 @@ internal class SolutionTest {
         assertThat<Boolean>(
             Solution()
                 .isZeroArray(intArrayOf(1, 0, 1), arrayOf<IntArray>(intArrayOf(0, 2))),
-            CoreMatchers.equalTo<Boolean>(true)
+            CoreMatchers.equalTo<Boolean>(true),
         )
     }
 
@@ -19,9 +19,9 @@ internal class SolutionTest {
         assertThat<Boolean>(
             Solution().isZeroArray(
                 intArrayOf(4, 3, 2, 1),
-                arrayOf<IntArray>(intArrayOf(1, 3), intArrayOf(0, 2))
+                arrayOf<IntArray>(intArrayOf(1, 3), intArrayOf(0, 2)),
             ),
-            CoreMatchers.equalTo<Boolean>(false)
+            CoreMatchers.equalTo<Boolean>(false),
         )
     }
 
@@ -30,9 +30,9 @@ internal class SolutionTest {
         assertThat<Boolean>(
             Solution().isZeroArray(
                 intArrayOf(-1, 0, 1),
-                arrayOf<IntArray>(intArrayOf(1, 3), intArrayOf(0, 2))
+                arrayOf<IntArray>(intArrayOf(1, 3), intArrayOf(0, 2)),
             ),
-            CoreMatchers.equalTo<Boolean>(true)
+            CoreMatchers.equalTo<Boolean>(true),
         )
     }
 }
diff --git a/src/test/kotlin/g3301_3400/s3356_zero_array_transformation_ii/SolutionTest.kt b/src/test/kotlin/g3301_3400/s3356_zero_array_transformation_ii/SolutionTest.kt
index 6a7a6e7fb..4bc61f0e9 100644
--- a/src/test/kotlin/g3301_3400/s3356_zero_array_transformation_ii/SolutionTest.kt
+++ b/src/test/kotlin/g3301_3400/s3356_zero_array_transformation_ii/SolutionTest.kt
@@ -11,9 +11,9 @@ internal class SolutionTest {
             Solution()
                 .minZeroArray(
                     intArrayOf(2, 0, 2),
-                    arrayOf<IntArray>(intArrayOf(0, 2, 1), intArrayOf(0, 2, 1), intArrayOf(1, 1, 3))
+                    arrayOf<IntArray>(intArrayOf(0, 2, 1), intArrayOf(0, 2, 1), intArrayOf(1, 1, 3)),
                 ),
-            equalTo<Int>(2)
+            equalTo<Int>(2),
         )
     }
 
@@ -22,7 +22,7 @@ internal class SolutionTest {
         assertThat<Int>(
             Solution()
                 .minZeroArray(intArrayOf(4, 3, 2, 1), arrayOf<IntArray>(intArrayOf(1, 3, 2), intArrayOf(0, 2, 1))),
-            equalTo<Int>(-1)
+            equalTo<Int>(-1),
         )
     }
 }
diff --git a/src/test/kotlin/g3301_3400/s3357_minimize_the_maximum_adjacent_element_difference/SolutionTest.kt b/src/test/kotlin/g3301_3400/s3357_minimize_the_maximum_adjacent_element_difference/SolutionTest.kt
index 232c8e7dd..cade4cbba 100644
--- a/src/test/kotlin/g3301_3400/s3357_minimize_the_maximum_adjacent_element_difference/SolutionTest.kt
+++ b/src/test/kotlin/g3301_3400/s3357_minimize_the_maximum_adjacent_element_difference/SolutionTest.kt
@@ -9,7 +9,7 @@ internal class SolutionTest {
     fun minDifference() {
         assertThat<Int>(
             Solution().minDifference(intArrayOf(1, 2, -1, 10, 8)),
-            equalTo<Int>(4)
+            equalTo<Int>(4),
         )
     }
 
@@ -22,7 +22,7 @@ internal class SolutionTest {
     fun minDifference3() {
         assertThat<Int>(
             Solution().minDifference(intArrayOf(-1, 10, -1, 8)),
-            equalTo<Int>(1)
+            equalTo<Int>(1),
         )
     }
 
@@ -30,7 +30,7 @@ internal class SolutionTest {
     fun minDifference4() {
         assertThat<Int>(
             Solution().minDifference(intArrayOf(14, -1, -1, 46)),
-            equalTo<Int>(11)
+            equalTo<Int>(11),
         )
     }
 }