찰떡개발자 코딩

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..