Updated readme.

Author: javadev

README.md

@@ -52,9 +52,46 @@ implementation 'com.github.javadev:leetcode-in-java:1.9'
 | 1796 |[Second Largest Digit in a String](../main/src/main/java/g1701_1800/s1796_second_largest_digit_in_a_string/)| [Java](../main/src/main/java/g1701_1800/s1796_second_largest_digit_in_a_string/Solution.java) | Easy | String, Hash_Table | 2 | 87.67
 | 1795 |[Rearrange Products Table](../main/src/main/java/g1701_1800/s1795_rearrange_products_table/)| [Sql](../main/src/main/java/g1701_1800/s1795_rearrange_products_table/script.sql) | Easy | Database, SQL_I_Day_4_Union_&_Select | 497 | 64.83
 | 1787 |[Make the XOR of All Segments Equal to Zero](../main/src/main/java/g1701_1800/s1787_make_the_xor_of_all_segments_equal_to_zero/)| [Java](../main/src/main/java/g1701_1800/s1787_make_the_xor_of_all_segments_equal_to_zero/Solution.java) | Hard | Array, Dynamic_Programming, Bit_Manipulation | 102 | 89.47
+| 1785 |[Check if Binary String Has at Most One Segment of Ones](../main/src/main/java/g1701_1800/s1785_minimum_elements_to_add_to_form_a_given_sum/)| [Java](../main/src/main/java/g1701_1800/s1785_minimum_elements_to_add_to_form_a_given_sum/Solution.java) | Medium | Array, Greedy | 2 | 70.75
+| 1784 |[Check if Binary String Has at Most One Segment of Ones](../main/src/main/java/g1701_1800/s1784_check_if_binary_string_has_at_most_one_segment_of_ones/)| [Java](../main/src/main/java/g1701_1800/s1784_check_if_binary_string_has_at_most_one_segment_of_ones/Solution.java) | Easy | String | 1 | 65.60
+| 1782 |[Count Pairs Of Nodes](../main/src/main/java/g1701_1800/s1782_count_pairs_of_nodes/)| [Java](../main/src/main/java/g1701_1800/s1782_count_pairs_of_nodes/Solution.java) | Hard | Binary_Search, Two_Pointers, Graph | 128 | 86.96
 | 1781 |[Sum of Beauty of All Substrings](../main/src/main/java/g1701_1800/s1781_sum_of_beauty_of_all_substrings/)| [Java](../main/src/main/java/g1701_1800/s1781_sum_of_beauty_of_all_substrings/Solution.java) | Medium | String, Hash_Table, Counting | 38 | 100.00
+| 1780 |[Check if Number is a Sum of Powers of Three](../main/src/main/java/g1701_1800/s1780_check_if_number_is_a_sum_of_powers_of_three/)| [Java](../main/src/main/java/g1701_1800/s1780_check_if_number_is_a_sum_of_powers_of_three/Solution.java) | Medium | Math | 2 | 19.71
+| 1779 |[Find Nearest Point That Has the Same X or Y Coordinate](../main/src/main/java/g1701_1800/s1779_find_nearest_point_that_has_the_same_x_or_y_coordinate/)| [Java](../main/src/main/java/g1701_1800/s1779_find_nearest_point_that_has_the_same_x_or_y_coordinate/Solution.java) | Easy | Array, Programming_Skills_I_Day_3_Conditional_Statements | 1 | 100.00
+| 1776 |[Car Fleet II](../main/src/main/java/g1701_1800/s1776_car_fleet_ii/)| [Java](../main/src/main/java/g1701_1800/s1776_car_fleet_ii/Solution.java) | Hard | Array, Math, Stack, Heap_Priority_Queue, Monotonic_Stack | 19 | 93.81
+| 1775 |[Equal Sum Arrays With Minimum Number of Operations](../main/src/main/java/g1701_1800/s1775_equal_sum_arrays_with_minimum_number_of_operations/)| [Java](../main/src/main/java/g1701_1800/s1775_equal_sum_arrays_with_minimum_number_of_operations/Solution.java) | Medium | Array, Hash_Table, Greedy, Counting | 16 | 70.88
 | 1774 |[Closest Dessert Cost](../main/src/main/java/g1701_1800/s1774_closest_dessert_cost/)| [Java](../main/src/main/java/g1701_1800/s1774_closest_dessert_cost/Solution.java) | Medium | Array, Dynamic_Programming, Backtracking | 5 | 82.32
