[Codility] Lesson6. Distinct - 문제풀이 Description 배열 A가 N개의 정수로 구성된 경우 배열 A의 고유 값 수를 반환합니다. that, given an array A consisting of N integers, returns the number of distinct values in array A. For example, given array A consisting of six elements such that: A[0] = 2 A[1] = 1 A[2] = 1 A[3] = 2 A[4] = 3 A[5] = 1 the function should return 3, because there are 3 distinct values appearing in array A, namely 1, 2 and 3. Write an efficient .. 알고리즘/Codility 2022. 3. 5. 21:53
[Codility] Lession7. Brackets - 문제풀이 Description A string S consisting of N characters is considered to be properly nested if any of the following conditions is true: S is empty;S has the form "(U)" or "[U]" or "{U}" where U is a properly nested string;S has the form "VW" where V and W are properly nested strings. For example, the string "{[()()]}" is properly nested but "([)()]" is not. Write a function: class Solution { public in.. 알고리즘/Codility 2022. 3. 5. 21:50
[Codility] Lession5. CountDiv - 문제풀이 Description 세 개의 정수 A, B, K가 주어지면 A~B범위 내의 정수를 K로 나눌 수 있는 수를 반환합니다 Write a function: class Solution { public int solution(int A, int B, int K); } that, given three integers A, B and K, returns the number of integers within the range [A..B] that are divisible by K, i.e.: { i : A ≤ i ≤ B, i mod K = 0 } For example, for A = 6, B = 11 and K = 2, your function should return 3, because there are three.. 알고리즘/Codility 2022. 3. 5. 21:29
[Codility] Lesson5. PassingCars - 문제풀이 Description N개의 정수로 구성된 비어 있지 않은 배열 A가 주어집니다. 배열 A의 연속 요소는 도로에서 연속된 자동차를 나타냅니다. N개의 정수가 주어지면 통과 자동차 쌍의 수를 반환합니다. A non-empty array A consisting of N integers is given. The consecutive elements of array A represent consecutive cars on a road. Array A contains only 0s and/or 1s: 0 represents a car traveling east,1 represents a car traveling west. The goal is to count passing cars. We say that a pa.. 알고리즘/Codility 2022. 2. 25. 12:36
[Codility] Lesson4. MissingInteger - 문제풀이 Description 배열 A에 N개의 정수가 주어지면 A에 없는 가장 작은 양의 정수(0보다 큼)를 반환합니다. Write a function: class Solution { public int solution(int[] A); } that, given an array A of N integers, returns the smallest positive integer (greater than 0) that does not occur in A. For example, given A = [1, 3, 6, 4, 1, 2], the function should return 5. Given A = [1, 2, 3], the function should return 4. Given A = [−1, −3], the .. 알고리즘/Codility 2022. 2. 25. 01:52
[Codility] Lesson4. MaxCounters - 문제풀이 Description 주어진 배열에서 아래와 같이 경우에 따라 2가지 연산을 한 뒤 결과배열을 반환하는 문제입니다. You are given N counters, initially set to 0, and you have two possible operations on them: increase(X) − counter X is increased by 1, max counter − all counters are set to the maximum value of any counter. A non-empty array A of M integers is given. This array represents consecutive operations: if A[K] = X, such that 1 ≤ X ≤ N, th.. 알고리즘/Codility 2022. 2. 25. 01:48
[Codility] Lesson4. FrogRiverOne - 문제풀이 Description 아래의 설명에 따라 X까지 도달하기 위해 1~X까지의 모든 숫자가 배열의 요소에 존재하는 가장 낮은 값을 찾는 문제입니다. 모든 숫자가 없어 다리를 건너지 못하면 -1를 반환합니다. A small frog wants to get to the other side of a river. The frog is initially located on one bank of the river (position 0) and wants to get to the opposite bank (position X+1). Leaves fall from a tree onto the surface of the river. You are given an array A consisting of N integers r.. 알고리즘/Codility 2022. 2. 25. 01:45
[Codility] Lesson4. PermCheck - 문제풀이 Description 주어진 배열의 요소가 1~N까지 요소를 모두 가진 순열인지 여부를 반환하는 문제입니다. A non-empty array A consisting of N integers is given. A permutation is a sequence containing each element from 1 to N once, and only once. For example, array A such that: A[0] = 4 A[1] = 1 A[2] = 3 A[3] = 2 is a permutation, but array A such that: A[0] = 4 A[1] = 1 A[2] = 3 is not a permutation, because value 2 is missing. The goal is.. 알고리즘/Codility 2022. 2. 25. 01:38
[Codility] Lesson3. TapeEquilibrium - 문제풀이 Description N개의 정수로 이루어진 배열 A가 비어 있지 않은 경우 얻을 수 있는 최소의 차이를 반환합니다. A non-empty array A consisting of N integers is given. Array A represents numbers on a tape. Any integer P, such that 0 < P < N, splits this tape into two non-empty parts: A[0], A[1], ..., A[P − 1] and A[P], A[P + 1], ..., A[N − 1]. The difference between the two parts is the value of: |(A[0] + A[1] + ... + A[P − 1]) − (A[P] + A[P.. 알고리즘/Codility 2022. 2. 25. 01:34
[Codility] Lesson3. PermMissingElem - 문제풀이 Description 주어진 배열에서 1~N+1 사이의 값중 비어있는 값을 찾아서 반환하는 문제입니다. An array A consisting of N different integers is given. The array contains integers in the range [1..(N + 1)], which means that exactly one element is missing. Your goal is to find that missing element. Write a function: class Solution { public int solution(int[] A); } that, given an array A, returns the value of the missing element. For .. 알고리즘/Codility 2022. 2. 25. 01:28
[Codility] Lesson3. FrogJmp - 문제풀이 Description 정수 X, Y, D가 주어졌을 때 위치 X에서 Y보다 크거나 같은 최소 점프 수를 반환합니다. A small frog wants to get to the other side of the road. The frog is currently located at position X and wants to get to a position greater than or equal to Y. The small frog always jumps a fixed distance, D. Count the minimal number of jumps that the small frog must perform to reach its target. Write a function: class Solution { p.. 알고리즘/Codility 2022. 2. 23. 12:13
[Codility] Lesson2. OddOccurrencesInArray - 문제풀이 Description 아래의 조건을 만족하는 N개의 정수로 구성된 배열 A가 주어지면 쌍이 없는 요소의 값을 반환한다. A non-empty array A consisting of N integers is given. The array contains an odd number of elements, and each element of the array can be paired with another element that has the same value, except for one element that is left unpaired. For example, in array A such that: A[0] = 9 A[1] = 3 A[2] = 9 A[3] = 3 A[4] = 9 A[5] = 7 A[6] .. 알고리즘/Codility 2022. 2. 22. 13:21
[Codility] Lesson2. CyclicRotation - 문제풀이 Description 주어진 배열을 오른쪽으로 K만큼 로테이션 하여 결과를 반환하는 문제입니다. An array A consisting of N integers is given. Rotation of the array means that each element is shifted right by one index, and the last element of the array is moved to the first place. For example, the rotation of array A = [3, 8, 9, 7, 6] is [6, 3, 8, 9, 7] (elements are shifted right by one index and 6 is moved to the first place). The goa.. 알고리즘/Codility 2022. 2. 21. 11:33
[Codility] Lesson1. BinaryGap Description 양의 정수 N이 주어지면 가장 긴 이진 간격의 길이를 반환합니다. N에 이진 간격이 없으면 함수는 0을 반환해야 합니다. A binary gap within a positive integer N is any maximal sequence of consecutive zeros that is surrounded by ones at both ends in the binary representation of N. For example, number 9 has binary representation 1001 and contains a binary gap of length 2. The number 529 has binary representation 1000010001 and contains .. 알고리즘/Codility 2022. 2. 20. 20:15
