코드 파이트(Code Signal)

def arrayMaxConsecutiveSum(inputArray, k): SOR = [] for i in range(len(inputArray)): total = 0 for j in range(i, i+k): if (i+k)

def differentSymbolsNaive(s): return len(set(s))

def firstDigit(inputString): LIST = list(inputString) print(LIST) for i in range(len(LIST)): if LIST[i].isdigit() == True: return LIST[i]

def extractEachKth(inputArray, k): array=[] for i in range(len(inputArray)): if (i+1)%k != 0: array.append(inputArray[i]) return array

from itertools import permutations def diff(w1, w2): return sum([a[0] != a[1] for a in zip(w1, w2)]) == 1 def stringsRearrangement(inputArray): for z in permutations(inputArray): if sum([diff(*x) for x in zip(z, z[1:])]) == len(inputArray) - 1: return True return False

def absoluteValuesSumMinimization(a): return a[(len(a)-1)//2] 풀다가 딕셔너리 keys(), values()나오고 아이디어 조잡해져서 포기

def depositProfit(deposit, rate, threshold): nex = deposit for i in range(1,1000): nex = nex *(100+rate)/100 print(nex,i,threshold) if nex >= threshold: return i

def circleOfNumbers(n, firstNumber): if firstNumber < n/2: return firstNumber+n/2 else: return firstNumber-n/2

def chessBoardCellColor(cell1, cell2): s1 = set(['A','C','E','G']) s2 = set([1,3,5,7]) x=list(cell1) x[1]=int(x[1]) y=list(cell2) y[1]=int(y[1]) if x[0] in s1: if x[1] in s2: flag_cell1=2 else: flag_cell1=1 else: if x[1] in s2: flag_cell1=1 else: flag_cell1=2 if y[0] in s1: if y[1] in s2: flag_cell2=2 else: flag_cell2=1 else: if y[1] in s2: flag_cell2=1 else: flag_cell2=2 print(flag_cell1,flag_c..

123456789def alphabeticShift(inputString): x = list(inputString) for i in range(len(x)): if(x[i] == 'z'): x[i] = 'a' else: x[i] = chr(ord(x[i])+1) print(x) return ''.join(x)cs

def variableName(name): if name[0].isdigit() == True: return False for i in range(len(name)): if name[i].isalpha() or name[i].isdigit() or name[i] == '_': continue else: return False return True