찰떡개발자 코딩

1). 문제 : www.hackerrank.com/challenges/sherlock-and-anagrams/ Sherlock and Anagrams | HackerRank Find the number of unordered anagramic pairs of substrings of a string. www.hackerrank.com 2). 풀이 : Comparator를 알고있는지 모르는지에 대한 문제였던것 같다. compareTo를 사용했을때 클때, 같을때 작을때 1, 0, -1 을 return하는것만 알고있으면 비교할때 쉬울수있는 문제. import java.util.*; class Player { String name; int score; Player(String name, int score) { ..

1). 문제 : www.hackerrank.com/challenges/two-strings Two Strings | HackerRank Given two strings, you find a common substring of non-zero length. www.hackerrank.com 2). 풀이 : import java.io.*; import java.math.*; import java.security.*; import java.text.*; import java.util.*; import java.util.concurrent.*; import java.util.regex.*; public class Solution { // Complete the twoStrings function below. s..

1). 문제 : www.hackerrank.com/challenges/ctci-ransom-note/ Hash Tables: Ransom Note | HackerRank Given two sets of dictionaries, tell if one of them is a subset of the other. www.hackerrank.com 2). 풀이 : import java.io.*; import java.math.*; import java.security.*; import java.text.*; import java.util.*; import java.util.concurrent.*; import java.util.regex.*; public class Solution { // Complete th..

1).문제 : www.hackerrank.com/challenges/crush Array Manipulation | HackerRank Perform m operations on an array and print the maximum of the values. www.hackerrank.com 주어진 배열에 시작점과 끝점을 제시하고, 시작점~끝점에 더해질 k 값이 주어진다. 시작점~끝점에 각각 K를 더하고 난뒤 최종 배열에서 가장 큰 값을 추출해내는 문제. 2). 풀이 : 2중 for문을 사용해 아주 쉽게 해결 할 수 있다고 생각했다. 하지만 Timeout! 어떻게 풀어야할지 한참 ...아주 한참 머리를 괴롭혔다... 어떻게 하면 for문을 한번만 돌수 있을까......!!!!!!!!!!!!!!!!!!!..

1).문제 : www.hackerrank.com/challenges/mark-and-toys 2).풀이 : 오름차순으로 정렬하면서 더하기 정렬 다하고 더하지 말고 정렬 하면서 더하자 import java.io.*; import java.math.*; import java.security.*; import java.text.*; import java.util.*; import java.util.concurrent.*; import java.util.regex.*; public class Solution { // Complete the maximumToys function below. static int maximumToys(int[] prices, int k) { int sum = 0; int count ..

1). 문제 : www.hackerrank.com/challenges/minimum-swaps-2 Minimum Swaps 2 | HackerRank Return the minimum number of swaps to sort the given array. www.hackerrank.com 2). 풀이 : import java.io.*; import java.math.*; import java.security.*; import java.text.*; import java.util.*; import java.util.concurrent.*; import java.util.regex.*; public class Solution { //몇번의 스왑으로 순서대로 할수있는지 횟수 출력 // Complete the..

1). 문제 : www.hackerrank.com/challenges HackerRank Join over 11 million developers in solving code challenges on HackerRank, one of the best ways to prepare for programming interviews. www.hackerrank.com 2). 풀이 : import java.io.*; import java.math.*; import java.security.*; import java.text.*; import java.util.*; import java.util.concurrent.*; import java.util.regex.*; public class Solution { // ..

1). 문제 : www.hackerrank.com/challenges/ctci-array-left-rotation Arrays: Left Rotation | HackerRank Given an array and a number, d, perform d left rotations on the array. www.hackerrank.com 2). 풀이 : import java.io.*; import java.math.*; import java.security.*; import java.text.*; import java.util.*; import java.util.concurrent.*; import java.util.regex.*; public class Solution { // Complete the r..

1) 문제 : www.hackerrank.com/challenges/2d-array 2D Array - DS | HackerRank How to access and use 2d-arrays. www.hackerrank.com 2). 풀이 : import java.io.*; import java.math.*; import java.security.*; import java.text.*; import java.util.*; import java.util.concurrent.*; import java.util.regex.*; public class Solution { // Complete the hourglassSum function below. static int hourglassSum(int[][] arr..

1). 문제 : www.hackerrank.com/challenges/java-date-and-time Java Date and Time | HackerRank Print the day of a given date. www.hackerrank.com 2). 풀이 : import java.io.*; import java.math.*; import java.security.*; import java.text.*; import java.util.*; import java.util.concurrent.*; import java.util.regex.*; class Result { /* * Complete the 'findDay' function below. * * The function is expected to..