오뚝이개발자

문제 https://codingcompetitions.withgoogle.com/kickstart/round/000000000043585c/000000000085a152#analysis Kick Start - Google’s Coding Competitions Hone your coding skills with algorithmic puzzles meant for students and those new to coding competitions. Participate in one round or join them all. codingcompetitions.withgoogle.com 나의 풀이 1. IMPOSSIBLE인 case check 가장 빈번하게 등장하는 알파벳의 등장 횟수가 len(s)//2보다 ..

문제 https://codingcompetitions.withgoogle.com/kickstart/round/00000000004361e3/000000000082b813 Kick Start - Google’s Coding Competitions Hone your coding skills with algorithmic puzzles meant for students and those new to coding competitions. Participate in one round or join them all. codingcompetitions.withgoogle.com 나의 풀이 Arithmetic sequence인지 아닌지 검사하는 방법은 쉬우니 중요한 가운데 원소의 선택에 대해서만 고민하면 된다. 가운데..

문제 https://codingcompetitions.withgoogle.com/kickstart/round/0000000000435a5b/000000000077a882 Kick Start - Google’s Coding Competitions Hone your coding skills with algorithmic puzzles meant for students and those new to coding competitions. Participate in one round or join them all. codingcompetitions.withgoogle.com 나의 풀이 DP를 사용하여 푸는 간단한 문제이다. 문자열의 길이 n만큼의 dp 배열을 만들어서 모두 1로 초기화 한다. 이 배열은 해당 인덱..

문제 https://codingcompetitions.withgoogle.com/kickstart/round/0000000000435bae/0000000000887c32 Kick Start - Google’s Coding Competitions Hone your coding skills with algorithmic puzzles meant for students and those new to coding competitions. Participate in one round or join them all. codingcompetitions.withgoogle.com 나의 풀이 자신의 집 앞에 쓰레기통이 없는 경우 간단하게 두 가지 경우만 존재한다. 좌측 방향의 가장 가까운 쓰레기통을 선택하거나 우측 방향..