Updated readme.

Author: javadev

README.md

@@ -40,7 +40,20 @@ implementation 'com.github.javadev:leetcode-in-java:1.9'
 |------|----------------|------------------------------------------------------------------------------------------------------------------------------------------|-------------|-------------|----------|---------
 | 2151 |[Maximum Good People Based on Statements](../main/src.save/main/java/g2101_2200/s2151_maximum_good_people_based_on_statements/)| [Java](../main/src.save/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
+| 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
+| 2016 |[Maximum Difference Between Increasing Elements](../main/src/main/java/g2001_2100/s2016_maximum_difference_between_increasing_elements/)| [Java](../main/src/main/java/g2001_2100/s2016_maximum_difference_between_increasing_elements/Solution.java) | Easy | Array | 0 | 100.00
+| 2014 |[Longest Subsequence Repeated k Times](../main/src/main/java/g2001_2100/s2014_longest_subsequence_repeated_k_times/)| [Java](../main/src/main/java/g2001_2100/s2014_longest_subsequence_repeated_k_times/Solution.java) | Hard | String, Greedy, Backtracking, Counting, Enumeration | 169 | 98.59
+| 2013 |[Detect Squares](../main/src/main/java/g2001_2100/s2013_detect_squares/)| [Java](../main/src/main/java/g2001_2100/s2013_detect_squares/DetectSquares.java) | Medium | Array, Hash_Table, Design, Counting | 67 | 88.46
+| 2012 |[Sum of Beauty in the Array](../main/src/main/java/g2001_2100/s2012_sum_of_beauty_in_the_array/)| [Java](../main/src/main/java/g2001_2100/s2012_sum_of_beauty_in_the_array/Solution.java) | Medium | Array | 10 | 44.69
+| 2011 |[Final Value of Variable After Performing Operations](../main/src/main/java/g2001_2100/s2011_final_value_of_variable_after_performing_operations/)| [Java](../main/src/main/java/g2001_2100/s2011_final_value_of_variable_after_performing_operations/Solution.java) | Easy | Array, String, Simulation | 1 | 94.40
+| 2009 |[Minimum Number of Operations to Make Array Continuous](../main/src/main/java/g2001_2100/s2009_minimum_number_of_operations_to_make_array_continuous/)| [Java](../main/src/main/java/g2001_2100/s2009_minimum_number_of_operations_to_make_array_continuous/Solution.java) | Hard | Array, Binary_Search | 57 | 72.43
+| 2008 |[Maximum Earnings From Taxi](../main/src/main/java/g2001_2100/s2008_maximum_earnings_from_taxi/)| [Java](../main/src/main/java/g2001_2100/s2008_maximum_earnings_from_taxi/Solution.java) | Medium | Array, Dynamic_Programming, Sorting, Binary_Search | 116 | 55.59
+| 2007 |[Find Original Array From Doubled Array](../main/src/main/java/g2001_2100/s2007_find_original_array_from_doubled_array/)| [Java](../main/src/main/java/g2001_2100/s2007_find_original_array_from_doubled_array/Solution.java) | Medium | Array, Hash_Table, Sorting, Greedy | 41 | 96.48
+| 2006 |[Count Number of Pairs With Absolute Difference K](../main/src/main/java/g2001_2100/s2006_count_number_of_pairs_with_absolute_difference_k/)| [Java](../main/src/main/java/g2001_2100/s2006_count_number_of_pairs_with_absolute_difference_k/Solution.java) | Easy | Array, Hash_Table, Counting | 8 | 58.60
 | 2003 |[Smallest Missing Genetic Value in Each Subtree](../main/src/main/java/g2001_2100/s2003_smallest_missing_genetic_value_in_each_subtree/)| [Java](../main/src/main/java/g2001_2100/s2003_smallest_missing_genetic_value_in_each_subtree/Solution.java) | Hard | Dynamic_Programming, Depth_First_Search, Tree, Union_Find | 126 | 85.18
 | 2002 |[Maximum Product of the Length of Two Palindromic Subsequences](../main/src/main/java/g2001_2100/s2002_maximum_product_of_the_length_of_two_palindromic_subsequences/)| [Java](../main/src/main/java/g2001_2100/s2002_maximum_product_of_the_length_of_two_palindromic_subsequences/Solution.java) | Medium | String, Dynamic_Programming, Bit_Manipulation, Backtracking, Bitmask | 69 | 89.94
 | 2001 |[Number of Pairs of Interchangeable Rectangles](../main/src/main/java/g2001_2100/s2001_number_of_pairs_of_interchangeable_rectangles/)| [Java](../main/src/main/java/g2001_2100/s2001_number_of_pairs_of_interchangeable_rectangles/Solution.java) | Medium | Array, Hash_Table, Math, Counting, Number_Theory | 34 | 99.02
@@ -692,6 +705,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.9'
 | 1145 |[Binary Tree Coloring Game](../main/src.save/main/java/g1101_1200/s1145_binary_tree_coloring_game/)| [Java](../main/src.save/main/java/g1101_1200/s1145_binary_tree_coloring_game/Solution.java) | Medium | Depth_First_Search, Tree, Binary_Tree | 0 | 100.00
 | 1144 |[Decrease Elements To Make Array Zigzag](../main/src.save/main/java/g1101_1200/s1144_decrease_elements_to_make_array_zigzag/)| [Java](../main/src.save/main/java/g1101_1200/s1144_decrease_elements_to_make_array_zigzag/Solution.java) | Medium | Array, Greedy | 0 | 100.00
 | 1143 |[Longest Common Subsequence](../main/src.save/main/java/g1101_1200/s1143_longest_common_subsequence/)| [Java](../main/src.save/main/java/g1101_1200/s1143_longest_common_subsequence/Solution.java) | Medium | String, Dynamic_Programming, Algorithm_II_Day_17_Dynamic_Programming, Dynamic_Programming_I_Day_19 | 9 | 93.92
+| 1141 |[User Activity for the Past 30 Days I](../main/src.save/main/java/g1101_1200/s1141_user_activity_for_the_past_30_days_i/)| [Sql](../main/src.save/main/java/g1101_1200/s1141_user_activity_for_the_past_30_days_i/script.sql) | Easy | Database, SQL_I_Day_7_Function | 543 | 29.24
 | 1140 |[Stone Game II](../main/src.save/main/java/g1101_1200/s1140_stone_game_ii/)| [Java](../main/src.save/main/java/g1101_1200/s1140_stone_game_ii/Solution.java) | Medium | Array, Dynamic_Programming, Math, Game_Theory | 7 | 68.62
 | 1139 |[Largest 1-Bordered Square](../main/src.save/main/java/g1101_1200/s1139_largest_1_bordered_square/)| [Java](../main/src.save/main/java/g1101_1200/s1139_largest_1_bordered_square/Solution.java) | Medium | Array, Dynamic_Programming, Matrix | 8 | 53.28
 | 1138 |[Alphabet Board Path](../main/src.save/main/java/g1101_1200/s1138_alphabet_board_path/)| [Java](../main/src.save/main/java/g1101_1200/s1138_alphabet_board_path/Solution.java) | Medium | String, Hash_Table | 1 | 76.10
@@ -723,6 +737,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.9'
 | 1091 |[Shortest Path in Binary Matrix](../main/src.save/main/java/g1001_1100/s1091_shortest_path_in_binary_matrix/)| [Java](../main/src.save/main/java/g1001_1100/s1091_shortest_path_in_binary_matrix/Solution.java) | Medium | Array, Breadth_First_Search, Matrix, Algorithm_II_Day_8_Breadth_First_Search_Depth_First_Search, Graph_Theory_I_Day_5_Matrix_Related_Problems | 22 | 69.99
 | 1090 |[Largest Values From Labels](../main/src.save/main/java/g1001_1100/s1090_largest_values_from_labels/)| [Java](../main/src.save/main/java/g1001_1100/s1090_largest_values_from_labels/Solution.java) | Medium | Array, Hash_Table, Sorting, Greedy, Counting | 14 | 95.96
 | 1089 |[Duplicate Zeros](../main/src.save/main/java/g1001_1100/s1089_duplicate_zeros/)| [Java](../main/src.save/main/java/g1001_1100/s1089_duplicate_zeros/Solution.java) | Easy | Array, Two_Pointers | 2 | 67.91
+| 1084 |[Sales Analysis III](../main/src/main/java/g1001_1100/s1084_sales_analysis_iii/)| [Sql](../main/src/main/java/g1001_1100/s1084_sales_analysis_iii/script.sql) | Easy | Database, SQL_I_Day_10_Where | 1066 | 69.71
 | 1081 |[Smallest Subsequence of Distinct Characters](../main/src.save/main/java/g1001_1100/s1081_smallest_subsequence_of_distinct_characters/)| [Java](../main/src.save/main/java/g1001_1100/s1081_smallest_subsequence_of_distinct_characters/Solution.java) | Medium | String, Greedy, Stack, Monotonic_Stack | 2 | 97.16
 | 1080 |[Insufficient Nodes in Root to Leaf Paths](../main/src.save/main/java/g1001_1100/s1080_insufficient_nodes_in_root_to_leaf_paths/)| [Java](../main/src.save/main/java/g1001_1100/s1080_insufficient_nodes_in_root_to_leaf_paths/Solution.java) | Medium | Depth_First_Search, Tree, Binary_Tree | 1 | 76.12
 | 1079 |[Letter Tile Possibilities](../main/src.save/main/java/g1001_1100/s1079_letter_tile_possibilities/)| [Java](../main/src.save/main/java/g1001_1100/s1079_letter_tile_possibilities/Solution.java) | Medium | String, Backtracking | 3 | 86.86
@@ -735,6 +750,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.9'
 | 1053 |[Previous Permutation With One Swap](../main/src.save/main/java/g1001_1100/s1053_previous_permutation_with_one_swap/)| [Java](../main/src.save/main/java/g1001_1100/s1053_previous_permutation_with_one_swap/Solution.java) | Medium | Array, Greedy | 0 | 100.00
 | 1052 |[Grumpy Bookstore Owner](../main/src.save/main/java/g1001_1100/s1052_grumpy_bookstore_owner/)| [Java](../main/src.save/main/java/g1001_1100/s1052_grumpy_bookstore_owner/Solution.java) | Medium | Array, Sliding_Window | 4 | 70.26
 | 1051 |[Height Checker](../main/src.save/main/java/g1001_1100/s1051_height_checker/)| [Java](../main/src.save/main/java/g1001_1100/s1051_height_checker/Solution.java) | Easy | Array, Sorting, Counting_Sort | 1 | 94.01
+| 1050 |[Actors and Directors Who Cooperated At Least Three Times](../main/src/main/java/g1001_1100/s1050_actors_and_directors_who_cooperated_at_least_three_times/)| [Sql](../main/src/main/java/g1001_1100/s1050_actors_and_directors_who_cooperated_at_least_three_times/script.sql) | Easy | Database, SQL_I_Day_10_Where | 344 | 76.48
 | 1049 |[Last Stone Weight II](../main/src.save/main/java/g1001_1100/s1049_last_stone_weight_ii/)| [Java](../main/src.save/main/java/g1001_1100/s1049_last_stone_weight_ii/Solution.java) | Medium | Array, Dynamic_Programming | 2 | 95.98
 | 1048 |[Longest String Chain](../main/src.save/main/java/g1001_1100/s1048_longest_string_chain/)| [Java](../main/src.save/main/java/g1001_1100/s1048_longest_string_chain/Solution.java) | Medium | Array, String, Hash_Table, Dynamic_Programming, Two_Pointers | 23 | 97.92
 | 1047 |[Remove All Adjacent Duplicates In String](../main/src.save/main/java/g1001_1100/s1047_remove_all_adjacent_duplicates_in_string/)| [Java](../main/src.save/main/java/g1001_1100/s1047_remove_all_adjacent_duplicates_in_string/Solution.java) | Easy | String, Stack | 3 | 99.99

src/main/java/g2001_2100/s2095_delete_the_middle_node_of_a_linked_list/Solution.java

@@ -1,7 +1,6 @@
 package g2001_2100.s2095_delete_the_middle_node_of_a_linked_list;
 
-// #Medium #Linked List #Two Pointers
-// 2022_05_23_Time_4_ms_(95.33%)_Space_220.1_MB_(38.17%)
+// #Medium #Two_Pointers #Linked_List #2022_05_24_Time_4_ms_(95.21%)_Space_221.2_MB_(35.96%)
 
 import com_github_leetcode.ListNode;