Tech blog

A non-empty array A consisting of N integers is given. Array A represents numbers on a tape.Any integer P, such that 0 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 difference between the sum of the first part and the sum of the second part.For example, consider array A such that:A[0] ..

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:def solution(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] = 1 A[3] = 5the function should return 4..

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:def solution(X, Y, D)that, given three integers X, Y and D, returns the minimal number..

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] = 9the elements at indexes 0 and 2 have value 9,the elements at index..

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 goal is to rotate array A K times; that is, each element o..

https://app.codility.com/programmers/lessons/1-iterations/binary_gap/ BinaryGap coding task - Learn to Code - CodilityFind longest sequence of zeros in binary representation of an integer.app.codility.com 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..

https://school.programmers.co.kr/learn/courses/30/lessons/42576 프로그래머스SW개발자를 위한 평가, 교육의 Total Solution을 제공하는 개발자 성장을 위한 베이스캠프programmers.co.kr def solution(participant, completion): part = {} for p in participant: if p not in part: part[p] = 1 else: part[p] += 1 comp = {} for c in completion: if c not in comp: comp[c] = 1 ..

https://school.programmers.co.kr/learn/courses/30/lessons/150370# 프로그래머스SW개발자를 위한 평가, 교육의 Total Solution을 제공하는 개발자 성장을 위한 베이스캠프programmers.co.kr f"" 이 문법이 살짝 기억 안 났는데 이거 말고는 문제 없었다...str끼리도 비교 가능하다는걸 알았기 때문에 아 한가지, %12가 0이 나오는 사실을 간과하고 풀어서 테스트 케이스 찾느라 시간 걸림def calculate(date, month): y, m, d = date.split('.') y = int(y); m = int(m); d = int(d); month = int(month) # 하루 먼저 빼기 d -=..

https://school.programmers.co.kr/learn/courses/30/lessons/60057?gad_source=1&gad_campaignid=22199869887&gbraid=0AAAAAC_c4nDRnLcdW5pfc_L8ay5k5GtDz&gclid=CjwKCAjwvO7CBhAqEiwA9q2YJbn8g3uU5ynefiaRrs65vrzEvwxuWyBu9ikUQDfmOJJ79-3OPMuXsBoCgF0QAvD_BwE 프로그래머스SW개발자를 위한 평가, 교육의 Total Solution을 제공하는 개발자 성장을 위한 베이스캠프programmers.co.kr 최적화한 풀이모든 정보를 저장할 필요가 없지 않았는가.. 바로 직전 것만 확인하면 되었던 건데 왜 ..def compress(s..

https://school.programmers.co.kr/learn/courses/30/lessons/72410 프로그래머스SW개발자를 위한 평가, 교육의 Total Solution을 제공하는 개발자 성장을 위한 베이스캠프programmers.co.kr gpt가 고쳐준 나의 풀이def solution(new_id): # step1 new_id = new_id.lower() # step2 new_id = "".join( s for s in new_id if s.islower() or s.isdigit() or s in "-_." ) # step3 while '..' in new_id: new_id = new_id.replace..