Skip to content

Commit 2e1eeba

Browse files
committed
Updated README.md
1 parent 7e9c937 commit 2e1eeba

File tree

1 file changed

+2
-1
lines changed

1 file changed

+2
-1
lines changed

README.md

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -57,6 +57,7 @@ go clean -testcache
5757
| [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 |
5858
| [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 |
5959
| [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 |
60+
| [680](https://leetcode.com/problems/valid-palindrome-ii/description/) | [Valid Palindrome II](/easy/680_valid_palindrome_II) | easy | _`Two Pointers`_ | Have a helper function which has the same structure as the main function. Use 2 pointers to check the +1 or -1 element whether they are equal or not |
6061

6162
## Workflow 🌊
6263

@@ -73,13 +74,13 @@ go clean -testcache
7374
- Update `README.md` with current stats
7475
- Automaticall commits and pushes the changes
7576

76-
7777
## Statistics 📊
7878

7979
- Easy: 4 solutions
8080
- Medium: 16 solutions
8181
- Hard: 2 solutions
8282
- Total: 22 solutions
83+
8384
## License 🪪
8485

8586
```txt

0 commit comments

Comments
 (0)