끄적끄적 보니타

https://swexpertacademy.com/main/code/referenceCode/referenceCodeDetail.do?referenceId=test01&category=DataStructure SW Expert Academy SW 프로그래밍 역량 강화에 도움이 되는 다양한 학습 컨텐츠를 확인하세요! swexpertacademy.com C언어 답안 #include int main(void) { int stack[100] = { 0, }; int tc_cnt, data_size; scanf("%d", &tc_cnt); for (int i=0; i

https://swexpertacademy.com/main/code/referenceCode/referenceCodeDetail.do?referenceId=AVuoqWnqAADw5fUK&category=DataStructure SW Expert Academy SW 프로그래밍 역량 강화에 도움이 되는 다양한 학습 컨텐츠를 확인하세요! swexpertacademy.com C언어 답안 #include int main(void) { int stack[100] = { 0, }; int tc_cnt, data_size; scanf("%d", &tc_cnt); for (int i=0; i= 0; ds--) { printf("%d ", stack[ds]); } printf("\n"); } } 결과

알고리즘 BFS (너비 우선 탐색 알고리즘) https://gmlwjd9405.github.io/2018/08/15/algorithm-bfs.html [알고리즘] 너비 우선 탐색(BFS)이란 - Heee's Development Blog Step by step goes a long way. gmlwjd9405.github.io DFS (깊이 우선 탐색 알고리즘) https://gmlwjd9405.github.io/2018/08/14/algorithm-dfs.html [알고리즘] 깊이 우선 탐색(DFS)이란 - Heee's Development Blog Step by step goes a long way. gmlwjd9405.github.io 백트래킹 https://chanhuiseok.github.io/..

문제) www.codewars.com/kata/52742f58faf5485cae000b9a/train/python Codewars: Achieve mastery through challenge Codewars is where developers achieve code mastery through challenge. Train on kata in the dojo and reach your highest potential. www.codewars.com 내가 푼 답) def format_duration(seconds): if seconds == 0: return "now" time = { "sec": seconds, "min": 0, "hour": 0, "day": 0, "year": 0 } a_to_b(t..

문제) www.codewars.com/kata/552c028c030765286c00007d/train/python Codewars: Achieve mastery through challenge Codewars is where developers achieve code mastery through challenge. Train on kata in the dojo and reach your highest potential. www.codewars.com 내가 푼 답) def iq_test(numbers): remain = [ int(num)%2 for num in numbers.split(' ')] for i in range(len(remain) - 2): if (remain[i] != remain[i+1]..

문제) www.codewars.com/kata/54da539698b8a2ad76000228/train/python Codewars: Achieve mastery through challenge Codewars is where developers achieve code mastery through challenge. Train on kata in the dojo and reach your highest potential. www.codewars.com 내가 푼 답) def is_valid_walk(walk): if (len(walk) != 10): return False ns = [1 for w in walk if w == 'n'] ss = [1 for w in walk if w == 's'] es = [..

문제) www.codewars.com/kata/5412509bd436bd33920011bc/train/python Codewars: Achieve mastery through challenge Codewars is where developers achieve code mastery through challenge. Train on kata in the dojo and reach your highest potential. www.codewars.com 내가 푼 답) # return masked string def maskify(cc): return ''.join(['#' for _ in range(len(cc)-4)]) + cc[-4:] if len(cc) > 4 else cc 테스트 결과) 마음에 드는 ..

문제) www.codewars.com/kata/53368a47e38700bd8300030d/train/python Codewars: Achieve mastery through challenge Codewars is where developers achieve code mastery through challenge. Train on kata in the dojo and reach your highest potential. www.codewars.com 내가 푼 답) def namelist(names): result = '' i = 1 for name in names: result += name['name'] if (i

문제) www.codewars.com/kata/52c4dd683bfd3b434c000292/train/python Codewars: Achieve mastery through challenge Codewars is where developers achieve code mastery through challenge. Train on kata in the dojo and reach your highest potential. www.codewars.com 내가 푼 답) def is_interesting(number, awesome_phrases): if check_intersting(number, awesome_phrases): return 2 else: if check_intersting(number - 2..

문제) www.codewars.com/kata/525f4206b73515bffb000b21/train/javascript Codewars: Achieve mastery through challenge Codewars is where developers achieve code mastery through challenge. Train on kata in the dojo and reach your highest potential. www.codewars.com 내가 푼 답) function add(a, b) { const maxLength = a.length > b.length ? a.length : b.length; const newA = a.padStart(maxLength, '0'); const new..