main.py

def hasDuplicate(nums):
    dic = {}
    for item in nums:
        if item in dic.keys():
            return True
        else:
            dic[item] = None
    return False
    
def isAnagram(s , t):
    dic = {}
    for c_s in s:
        if c_s in dic.keys():
            dic[c_s] += 1
        else:
            dic[c_s] = 1
    print(s)
    print(dic)
    for c_t in t:
        if c_t in dic.keys():
            dic[c_t] -= 1
        else:
            return False
    print(dic)
    for index in dic:
        if dic[index] != 0:
            return False
    return True

def twoSum(nums , target):
    for i in range(len(nums)):
        if target - nums[i] in nums[i+1:]:
            for j in range(i+1,len(nums)):
                if nums[i] + nums[j] == target:
                    return [ i, j]

def char_dic(s):
    d = {}
    for i in s:
        if i in d.keys():
            d[i] +=1
        else:
            d[i] =1
    return d

def compare_s(s_1,s_2):
    d1, d2 = char_dic(s_1), char_dic(s_2)
    if d1.keys() != d2.keys():
        return False
    else:
        for i in d1.keys():
            if d1[i] != d2[i]:
                return False
    return True


def groupAnagrams(strs):
    ana_list = [[strs[0]]]
    for i in range(1,len(strs)):
        has_ana = False
        for j in range(len(ana_list)):
            if compare_s(ana_list[j][0],strs[i]):
                ana_list[j].append(strs[i])
                has_ana = True
        if not has_ana:
            ana_list.append([strs[i]])
            print(ana_list)
    return ana_list

def topKFrequent( nums, k):
    freq = {}
    for item in nums:
        if not item in freq.keys():
            freq[item] = 1
        else: 
            freq[item] += 1
    items_dict = dict(sorted(freq.items() , key = lambda item: item[1] , reverse = True))
    return list(items_dict.keys())[:k]

def productExceptSelf(nums):
    p = 1
    p_nums = [1]*len(nums)
    for item in nums:
        p *= item
    for i in range(len(p_nums)):
        if nums[i] != 0:
            p_nums[i] = p/nums[i]
    return p_nums

     
def removeDuplicates(nums):
    x = [nums[0]]
    for item in nums:
        if x[-1] != item:
            x.append(item)
    for i in range(len(x)):
        nums[i] = x[i]
    return len(x)
    
def removeElement(nums, val):
    x = []
    for item in nums:
        if item != val:
            x.append(item)
    for i in range(len(x)):
        nums[i] = x[i]
    return len(x)
    
def getConcatenation(nums):
    lans = len(nums)
    ans = 2*lans*[0]
    for i in range(lans):
        ans[i], ans[lans +i] = nums[i], nums[i]
    return ans

def isValid(s):
    x = []
    dic = {'[':']','(':')','{':'}'}
    for i in range(len(s)-1,-1,-1):
        if s[i] in ['[','(','{'] and (x == [] or s[-1] != dic[x[-1]]):
            return False
        else:
            x.append(s[-1])
            s = s[:-1]
    return True

def push(self, val: int) -> None:
    self.ls.append(val)
    if  self.mini == []:
        self.mini.append(val)
    elif val < self.mini[-1]:
        self.mini.append(val)
    else:
        self.mini.append(self.mini[-1])

def pop(self) -> None:
    self.ls.pop()
    self.mini.pop()

def top(self) -> int:
    if self.ls == []:
        return
    return self.ls[-1]

def getMin(self) -> int:
    return self.mini[-1]








def main():
    print(isValid("["))

main()