codility3 Lesson 3: Time Complexity [Lesson 3: Time Complexity] Tasks 1. TapeEquilibriumMinimize the value |(A[0] + ... + A[P-1]) - (A[P] + ... + A[N-1])|. 사이트 : https://codility.com/programmers/task/tape_equilibrium/난이도 : PAINLESS추가 자료 : Open reading material (PDF) A non-empty zero-indexed 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 .. 2016. 9. 2. Lesson 2: Arrays [Lesson 2: Arrays] Tasks 1. OddOccurrencesInArrayFind value that occurs in odd number of elements. 사이트 : https://codility.com/programmers/task/odd_occurrences_in_array/난이도 : PAINLESS추가 자료 : Open reading material (PDF) A non-empty zero-indexed 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 t.. 2016. 9. 2. Lesson 1: Iterations [Lesson 1: Iterations] Tasks 1. BinaryGapFind longest sequence of zeros in binary representation of an integer. 사이트 : https://codility.com/programmers/task/binary_gap/난이도 : PAINLESS추가 자료 : Open reading material (PDF) 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 .. 2016. 9. 2. 이전 1 다음