Updated README.md

Author: LuaanNguyen

README.md

@@ -56,6 +56,7 @@ go clean -testcache
 |                                 [229](https://leetcode.com/problems/majority-element-ii/description/)                                 | [Sort Colors](/medium/229_majority_element_II)                                                                              |          medium           |                                     _`Counter`_ _`Hashmap`_                                      | There can be at most 2 such elements with floor(n /3). Do a first pass to find all and eliminate all the non-qualify elements, then the second pass check how many time a each candidate appear in the original array. |
 |                          [167](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/description/)                           | [Two Sum II - Input Array Is Sorted](/medium/167_two_sum_II_input_array_is_sorted)                                          |          medium           |                                         _`Two Pointers`_                                         |                       We know that the array is sorted in asc order. We can track the total sum of 2 pointers left and right and increase or decrease their indices accordingly in a while loop                        |
 |                                         [15](https://leetcode.com/problems/3sum/description/)                                         | [3Sum](/medium/15_3sum)                                                                                                     |          medium           |                                         _`Two Pointers`_                                         |                            Interate through the array, initialize 2 other pointers j = i + 1 and k = n - 1 and check the sum and adjust j and k accordingly. Make sure to check duplicates                             |
+|                 [3375](https://leetcode.com/problems/minimum-operations-to-make-array-values-equal-to-k/description)                  | [3Sum](/easy/3375_minimum_operations_to_make_array_values_equal_to_k)                                                       |          medium           |                                           _`Hashmap`_                                            |                                   There is no solution if a value that smaller than k. If a value is larger than k, we add it to our set and count the length of the set at the end                                    |
 
 ## Workflow 🌊