1
class Solution:
2
    def isPalindrome(self, s: str) -> bool:
3
        clean_lst = [ch.lower() for ch in s if ch.isalnum()]
4
        reverse_lst = clean_lst[ : :-1]
5
        clean_s = "".join(clean_lst)
6
        revers_s = "".join(reverse_lst)
7
        if clean_s == revers_s:
8
            return True
9
        else:
10
            return False

1
class Solution:
2
    def rotate(self, nums: List[int], k: int) -> None:
3
        """
4
        Do not return anything, modify nums in-place instead.
5
        """
6
        n = len(nums)
7
        k = k % n
8
        nums[ : ] = nums[-k: ] + nums[ : -k]

1
from collections import defaultdict
2
class Solution:
3
    def groupAnagrams(self, strs: List[str]) -> List[List[str]]:
4
        ans = defaultdict(list)
5
        for s in strs:
6
            key = tuple(sorted(s))
7
            ans[key].append(s)
8
        return list(ans.values())

1
class Solution:
2
    def reverseWords(self, s: str) -> str:
3
        t = s.split()
4
        t[ : ] = t[  : :-1]
5
        return " ".join(t)

1
class Solution:
2
    def longestCommonPrefix(self, strs: List[str]) -> str:
3
        res = ""
4
        for trdlst in zip(*strs):
5
            if len(set(trdlst)) == 1 :
6
                res += trdlst[0]
7
            else: break
8
        return res