Updated readme.

Author: javadev

README.md

@@ -40,15 +40,28 @@ implementation 'com.github.javadev:leetcode-in-java:1.10'
 |------|----------------|------------------------------------------------------------------------------------------------------------------------------------------|-------------|-------------|----------|---------
 | 2151 |[Maximum Good People Based on Statements](../main/src/main/java/g2101_2200/s2151_maximum_good_people_based_on_statements/)| [Java](../main/src/main/java/g2101_2200/s2151_maximum_good_people_based_on_statements/Solution.java) | Hard | Array, Bit_Manipulation, Backtracking, Enumeration | 76 | 47.57
 | 2100 |[Find Good Days to Rob the Bank](../main/src/main/java/g2001_2100/s2100_find_good_days_to_rob_the_bank/)| [Java](../main/src/main/java/g2001_2100/s2100_find_good_days_to_rob_the_bank/Solution.java) | Medium | Array, Dynamic_Programming, Prefix_Sum | 13 | 46.46
+| 2099 |[Find Subsequence of Length K With the Largest Sum](../main/src/main/java/g2001_2100/s2099_find_subsequence_of_length_k_with_the_largest_sum/)| [Java](../main/src/main/java/g2001_2100/s2099_find_subsequence_of_length_k_with_the_largest_sum/Solution.java) | Easy | Array, Hash_Table, Sorting, Heap_Priority_Queue | 6 | 85.46
 | 2097 |[Valid Arrangement of Pairs](../main/src/main/java/g2001_2100/s2097_valid_arrangement_of_pairs/)| [Java](../main/src/main/java/g2001_2100/s2097_valid_arrangement_of_pairs/Solution.java) | Hard | Depth_First_Search, Graph, Eulerian_Circuit | 158 | 100.00
 | 2096 |[Step-By-Step Directions From a Binary Tree Node to Another](../main/src/main/java/g2001_2100/s2096_step_by_step_directions_from_a_binary_tree_node_to_another/)| [Java](../main/src/main/java/g2001_2100/s2096_step_by_step_directions_from_a_binary_tree_node_to_another/Solution.java) | Medium | String, Depth_First_Search, Tree, Binary_Tree | 30 | 76.29
 | 2095 |[Delete the Middle Node of a Linked List](../main/src/main/java/g2001_2100/s2095_delete_the_middle_node_of_a_linked_list/)| [Java](../main/src/main/java/g2001_2100/s2095_delete_the_middle_node_of_a_linked_list/Solution.java) | Medium | Two_Pointers, Linked_List | 4 | 95.21
 | 2094 |[Finding 3-Digit Even Numbers](../main/src/main/java/g2001_2100/s2094_finding_3_digit_even_numbers/)| [Java](../main/src/main/java/g2001_2100/s2094_finding_3_digit_even_numbers/Solution.java) | Easy | Array, Hash_Table, Sorting, Enumeration | 2 | 99.62
 | 2090 |[K Radius Subarray Averages](../main/src/main/java/g2001_2100/s2090_k_radius_subarray_averages/)| [Java](../main/src/main/java/g2001_2100/s2090_k_radius_subarray_averages/Solution.java) | Medium | Array, Sliding_Window | 12 | 83.19
 | 2080 |[Range Frequency Queries](../main/src/main/java/g2001_2100/s2080_range_frequency_queries/)| [Java](../main/src/main/java/g2001_2100/s2080_range_frequency_queries/RangeFreqQuery.java) | Medium | Array, Hash_Table, Binary_Search, Design, Segment_Tree | 140 | 97.86
 | 2079 |[Watering Plants](../main/src/main/java/g2001_2100/s2079_watering_plants/)| [Java](../main/src/main/java/g2001_2100/s2079_watering_plants/Solution.java) | Medium | Array | 0 | 100
