Updated readme.

Author: javadev

README.md

@@ -53,9 +53,16 @@ implementation 'com.github.javadev:leetcode-in-java:1.10'
 | 2087 |[Minimum Cost Homecoming of a Robot in a Grid](../main/src/main/java/g2001_2100/s2087_minimum_cost_homecoming_of_a_robot_in_a_grid/)| [Java](../main/src/main/java/g2001_2100/s2087_minimum_cost_homecoming_of_a_robot_in_a_grid/Solution.java) | Medium | Array, Greedy, Matrix | 2 | 79.89
 | 2086 |[Minimum Number of Buckets Required to Collect Rainwater from Houses](../main/src/main/java/g2001_2100/s2086_minimum_number_of_buckets_required_to_collect_rainwater_from_houses/)| [Java](../main/src/main/java/g2001_2100/s2086_minimum_number_of_buckets_required_to_collect_rainwater_from_houses/Solution.java) | Medium | String, Dynamic_Programming, Greedy | 8 | 73.71
 | 2085 |[Count Common Words With One Occurrence](../main/src/main/java/g2001_2100/s2085_count_common_words_with_one_occurrence/)| [Java](../main/src/main/java/g2001_2100/s2085_count_common_words_with_one_occurrence/Solution.java) | Easy | Array, String, Hash_Table, Counting | 6 | 77.66
+| 2081 |[Sum of k-Mirror Numbers](../main/src/main/java/g2001_2100/s2081_sum_of_k_mirror_numbers/)| [Java](../main/src/main/java/g2001_2100/s2081_sum_of_k_mirror_numbers/Solution.java) | Hard | Math, Enumeration | 759 | 81.69
 | 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
+| 2078 |[Two Furthest Houses With Different Colors](../main/src/main/java/g2001_2100/s2078_two_furthest_houses_with_different_colors/)| [Java](../main/src/main/java/g2001_2100/s2078_two_furthest_houses_with_different_colors/Solution.java) | Easy | Array, Greedy | 0 | 100.00
+| 2076 |[Process Restricted Friend Requests](../main/src/main/java/g2001_2100/s2076_process_restricted_friend_requests/)| [Java](../main/src/main/java/g2001_2100/s2076_process_restricted_friend_requests/Solution.java) | Hard | Graph, Union_Find | 102 | 55.25
+| 2075 |[Decode the Slanted Ciphertext](../main/src/main/java/g2001_2100/s2075_decode_the_slanted_ciphertext/)| [Java](../main/src/main/java/g2001_2100/s2075_decode_the_slanted_ciphertext/Solution.java) | Medium | String, Simulation | 48 | 68.23
+| 2074 |[Reverse Nodes in Even Length Groups](../main/src/main/java/g2001_2100/s2074_reverse_nodes_in_even_length_groups/)| [Java](../main/src/main/java/g2001_2100/s2074_reverse_nodes_in_even_length_groups/Solution.java) | Medium | Linked_List | 9 | 62.36
 | 2073 |[Time Needed to Buy Tickets](../main/src/main/java/g2001_2100/s2073_time_needed_to_buy_tickets/)| [Java](../main/src/main/java/g2001_2100/s2073_time_needed_to_buy_tickets/Solution.java) | Easy | Array, Simulation, Queue | 0 | 100.00
+| 2068 |[Check Whether Two Strings are Almost Equivalent](../main/src/main/java/g2001_2100/s2068_check_whether_two_strings_are_almost_equivalent/)| [Java](../main/src/main/java/g2001_2100/s2068_check_whether_two_strings_are_almost_equivalent/Solution.java) | Easy | String, Hash_Table, Counting | 1 | 95.21
+| 2059 |[Minimum Operations to Convert Number](../main/src/main/java/g2001_2100/s2059_minimum_operations_to_convert_number/)| [Java](../main/src/main/java/g2001_2100/s2059_minimum_operations_to_convert_number/Solution.java) | Medium | Array, Breadth_First_Search | 97 | 64.14
 | 2058 |[Find the Minimum and Maximum Number of Nodes Between Critical Points](../main/src/main/java/g2001_2100/s2058_find_the_minimum_and_maximum_number_of_nodes_between_critical_points/)| [Java](../main/src/main/java/g2001_2100/s2058_find_the_minimum_and_maximum_number_of_nodes_between_critical_points/Solution.java) | Medium | Linked_List | 4 | 100.00
 | 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