방구석 개발자의 실험실

[코딜리티] CyclicRotation 문제요약 : 배열을 주어진 수만큼 shift해서 재정렬한다.풀이 : 배열의 길이보다 K가 클때는 동일한 결과가 나오기 때문에, 몫을 찾아준다.K = K % len; // shift 2 == shift 7 == shift 12 == ... 뒤에서 K번째부터 정답배열에 저장하고,len에 도달하면 처음부터 저장해주면 된다. // A = [3, 8, 9, 7, 6] // K = 2 // [7, 6] + [3, 8, 9] // return [7, 6, 3, 8, 9] Tasks Detailseasy1. CyclicRotationRotate an array to the right by a given number of ..

[코딜리티] Codility 플랫폼 친해지기 및 연습문제 시작하기 우선 코딜리티는 외국계 회사의 코딩테스트 플랫폼이다. (처음 알게된 사실..) 문제풀이를 하려면 공식 홈페이지에서는 접속 경로가 잘 안보이고코딜리티의 연습문제 데모 테스트는 아래 링크에 위치한다.https://app.codility.com/programmers/ Developer Training | Test Coding Skills Online - CodilityFind longest sequence of zeros in binary representation of an integer.app.codility.com 우상단 Sign up 눌러주고 회원가입 진행하면 된다. 로그인 후, See all Lessons를 클릭하면https:..

[해커랭크] ACM ICPC Team https://www.hackerrank.com/challenges/acm-icpc-team/problem?isFullScreen=true ACM ICPC Team | HackerRankPrint the maximum topics a given team can cover for ACM ICPC World Finalswww.hackerrank.com There are a number of people who will be attending ACM-ICPC World Finals. Each of them may be well versed in a number of topics. Given a list of topics known by each attendee, pres..

[해커랭크] Queen's Attack II https://www.hackerrank.com/challenges/queens-attack-2/problem?isFullScreen=true Queen's Attack II | HackerRankQueen's Attack II | HackerRank We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.www.hackerrank.com You will be given a square chess board with one queen an..

https://www.hackerrank.com/challenges/equality-in-a-array/problem?isFullScreen=true Equalize the Array | HackerRankDelete a minimal number of elements from an array so that all elements of the modified array are equal to one another.www.hackerrank.com Given an array of integers, determine the minimum number of elements to delete to leave only elements of equal value.정수 배열이 주어졌을 때, 동일한 값의 요소만 남도록..

[해커랭크] Jumping on the Clouds https://www.hackerrank.com/challenges/jumping-on-the-clouds/problem?isFullScreen=true Jumping on the Clouds | HackerRankJumping on the cloudswww.hackerrank.com There is a new mobile game that starts with consecutively numbered clouds. Some of the clouds are thunderheads and others are cumulus. The player can jump on any cumulus cloud having a number that is equal to ..

[해커랭크] Non-Divisible Subset https://www.hackerrank.com/challenges/non-divisible-subset/problem?isFullScreen=true Non-Divisible Subset | HackerRankFind the size of the maximal non-divisible subset.www.hackerrank.com Given a set of distinct integers, print the size of a maximal subset of where the sum of any numbers in is not evenly divisible by .서로 다른 정수 집합이 주어졌을 때, 의 최대 부분집합의 크기를 출력하는데, 여기서 임..

[해커랭크] Extra Long Factorials https://www.hackerrank.com/challenges/extra-long-factorials/problem?isFullScreen=true Extra Long Factorials | HackerRankCalculate a very large factorial that doesn't fit in the conventional numeric data types.www.hackerrank.com The factorial of the integer , written , is defined as: Calculate and print the factorial of a given integer.For example, if , we calculate ..

[해커랭크] Utopian Treehttps://www.hackerrank.com/challenges/utopian-tree/problem?isFullScreen=true Utopian Tree | HackerRankPredict the height of the tree after N growth cycles.www.hackerrank.com The Utopian Tree goes through 2 cycles of growth every year. Each spring, it doubles in height. Each summer, its height increases by 1 meter.A Utopian Tree sapling with a height of 1 meter is planted at th..

https://www.hackerrank.com/challenges/designer-pdf-viewer/problem?isFullScreen=true Designer PDF Viewer | HackerRankHelp finding selection area in PDF Viewer.www.hackerrank.com When a contiguous block of text is selected in a PDF viewer, the selection is highlighted with a blue rectangle. In this PDF viewer, each word is highlighted independently. For example:There is a list of character h..