Cats Who Code

def solution(word): alphabets = ['A', 'E', 'I', 'O', 'U'] global answer answer = 0 def dfs(string): global answer answer += 1 #guard closure if string == word: return True #guard closure if len(string) == 5: return False #find the given word for alpha in alphabets: if dfs(string + alpha) =..

def solution(sizes): #sort by asc for size in sizes: size.sort(reverse = True) #pick max valuees for each maxWidth, maxHeight = float("-inf"), float("-inf") for i in range (len(sizes)): maxWidth = max(sizes[i][0], maxWidth) maxHeight = max(sizes[i][1], maxHeight) return maxWidth * maxHeight

def solution(n, computers): def dfs(row, computers): #TODO: Interate i,j -> j,i 네트웤형성 (0, 1 & 1,0 ) -> (1, 2 & 2,1) for adj in range(n): if computers[row][adj] == 1: computers[row][adj] = 0 computers[adj][row] = 0 dfs(adj, computers) answer = 0 for r in range(len(computers)): if computers[r][r] == 1: ..

def solution(people, limit): people.sort() left, right = 0, len(people) - 1 answer = 0 while left

def solution(prices): answer = [0] * len(prices) for i, p in enumerate(prices): for j in range(i+1 , len(prices)): if p

def isBalanced(s): pairs = {'(': ')', '[': ']', '{': '}'} stack = [] for parenthesis in s: if parenthesis in pairs: stack.append(parenthesis) elif parenthesis in pairs.values(): if not stack or parenthesis != pairs[stack.pop()]: return False return not stack def leftShift(a, k): n = len(a) shiftedStr = "" for i in..

import math def getDay(progress, speed): return math.ceil((100-progress)/speed) def solution(progresses, speeds): answer = [] stack = [] for i, (progress, speed) in enumerate(zip(progresses, speeds)): day = getDay(progress, speed) #append [day, init counter] to stack if not stack or stack[-1][0]

def solution(phone_book): prefixes = set(phone_book) for number in phone_book: for i in range(1, len(number)): prefix = number[:i] if prefix in prefixes: return False return True

def solution(s): stack = [] for parenthesis in s: if parenthesis == "(": stack.append("(") elif parenthesis == ")": #if not match or nothing to match if not stack or stack.pop() != "(": return False return len(stack) == 0

def gcd(a, b): while b: a, b = b, a % b return adef lcm(a, b): return abs(a * b) // gcd(a, b)def solution(arr): while len(arr) >= 2: a = arr[0] b = arr[1] arr.append(lcm(a, b)) arr = arr[2:] return arr[0]