+| 2057 |[Smallest Index With Equal Value](../main/src/main/java/g2001_2100/s2057_smallest_index_with_equal_value/)| [Java](../main/src/main/java/g2001_2100/s2057_smallest_index_with_equal_value/Solution.java) | Easy | Array | 1 | 94.39
+| 2055 |[Plates Between Candles](../main/src/main/java/g2001_2100/s2055_plates_between_candles/)| [Java](../main/src/main/java/g2001_2100/s2055_plates_between_candles/Solution.java) | Medium | Array, String, Binary_Search, Prefix_Sum | 10 | 92.49
 | 2054 |[Two Best Non-Overlapping Events](../main/src/main/java/g2001_2100/s2054_two_best_non_overlapping_events/)| [Java](../main/src/main/java/g2001_2100/s2054_two_best_non_overlapping_events/Solution.java) | Medium | Array, Dynamic_Programming, Sorting, Binary_Search, Heap_Priority_Queue | 58 | 70.59
 | 2053 |[Kth Distinct String in an Array](../main/src/main/java/g2001_2100/s2053_kth_distinct_string_in_an_array/)| [Java](../main/src/main/java/g2001_2100/s2053_kth_distinct_string_in_an_array/Solution.java) | Easy | Array, String, Hash_Table, Counting | 7 | 65.75
+| 2050 |[Parallel Courses III](../main/src/main/java/g2001_2100/s2050_parallel_courses_iii/)| [Java](../main/src/main/java/g2001_2100/s2050_parallel_courses_iii/Solution.java) | Hard | Dynamic_Programming, Graph, Topological_Sort | 33 | 86.04
+| 2049 |[Count Nodes With the Highest Score](../main/src/main/java/g2001_2100/s2049_count_nodes_with_the_highest_score/)| [Java](../main/src/main/java/g2001_2100/s2049_count_nodes_with_the_highest_score/Solution.java) | Medium | Array, Depth_First_Search, Tree, Binary_Tree | 40 | 93.75
+| 2048 |[Next Greater Numerically Balanced Number](../main/src/main/java/g2001_2100/s2048_next_greater_numerically_balanced_number/)| [Java](../main/src/main/java/g2001_2100/s2048_next_greater_numerically_balanced_number/Solution.java) | Medium | Math, Backtracking, Enumeration | 2 | 95.19
+| 2047 |[Number of Valid Words in a Sentence](../main/src/main/java/g2001_2100/s2047_number_of_valid_words_in_a_sentence/)| [Java](../main/src/main/java/g2001_2100/s2047_number_of_valid_words_in_a_sentence/Solution.java) | Easy | String | 19 | 42.57
+| 2045 |[Second Minimum Time to Reach Destination](../main/src/main/java/g2001_2100/s2045_second_minimum_time_to_reach_destination/)| [Java](../main/src/main/java/g2001_2100/s2045_second_minimum_time_to_reach_destination/Solution.java) | Hard | Breadth_First_Search, Graph, Shortest_Path | 65 | 74.03
+| 2044 |[Count Number of Maximum Bitwise-OR Subsets](../main/src/main/java/g2001_2100/s2044_count_number_of_maximum_bitwise_or_subsets/)| [Java](../main/src/main/java/g2001_2100/s2044_count_number_of_maximum_bitwise_or_subsets/Solution.java) | Medium | Array, Bit_Manipulation, Backtracking | 12 | 58.97
+| 2043 |[Simple Bank System](../main/src/main/java/g2001_2100/s2043_simple_bank_system/)| [Java](../main/src/main/java/g2001_2100/s2043_simple_bank_system/Bank.java) | Medium | Array, Hash_Table, Design, Simulation | 159 | 48.01
+| 2042 |[Check if Numbers Are Ascending in a Sentence](../main/src/main/java/g2001_2100/s2042_check_if_numbers_are_ascending_in_a_sentence/)| [Java](../main/src/main/java/g2001_2100/s2042_check_if_numbers_are_ascending_in_a_sentence/Solution.java) | Easy | String | 2 | 75.46
+| 2040 |[Kth Smallest Product of Two Sorted Arrays](../main/src/main/java/g2001_2100/s2040_kth_smallest_product_of_two_sorted_arrays/)| [Java](../main/src/main/java/g2001_2100/s2040_kth_smallest_product_of_two_sorted_arrays/Solution.java) | Hard | Array, Binary_Search | 635 | 75.24
+| 2038 |[Remove Colored Pieces if Both Neighbors are the Same Color](../main/src/main/java/g2001_2100/s2038_remove_colored_pieces_if_both_neighbors_are_the_same_color/)| [Java](../main/src/main/java/g2001_2100/s2038_remove_colored_pieces_if_both_neighbors_are_the_same_color/Solution.java) | Medium | String, Math, Greedy, Game_Theory | 22 | 47.78
 | 2037 |[Minimum Number of Moves to Seat Everyone](../main/src/main/java/g2001_2100/s2037_minimum_number_of_moves_to_seat_everyone/)| [Java](../main/src/main/java/g2001_2100/s2037_minimum_number_of_moves_to_seat_everyone/Solution.java) | Easy | Array, Sorting | 5 | 22.01
 | 2035 |[Partition Array Into Two Arrays to Minimize Sum Difference](../main/src/main/java/g2001_2100/s2035_partition_array_into_two_arrays_to_minimize_sum_difference/)| [Java](../main/src/main/java/g2001_2100/s2035_partition_array_into_two_arrays_to_minimize_sum_difference/Solution.java) | Hard | Array, Dynamic_Programming, Binary_Search, Two_Pointers, Bit_Manipulation, Ordered_Set, Bitmask | 1336 | 39.36
 | 2034 |[Stock Price Fluctuation](../main/src/main/java/g2001_2100/s2034_stock_price_fluctuation/)| [Java](../main/src/main/java/g2001_2100/s2034_stock_price_fluctuation/StockPrice.java) | Medium | Hash_Table, Design, Heap_Priority_Queue, Ordered_Set, Data_Stream | 163 | 65.51
