| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 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 |
- hackerrank
- Baekjoon
- 금융문자분석경진대회
- PYTHON
- 데이콘
- 코로나19
- 우분투
- 편스토랑 우승상품
- 프로그래머스 파이썬
- gs25
- ChatGPT
- leetcode
- 파이썬
- Git
- Real or Not? NLP with Disaster Tweets
- 자연어처리
- 편스토랑
- dacon
- 더현대서울 맛집
- 프로그래머스
- AI 경진대회
- 캐치카페
- ubuntu
- programmers
- github
- Docker
- 맥북
- SW Expert Academy
- Kaggle
- 백준
- Today
- Total
목록
반응형
HakerRank (2)
솜씨좋은장씨
[HackerRank] Jumping on the Clouds (Python)
Emma is playing a new mobile game that starts with consecutively numbered clouds. Some of the clouds are thunderheads and others are cumulus. She can jump on any cumulus cloud having a number that is equal to the number of the current cloud plus 1 or 2. She must avoid the thunderheads. Determine the minimum number of jumps it will take Emma to jump from her starting postion to the last cloud. It..
[HackerRank] Sock Merchant (Python)
John works at a clothing store. He has a large pile of socks that he must pair by color for sale. Given an array of integers representing the color of each sock, determine how many pairs of socks with matching colors there are. For example, there are n = 7 socks with colors ar = [1, 2, 1, 2, 1, 3, 2] . There is one pair of color 1 and one of color 2. There are three odd socks left, one of each c..