april 7

Author: YuriSpiridonov

Challenges/2021/April-LeetCoding-Challenge.md

@@ -19,6 +19,7 @@ None
 |622.|[Design Circular Queue](https://leetcode.com/problems/design-circular-queue/)|[Python](/Medium/622.DesignCircularQueue.py)|Medium|
 |775.|[Global and Local Inversions](https://leetcode.com/problems/global-and-local-inversions/)|[Python](/Medium/775.GlobalandLocalInversions.py)|Medium|
 |1551.|[Minimum Operations to Make Array Equal](https://leetcode.com/problems/minimum-operations-to-make-array-equal/)|[Python](/Medium/1551.MinimumOperationstoMakeArrayEqual.py)|Medium|
+|1704.|[Determine if String Halves Are Alike](https://leetcode.com/problems/determine-if-string-halves-are-alike/)|[Python](/Easy/1704.DetermineifStringHalvesAreAlike.py)|Easy|
 
 ## License
 The code is open-source and licensed under the [MIT License](/LICENSE).

Medium/1551.MinimumOperationstoMakeArrayEqual.py

@@ -27,7 +27,6 @@
     Output: 9
 
     Constraints:
-
         - 1 <= n <= 10^4
 '''
 #Difficulty: Medium
@@ -44,4 +43,4 @@ def minOperations(self, n: int) -> int:
         y = 0
         for i in range(n//2):
             y += x - (i*2+1)
-        return y
+        return y

README.md

@@ -22,7 +22,7 @@ In this repository provided my Python solutions of LeetCode problems.
 - [January LeetCoding Challenge](/Challenges/2021/January-LeetCoding-Challenge.md) - 27/31
 - [February LeetCoding Challenge](/Challenges/2021/February-LeetCoding-Challenge.md) - 23/28
 - [March LeetCoding Challenge](/Challenges/2021/March-LeetCoding-Challenge.md) - 23/31
-- [April LeetCoding Challenge](/Challenges/2021/April-LeetCoding-Challenge.md) - 4/30
+- [April LeetCoding Challenge](/Challenges/2021/April-LeetCoding-Challenge.md) - 5/30
 <br><br>
 ## Solutions
 *P.S. If you like this, please leave me a star.* ★