| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 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 |
- 동적 계획법
- ACM-ICPC
- java
- dynamic programming
- Math.ceil
- 다익스트라
- hacker rank
- algorithm
- 문자열
- Dynamic Programing
- Dijkstra
- codesignal
- JUMPGAME
- algospot
- 01 타일
- Making Anagrams
- Sherlock and the Valid String
- 명령 프롬프트
- 최단 경로 알고리즘
- Alternating Characters
- centuryFromYear
- Today
- Total
목록hacker rank (2)
Florescence
문제 - https://www.hackerrank.com/challenges/sherlock-and-valid-string/problem?h_l=interview&playlist_slugs%5B%5D=interview-preparation-kit&playlist_slugs%5B%5D=strings Sherlock and the Valid String | HackerRank Remove some characters from the string such that the new string's characters have the same frequency. www.hackerrank.com 풀이 import java.io.*; import java.math.*; import java.security.*; im..
문제 - https://www.hackerrank.com/challenges/alternating-characters/problem?h_l=interview&playlist_slugs%5B%5D=interview-preparation-kit&playlist_slugs%5B%5D=strings Alternating Characters | HackerRank Calculate the minimum number of deletions required to convert a string into a string in which consecutive characters are different. www.hackerrank.com 풀이 import java.io.*; import java.math.*; import..