new cases MoveZeros and ValidPalindrom - easy litcode

Author: GishB

InterviewAlgorithms/MoveZeros.py

@@ -0,0 +1,42 @@
+# Given an integer array nums, move all 0's to the end of it while maintaining the relative order of the non-zero elements.
+#
+# Note that you must do this in-place without making a copy of the array.
+
+# Example 1:
+#
+# Input: nums = [0,1,0,3,12]
+# Output: [1,3,12,0,0]
+#
+# Example 2:
+#
+# Input: nums = [0]
+# Output: [0]
+
+from typing import List
+
+def moveZeroes(nums: List[int]) -> None:
+    """
+    Do not return anything, modify nums in-place instead.
+    """
+    length = len(nums)
+    first_ind = 0
+    second_ind = first_ind + 1
+    while second_ind < length:
+        left_val = nums[first_ind]
+        right_val = nums[second_ind]
+        # обновляем оба индекса так как их значения не нулевые.
+        if (left_val != 0 and right_val != 0) or (left_val !=0 and right_val == 0):
+            first_ind += 1
+            second_ind += 1
+        # обновляем только правый индекс.
+        elif left_val == 0 and right_val == 0:
+            second_ind += 1
+        # swap values
+        else:
+            nums[first_ind], nums[second_ind] = nums[second_ind], nums[first_ind]
+    print(nums)
+
+
+if __name__ == "__main__":
+    # https: // leetcode.com / problems / move - zeroes / description /
+    moveZeroes([0,1,0,3,12])

InterviewAlgorithms/ValidPalindrom.py

@@ -0,0 +1,44 @@
+# A phrase is a palindrome if, after converting all uppercase letters into lowercase letters and removing all non-alphanumeric characters,
+# it reads the same forward and backward. Alphanumeric characters include letters and numbers.
+#
+# Given a string s, return true if it is a palindrome, or false otherwise.
+
+# Example 1:
+#
+# Input: s = "A man, a plan, a canal: Panama"
+# Output: true
+
+# Explanation: "amanaplanacanalpanama" is a palindrome.
+
+# Example 2:
+#
+# Input: s = "race a car"
+# Output: false
+# Explanation: "raceacar" is not a palindrome.
+#
+# Constraints:
+#
+#     1 <= s.length <= 2 * 105
+#     s consists only of printable ASCII characters.
+
+def isPalindrome(s: str) -> bool:
+    condition = True
+    s = s.lower().strip()
+    s = [letter for letter in s if letter.isalnum()]
+    if s == 1:
+        return condition
+    else:
+        index_left = 0
+        index_right = len(s) - 1
+        while index_left < index_right and condition:
+            condition = s[index_left] == s[index_right]
+            if condition:
+                index_left += 1
+                index_right -= 1
+            else:
+                break
+        return condition
+
+if __name__ == "__main__":
+    print(isPalindrome("ab!#ba"))
+