샘성의 iOS 개발 일지

문제 설명: There is a large pile of socks that must be paired by color. Given an array of integers representing the color of each sock, determine how many pairs of socks with matching colors there are. Example n = 7, ar = [1, 2, 1, 2, 1, 3, 2] There is one pair of color 1 and one of color 2. There are three odd socks left, one of each color. The number of pairs is 2. Function Description Complete th..

문제 설명: Given an array of bird sightings where every element represents a bird type id, determine the id of the most frequently sighted type. If more than 1 type has been spotted that maximum amount, return the smallest of their ids. Example arr = [1, 1, 2, 2, 3] There are two each of types 1 and 2, and one sighting of type 3. Pick the lower of the two types seen twice: type 1. Function Descripti..

문제 설명: Given an array of integers and a positive integer k, determine the number of [i, j] pairs where i < j and ar[i] + ar[j] is divisible by k. Example ar = [1, 2, 3, 4, 5, 6] k = 5 Three pairs meet the criteria: [1, 4], [2, 3] and [4, 6]. Function Description Complete the divisibleSumPairs function in the editor below. divisibleSumPairs has the following parameter(s): int n: the length of arr..