+| 1773 |[Count Items Matching a Rule](../main/src/main/java/g1701_1800/s1773_count_items_matching_a_rule/)| [Java](../main/src/main/java/g1701_1800/s1773_count_items_matching_a_rule/Solution.java) | Easy | Array, String | 7 | 25.91
+| 1771 |[Maximize Palindrome Length From Subsequences](../main/src/main/java/g1701_1800/s1771_maximize_palindrome_length_from_subsequences/)| [Java](../main/src/main/java/g1701_1800/s1771_maximize_palindrome_length_from_subsequences/Solution.java) | Hard | String, Dynamic_Programming | 58 | 87.88
+| 1770 |[Maximum Score from Performing Multiplication Operations](../main/src/main/java/g1701_1800/s1770_maximum_score_from_performing_multiplication_operations/)| [Java](../main/src/main/java/g1701_1800/s1770_maximum_score_from_performing_multiplication_operations/Solution.java) | Medium | Array, Dynamic_Programming | 31 | 92.41
+| 1769 |[Minimum Number of Operations to Move All Balls to Each Box](../main/src/main/java/g1701_1800/s1769_minimum_number_of_operations_to_move_all_balls_to_each_box/)| [Java](../main/src/main/java/g1701_1800/s1769_minimum_number_of_operations_to_move_all_balls_to_each_box/Solution.java) | Medium | Array, String | 3 | 91.66
 | 1768 |[Merge Strings Alternately](../main/src/main/java/g1701_1800/s1768_merge_strings_alternately/)| [Java](../main/src/main/java/g1701_1800/s1768_merge_strings_alternately/Solution.java) | Easy | String, Two_Pointers, Programming_Skills_I_Day_8_String | 1 | 86.26
