본문 바로가기
반응형

DEV/문제풀이

Lesson 4(Counting Elements) - MissingInteger 2021. 1. 14. 문제 This is a demo task. 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 function should return 1. Write an effic..
Lesson 6(Sorting) - Triangle 2021. 1. 12. 문제 An array A consisting of N integers is given. A triplet (P, Q, R) is triangular if 0 ≤ P A[R], A[Q] + A[R] > A[P], A[R] + A[P] > A[Q]. For example, consider array A such that: A[0] = 10 A[1] = 2 A[2] = 5 A[3] = 1 A[4] = 8 A[5] = 20 Triplet (0, 2, 4) is triangular. Write a function: class Solution { public int solution(int[] A); } that, given an array A consistin..
Lesson 4(Counting Elements) - MaxCounters 2021. 1. 11. 문제 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, then operation K is increase(X), if A[K] = N + 1 then operation ..
Lesson 4(Counting Elements) - FrogRiverOne 2021. 1. 8. 문제 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 representing the falling leaves. A[K] represents the position where one leaf falls at time K, measured in second..
Lesson 3(Time Complexity) - TapeEquilibrium 2021. 1. 7. 문제 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 + 1] + ... + A[N − 1])| In other words, it is the absolute dif..
Lesson 3(Time Complexity) - PermMissingElem (방법2) 2021. 1. 5. 문제 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 example, given array A such that: A[0] = 2 A[1] = 3 A[2..
Lesson 3(Time Complexity) - PermMissingElem (방법1) 2021. 1. 4. 문제 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 example, given array A such that: A[0] = 2 A[1] = 3 A[2..
Lesson 3(Time Complexity) - FrogJmp 2021. 1. 3. 문제 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 { public int solution(int X, int Y, int D); } that, given three i..
Lesson 2(Iterations) - OddOccurrencesInArray 2020. 12. 29. 문제 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] = 9 the elements at indexes 0 and 2 have value 9, the elements a..
Codility 2020. 12. 26. 개발자를 위한 문제 제공 및 작성한 코드를 등록하여 검사를 진행하는 사이트입니다. 1. 사이트 접속 https://app.codility.com/programmers/ 2. 회원 가입 Sign Up 버튼을 통해 회원 가입을 화면으로 이동합니다. 성과 이름, 이메일 주소, 나라를 입력 후 Create accout 버튼을 눌러 회원 가입합니다. 등록한 이메일에 회원 가입 확인 메일이 발송되며, 해당 메일을 확인을 통해 가입을 마무리합니다. 3. 문제 문제는 Lesson과 Challenege로 나눠져 있습니다. Lesson은 각 장별 교육자료(PDF)와 문제로 구성되어 있습니다. 문제를 풀기 전 교육자료를 먼저 받아 공부를 합시다. Challenege는 난이도가 상승된 문제로 어렵습니다. Lesson을 마무리..
반응형

티스토리툴바