Cats Who Code

from collections import dequedef solution(cacheSize, cities): stack = deque() #hit += 1 #miss +=5 #base case when cache size is zero, then all misses if cacheSize == 0: return len(cities) *5 time = 0 #modify all cities to lower cases for i in range(len(cities)): cities[i] = cities[i].lower() for city in cities: if len(stack) > c..

def solution(n, words): answer = [] wordSet = set() wordSet.add(words[0]) for k in range(1, len(words)): #row int division #col remainder i = (k % n) + 1 #1 based j = (k // n) + 1 if words[k] in wordSet: return [i, j] if words[k][0] != words[k-1][-1]: return [i, j] wordSet.a..

def convert(length): result = "" while length > 0: if length % 2 == 0: result = '0' + result else: result = '1' + result length //= 2 return resultdef solution(s): counter = 0 numOfOnes = 0 numOfZerosToRemove = 0 while len(s) > 1: counter += 1 numOfOnes = 0 for num in s: if num == '1': ..

def solution(s): answer = -1 stack = [] for char in s: if stack and char == stack[-1]: stack.pop() else: stack.append(char) return 1 if not stack else 0

def solution(A,B): answer = 0 n = len(A) A.sort() B.sort(reverse = True) for i in range(n): answer += A[i]*B[i] return answer

def solution(brown, yellow): ''' (w-2) * (h-2) = yellow w * h = brown + yellow // sum i * something = sum then ''' w,h = 0, 0 totalSum = brown + yellow divisors = [] for h in range(2, totalSum+1): if totalSum % h == 0: divisors.append(h) for h in divisors: #(h-2) * (w-2) == yellow # w = sum/h w = totalSum/h ..

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