+| 1766 |[Tree of Coprimes](../main/src/main/java/g1701_1800/s1766_tree_of_coprimes/)| [Java](../main/src/main/java/g1701_1800/s1766_tree_of_coprimes/Solution.java) | Hard | Math, Depth_First_Search, Breadth_First_Search, Tree | 111 | 94.07
+| 1765 |[Map of Highest Peak](../main/src/main/java/g1701_1800/s1765_map_of_highest_peak/)| [Java](../main/src/main/java/g1701_1800/s1765_map_of_highest_peak/Solution.java) | Medium | Array, Breadth_First_Search, Matrix | 64 | 85.40
+| 1764 |[Form Array by Concatenating Subarrays of Another Array](../main/src/main/java/g1701_1800/s1764_form_array_by_concatenating_subarrays_of_another_array/)| [Java](../main/src/main/java/g1701_1800/s1764_form_array_by_concatenating_subarrays_of_another_array/Solution.java) | Medium | Array, Greedy, String_Matching | 7 | 16.90
+| 1763 |[Longest Nice Substring](../main/src/main/java/g1701_1800/s1763_longest_nice_substring/)| [Java](../main/src/main/java/g1701_1800/s1763_longest_nice_substring/Solution.java) | Easy | String, Hash_Table, Bit_Manipulation, Sliding_Window | 5 | 61.88
+| 1761 |[Minimum Degree of a Connected Trio in a Graph](../main/src/main/java/g1701_1800/s1761_minimum_degree_of_a_connected_trio_in_a_graph/)| [Java](../main/src/main/java/g1701_1800/s1761_minimum_degree_of_a_connected_trio_in_a_graph/Solution.java) | Hard | Graph | 33 | 89.17
+| 1760 |[Minimum Limit of Balls in a Bag](../main/src/main/java/g1701_1800/s1760_minimum_limit_of_balls_in_a_bag/)| [Java](../main/src/main/java/g1701_1800/s1760_minimum_limit_of_balls_in_a_bag/Solution.java) | Medium | Array, Binary_Search, Binary_Search_II_Day_3 | 44 | 78.49
+| 1759 |[Count Number of Homogenous Substrings](../main/src/main/java/g1701_1800/s1759_count_number_of_homogenous_substrings/)| [Java](../main/src/main/java/g1701_1800/s1759_count_number_of_homogenous_substrings/Solution.java) | Medium | String, Math | 19 | 42.40
+| 1758 |[Minimum Changes To Make Alternating Binary String](../main/src/main/java/g1701_1800/s1758_minimum_changes_to_make_alternating_binary_string/)| [Java](../main/src/main/java/g1701_1800/s1758_minimum_changes_to_make_alternating_binary_string/Solution.java) | Easy | String | 10 | 9.93
+| 1755 |[Closest Subsequence Sum](../main/src/main/java/g1701_1800/s1755_closest_subsequence_sum/)| [Java](../main/src/main/java/g1701_1800/s1755_closest_subsequence_sum/Solution.java) | Hard | Array, Dynamic_Programming, Two_Pointers, Bit_Manipulation, Bitmask | 383 | 87.60
+| 1754 |[Largest Merge Of Two Strings](../main/src/main/java/g1701_1800/s1754_largest_merge_of_two_strings/)| [Java](../main/src/main/java/g1701_1800/s1754_largest_merge_of_two_strings/Solution.java) | Medium | String, Greedy, Two_Pointers | 37 | 89.23
+| 1753 |[Maximum Score From Removing Stones](../main/src/main/java/g1701_1800/s1753_maximum_score_from_removing_stones/)| [Java](../main/src/main/java/g1701_1800/s1753_maximum_score_from_removing_stones/Solution.java) | Medium | Math, Greedy, Heap_Priority_Queue | 0 | 100.00
+| 1752 |[Check if Array Is Sorted and Rotated](../main/src/main/java/g1701_1800/s1752_check_if_array_is_sorted_and_rotated/)| [Java](../main/src/main/java/g1701_1800/s1752_check_if_array_is_sorted_and_rotated/Solution.java) | Easy | Array | 3 | 5.38
+| 1751 |[Maximum Number of Events That Can Be Attended II](../main/src/main/java/g1701_1800/s1751_maximum_number_of_events_that_can_be_attended_ii/)| [Java](../main/src/main/java/g1701_1800/s1751_maximum_number_of_events_that_can_be_attended_ii/Solution.java) | Hard | Array, Dynamic_Programming, Binary_Search | 12 | 98.33
+| 1750 |[Minimum Length of String After Deleting Similar Ends](../main/src/main/java/g1701_1800/s1750_minimum_length_of_string_after_deleting_similar_ends/)| [Java](../main/src/main/java/g1701_1800/s1750_minimum_length_of_string_after_deleting_similar_ends/Solution.java) | Medium | String, Two_Pointers | 5 | 68.68
+| 1749 |[Maximum Absolute Sum of Any Subarray](../main/src/main/java/g1701_1800/s1749_maximum_absolute_sum_of_any_subarray/)| [Java](../main/src/main/java/g1701_1800/s1749_maximum_absolute_sum_of_any_subarray/Solution.java) | Medium | Array, Dynamic_Programming | 3 | 90.60
+| 1748 |[Sum of Unique Elements](../main/src/main/java/g1701_1800/s1748_sum_of_unique_elements/)| [Java](../main/src/main/java/g1701_1800/s1748_sum_of_unique_elements/Solution.java) | Easy | Array, Hash_Table, Counting | 2 | 54.08
+| 1745 |[Palindrome Partitioning IV](../main/src/main/java/g1701_1800/s1745_palindrome_partitioning_iv/)| [Java](../main/src/main/java/g1701_1800/s1745_palindrome_partitioning_iv/Solution.java) | Hard | String, Dynamic_Programming | 10 | 100.00
+| 1744 |[Can You Eat Your Favorite Candy on Your Favorite Day?](../main/src/main/java/g1701_1800/s1744_can_you_eat_your_favorite_candy_on_your_favorite_day/)| [Java](../main/src/main/java/g1701_1800/s1744_can_you_eat_your_favorite_candy_on_your_favorite_day/Solution.java) | Medium | Array, Prefix_Sum | 5 | 100.00
+| 1743 |[Restore the Array From Adjacent Pairs](../main/src/main/java/g1701_1800/s1743_restore_the_array_from_adjacent_pairs/)| [Java](../main/src/main/java/g1701_1800/s1743_restore_the_array_from_adjacent_pairs/Solution.java) | Medium | Array, Hash_Table | 95 | 99.08
+| 1742 |[Maximum Number of Balls in a Box](../main/src/main/java/g1701_1800/s1742_maximum_number_of_balls_in_a_box/)| [Java](../main/src/main/java/g1701_1800/s1742_maximum_number_of_balls_in_a_box/Solution.java) | Easy | Hash_Table, Math, Counting | 7 | 98.87
+| 1739 |[Building Boxes](../main/src/main/java/g1701_1800/s1739_building_boxes/)| [Java](../main/src/main/java/g1701_1800/s1739_building_boxes/Solution.java) | Hard | Math, Greedy, Binary_Search | 1 | 84.38
+| 1738 |[Find Kth Largest XOR Coordinate Value](../main/src/main/java/g1701_1800/s1738_find_kth_largest_xor_coordinate_value/)| [Java](../main/src/main/java/g1701_1800/s1738_find_kth_largest_xor_coordinate_value/Solution.java) | Medium | Array, Matrix, Bit_Manipulation, Heap_Priority_Queue, Prefix_Sum, Divide_and_Conquer, Quickselect | 40 | 97.08
+| 1737 |[Change Minimum Characters to Satisfy One of Three Conditions](../main/src/main/java/g1701_1800/s1737_change_minimum_characters_to_satisfy_one_of_three_conditions/)| [Java](../main/src/main/java/g1701_1800/s1737_change_minimum_characters_to_satisfy_one_of_three_conditions/Solution.java) | Medium | String, Hash_Table, Prefix_Sum, Counting | 8 | 87.70
+| 1736 |[Latest Time by Replacing Hidden Digits](../main/src/main/java/g1701_1800/s1736_latest_time_by_replacing_hidden_digits/)| [Java](../main/src/main/java/g1701_1800/s1736_latest_time_by_replacing_hidden_digits/Solution.java) | Easy | String, Greedy | 3 | 35.96
+| 1735 |[Count Ways to Make Array With Product](../main/src/main/java/g1701_1800/s1735_count_ways_to_make_array_with_product/)| [Java](../main/src/main/java/g1701_1800/s1735_count_ways_to_make_array_with_product/Solution.java) | Hard | Array, Dynamic_Programming, Math | 189 | 43.75
+| 1734 |[Decode XORed Permutation](../main/src/main/java/g1701_1800/s1734_decode_xored_permutation/)| [Java](../main/src/main/java/g1701_1800/s1734_decode_xored_permutation/Solution.java) | Medium | Array, Bit_Manipulation | 6 | 34.52
 | 1733 |[Minimum Number of People to Teach](../main/src/main/java/g1701_1800/s1733_minimum_number_of_people_to_teach/)| [Java](../main/src/main/java/g1701_1800/s1733_minimum_number_of_people_to_teach/Solution.java) | Medium | Array, Greedy | 11 | 98.57
 | 1732 |[Find the Highest Altitude](../main/src/main/java/g1701_1800/s1732_find_the_highest_altitude/)| [Java](../main/src/main/java/g1701_1800/s1732_find_the_highest_altitude/Solution.java) | Easy | Array, Prefix_Sum | 0 | 100.00
 | 1728 |[Cat and Mouse II](../main/src/main/java/g1701_1800/s1728_cat_and_mouse_ii/)| [Java](../main/src/main/java/g1701_1800/s1728_cat_and_mouse_ii/Solution.java) | Hard | Dynamic_Programming, Math, Breadth_First_Search, Graph, Memoization, Game_Theory | 12 | 99.12