
아날로그 시계 I want to know the moment when the second clock hand goes over hour hand or minute hand. So I need exact position of each hand. Fortunately ea

석유 시추This problem required determining the maximum amount of oil by placing a pie once. To figure out amount of oil, it was decided to use BFS for sea

요격 시스템The first approach that came to mind for solving this problem was a greedy algorithm. I attempted to implement it by Merging larger intervals in

큰 수 만들기 Approach This problem was suitable for applying a greedy algorithm. I approached to solve by Removing one number at all location and picked m

구명보트그리디 문제를 계속 풀면서 푸는 방법을 어느 정도 익힌 거 같다.그리디는 지금 최선의 값을 찾는 알고리즘이다. 주의할 점은 특정 조건에서만 돌아가는 로직이 아닌 모든 데이터에 부합하는 조건을 찾아야 한다. 이러한 조건을 맞추기 위해 우리는 정렬이나 범위를 정해주

If you want to compare each number with an integer operation, convert it into a string and compare it because the operation gets longerThis problem is