Robotboy93

class Solution:
    def isPalindrome(self, s: str) -> bool:
        c = 0       
        z = [y.upper() for y in str(s) if y.isalnum()]         
        for i in range(len(z)//2):
                if z[i] != z[len(z)-1-i]:
                    c = c+1
                    break
        return(1-c)
    pass

Robotboy93

class Solution:
    def strStr(self, haystack: str, needle: str) -> int:
        x = [a for a in haystack]
        y = [b for b in needle]
        k = -1       
        if len(y) <= len(x):            
            for i in range(len(x)-len(y)+1):
                if x[i] == y[0]:
                    for j in range(len(y)):
                        if x[i+j] == y[j]:

Robotboy93

class Solution:
    def removeElement(self, nums: List[int], val: int) -> int:
        z = len(nums)
        k = 0
       
        while val in nums:
            for i in range(len(nums)):
                if nums[i] == val:
                    k = k+1
                    del nums[i]

Robotboy93

class Solution:
    def twoSum(self, nums: List[int], target: int) -> List[int]:

        a= b = 0
        
        for i in range(len(nums)):
            c = nums[i]
            del nums[i]
            if (target-c) in nums:
                a = i

Robotboy93

class Solution:
    def isPalindrome(self, x: int) -> bool:   
        c = 0
       
        z = [y for y in str(x)] 
        
        for i in range(len(z)//2):
                if z[i] != z[len(z)-1-i]:
                    c = c+1
                    break