일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
1 | 2 | 3 | 4 | |||
5 | 6 | 7 | 8 | 9 | 10 | 11 |
12 | 13 | 14 | 15 | 16 | 17 | 18 |
19 | 20 | 21 | 22 | 23 | 24 | 25 |
26 | 27 | 28 | 29 | 30 | 31 |
- hadoop safe mode leave
- hive beeline 에러
- 자소서 빨리
- mac hive 3
- code=0)
- 이더리움 #ethereum
- hive beeline 실행
- mac hadoop 설치
- 카카오 2020 코테
- mac hadoop
- Resources are low on NN
- 자소서 빨리 쓰는 법
- 백준 18428
- mac hadoop 3
- 카카오 자물쇠와 열쇠
- Failed to connect to localhost:10000
- 자소서 너무 오래 걸림
- mac hadoop 설정
- hive beeline
- 이더리움
- Safe mode is ON
- hive beeline 설정
- Could not open client transport with JDBC Uri: jdbc:hive2://localhost:10000
- mac hive
- 기업 조사 빨리 하는 법
- is not allowed to impersonate hive (state=08S01
- hadoop safe mode
- 자소서 시간 줄이기
- 카카오 2020 코딩테스트
- mac hive 설정
- Today
- Total
목록Algorithm/문제풀이 (17)
A seeker after truth
P) Your task is to convert a number into a string that contains raindrop sounds corresponding to certain potential factors. A factor is a number that evenly divides into another number, leaving no remainder. The simplest way to test if a one number is a factor of another is to use the [modulo operation](https://en.wikipedia.org/wiki/Modulo_operation). The rules of `raindrops` are that if a given..
P) Given a DNA strand, return its RNA complement (per RNA transcription). Both DNA and RNA strands are a sequence of nucleotides. The four nucleotides found in DNA are adenine (**A**), cytosine (**C**), guanine (**G**) and thymine (**T**). The four nucleotides found in RNA are adenine (**A**), cytosine (**C**), guanine (**G**) and uracil (**U**). Given a DNA strand, its transcribed RNA strand is..
P) Determine if a sentence is a pangram. A pangram (Greek: παν γράμμα, pan gramma, "every letter") is a sentence using every letter of the alphabet at least once. The best known English pangram is: > The quick brown fox jumps over the lazy dog. The alphabet used consists of ASCII letters `a` to `z`, inclusive, and is case insensitive. Input will not contain non-ASCII symbols. mysol) def is_pangr..
P) Given a year, report if it is a leap year. The tricky thing here is that a leap year in the Gregorian calendar occurs: ```text on every year that is evenly divisible by 4 except every year that is evenly divisible by 100 unless the year is also evenly divisible by 400 ``` For example, 1997 is not a leap year, but 1996 is. 1900 is not a leap year, but 2000 is. mysol) def leap_year(year): if ye..
sol1) 참고 - https://itholic.github.io/python-reverse-string/ def reverse(text): return text[::-1] sol2) s = 'abcde' s_list = list(s) s_list.reverse()# reverse는 list에만 사용 가능 print(''.join(s_list)) sol3) print(''.join(reversed(s))) #reversed는 문자열에 바로 적용이 가능하다. #join 함수는 리스트와 문자열에 모두 사용 가능(iterable한 것)