Updated readme.

Author: javadev

README.md

@@ -1848,6 +1848,19 @@ implementation 'com.github.javadev:leetcode-in-java:1.15'
 
 | #    |      Title     | Difficulty  | Tag         | Time, ms | Time, %
 |------|----------------|-------------|-------------|----------|---------
+| 2426 |[Number of Pairs Satisfying Inequality](src/main/java/g2401_2500/s2426_number_of_pairs_satisfying_inequality/Solution.java)| Hard | Array, Binary_Search, Ordered_Set, Divide_and_Conquer, Segment_Tree, Binary_Indexed_Tree, Merge_Sort | 12 | 99.69
+| 2425 |[Bitwise XOR of All Pairings](src/main/java/g2401_2500/s2425_bitwise_xor_of_all_pairings/Solution.java)| Medium | Array, Bit_Manipulation, Brainteaser | 5 | 38.15
+| 2424 |[Longest Uploaded Prefix](src/main/java/g2401_2500/s2424_longest_uploaded_prefix/LUPrefix.java)| Medium | Binary_Search, Design, Union_Find, Ordered_Set, Segment_Tree, Binary_Indexed_Tree, Heap_(Priority_Queue) | 35 | 99.68
+| 2423 |[Remove Letter To Equalize Frequency](src/main/java/g2401_2500/s2423_remove_letter_to_equalize_frequency/Solution.java)| Easy | String, Hash_Table, Counting | 1 | 75.41
+| 2421 |[Number of Good Paths](src/main/java/g2401_2500/s2421_number_of_good_paths/Solution.java)| Hard | Array, Tree, Graph, Union_Find | 31 | 99.43
+| 2420 |[Find All Good Indices](src/main/java/g2401_2500/s2420_find_all_good_indices/Solution.java)| Medium | Array, Dynamic_Programming, Prefix_Sum | 13 | 82.76
+| 2419 |[Longest Subarray With Maximum Bitwise AND](src/main/java/g2401_2500/s2419_longest_subarray_with_maximum_bitwise_and/Solution.java)| Medium | Array, Bit_Manipulation, Brainteaser | 4 | 83.94
+| 2418 |[Sort the People](src/main/java/g2401_2500/s2418_sort_the_people/Solution.java)| Easy | Array, String, Hash_Table, Sorting | 3 | 99.81
+| 2416 |[Sum of Prefix Scores of Strings](src/main/java/g2401_2500/s2416_sum_of_prefix_scores_of_strings/Solution.java)| Hard | Array, String, Counting, Trie | 179 | 94.98
+| 2415 |[Reverse Odd Levels of Binary Tree](src/main/java/g2401_2500/s2415_reverse_odd_levels_of_binary_tree/Solution.java)| Medium | Tree, Binary_Tree, Depth_First_Search, Breadth_First_Search | 12 | 64.14
+| 2414 |[Length of the Longest Alphabetical Continuous Substring](src/main/java/g2401_2500/s2414_length_of_the_longest_alphabetical_continuous_substring/Solution.java)| Medium | String | 28 | 36.44
+| 2413 |[Smallest Even Multiple](src/main/java/g2401_2500/s2413_smallest_even_multiple/Solution.java)| Easy | Math, Number_Theory | 0 | 100.00
+| 2412 |[Minimum Money Required Before Transactions](src/main/java/g2401_2500/s2412_minimum_money_required_before_transactions/Solution.java)| Hard | Array, Sorting, Greedy | 4 | 97.57
 | 2411 |[Smallest Subarrays With Maximum Bitwise OR](src/main/java/g2401_2500/s2411_smallest_subarrays_with_maximum_bitwise_or/Solution.java)| Medium | Array, Binary_Search, Bit_Manipulation, Sliding_Window | 31 | 95.05
 | 2410 |[Maximum Matching of Players With Trainers](src/main/java/g2401_2500/s2410_maximum_matching_of_players_with_trainers/Solution.java)| Medium | Array, Sorting, Greedy, Two_Pointers | 28 | 98.31
 | 2409 |[Count Days Spent Together](src/main/java/g2401_2500/s2409_count_days_spent_together/Solution.java)| Easy | String, Math | 0 | 100.00