@@ -57,7 +70,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.10'
 | 2030 |[Smallest K-Length Subsequence With Occurrences of a Letter](../main/src/main/java/g2001_2100/s2030_smallest_k_length_subsequence_with_occurrences_of_a_letter/)| [Java](../main/src/main/java/g2001_2100/s2030_smallest_k_length_subsequence_with_occurrences_of_a_letter/Solution.java) | Hard | String, Greedy, Stack, Monotonic_Stack | 131 | 64.46
 | 2029 |[Stone Game IX](../main/src/main/java/g2001_2100/s2029_stone_game_ix/)| [Java](../main/src/main/java/g2001_2100/s2029_stone_game_ix/Solution.java) | Medium | Array, Math, Greedy, Counting, Game_Theory | 31 | 10.87
 | 2028 |[Find Missing Observations](../main/src/main/java/g2001_2100/s2028_find_missing_observations/)| [Java](../main/src/main/java/g2001_2100/s2028_find_missing_observations/Solution.java) | Medium | Array, Math, Simulation | 10 | 31.40
-| 2027 |[Minimum Moves to Convert String](../main/src/main/java/g2001_2100/s2027_minimum_moves_to_convert_string/)| [Java](../main/src/main/java/g2001_2100/s2027_minimum_moves_to_convert_string/Solution.java) | Easy | String, Greedy | 4 | 5.74
+| 2027 |[Minimum Moves to Convert String](../main/src/main/java/g2001_2100/s2027_minimum_moves_to_convert_string/)| [Java](../main/src/main/java/g2001_2100/s2027_minimum_moves_to_convert_string/Solution.java) | Easy | String, Greedy | 0 | 100.00
 | 2025 |[Maximum Number of Ways to Partition an Array](../main/src/main/java/g2001_2100/s2025_maximum_number_of_ways_to_partition_an_array/)| [Java](../main/src/main/java/g2001_2100/s2025_maximum_number_of_ways_to_partition_an_array/Solution.java) | Hard | Array, Hash_Table, Prefix_Sum, Counting, Enumeration | 172 | 100.00
 | 2024 |[Maximize the Confusion of an Exam](../main/src/main/java/g2001_2100/s2024_maximize_the_confusion_of_an_exam/)| [Java](../main/src/main/java/g2001_2100/s2024_maximize_the_confusion_of_an_exam/Solution.java) | Medium | String, Binary_Search, Prefix_Sum, Sliding_Window | 21 | 44.78
 | 2023 |[Number of Pairs of Strings With Concatenation Equal to Target](../main/src/main/java/g2001_2100/s2023_number_of_pairs_of_strings_with_concatenation_equal_to_target/)| [Java](../main/src/main/java/g2001_2100/s2023_number_of_pairs_of_strings_with_concatenation_equal_to_target/Solution.java) | Medium | Array, String | 36 | 36.00