| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 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 |
Tags
- 문자열
- 코딩테스트
- 파이썬
- brute force
- Python
- 백준
- API
- beandefinitionstoreexception
- 소수
- BFS
- error
- springboot
- Spring
- spring security
- 최단경로
- 2981
- algorithm
- Greedy
- Dijkstra
- javascript
- counting elements
- java
- 알고리즘
- 탐욕법
- 프로그래머스
- 2018 KAKAO BLIND RECRUITMENT
- HTTP
- 라이브템플릿
- codility
- applicationeventpublisher
Archives
- Today
- Total
목록lesson 1 (1)
Altiora Petamus
binary gap
BinaryGap coding task - Learn to Code - Codility Find longest sequence of zeros in binary representation of an integer. app.codility.com Q. A binary gap within a positive integer N is any maximal sequence of consecutive zeros that is surrounded by ones at both ends in the binary representation of N. For example, number 9 has binary representation 1001 and contains a binary gap of length 2. The n..
1day-1algorithm
2021. 6. 10. 20:22