brightlightkim

n, c = map(int, input().split()) nums = list(map(int, input().split())) dict = {} for i in range(len(nums)): if nums[i] in dict: dict[nums[i]] += 1 else: dict[nums[i]] = 1 indexMap = {} for num in dict: if dict[num] in indexMap: indexMap[dict[num]].append(num) else: indexMap[dict[num]] = [num] for freq in sorted(indexMap, reverse=True): for num in indexMap[freq]: for _ in range(freq): print(num,..

Turn It Up! Your volume control is at a comfortable 7 – not too high, not too low. Your friends entirely disagree, and frequently request you turn it up or turn it down, often in a somewhat inappropriate tone of voice. Ever aiming to please, you try to accomodate their requests and increase or decrease the volume by one step accordingly. There are 11 steps on your volume control: 0, 1, 2, and so..

def threeNumberSum(array, targetSum): array.sort() set = [] for i in range(0, len(array)-2): left = i+1 right = len(array)-1 while(left < right): currentSum = array[i] + array[left] + array[right] if currentSum == targetSum: set.append([array[i], array[left], array[right]]) left += 1 right -= 1 elif currentSum < targetSum: left += 1 else: right -= 1 return set

from collections import Counter def generateDocument(characters, document): return Counter(document)-Counter(characters)=={}

def selectionSort(array): for i in range(len(array)): min = i for j in range(i, len(array)): if array[j] < array[min]: min = j tmp = array[i] array[i] = array[min] array[min] = tmp return array

def caesarCipherEncryptor(string, key): return ''.join([chr((ord(c)-97+key)%26+97) for c in string])

def runLengthEncoding(string): c = string[0] n = 0 st = "" for ch in string: if (c != ch or n > 8): st += (str(n) + c) c = ch n = 1 else: n +=1 return st + str(n) + c

def firstNonRepeatingCharacter(string): dict = {} for i in range(len(string)): if string[i] in dict: dict[string[i]] = -1 else: dict[string[i]] = i for i in dict: if dict[i] != -1: return dict[i] return -1

A company is planning to interview 2n people. Given the array costs where costs[i] = [aCosti, bCosti], the cost of flying the ith person to city a is aCosti, and the cost of flying the ith person to city b is bCosti. Return the minimum cost to fly every person to a city such that exactly n people arrive in each city. Example 1: Input: costs = [[10,20],[30,200],[400,50],[30,20]] Output: 110 Expla..

Given a string s, find the length of the longest substring without repeating characters. Example 1: Input: s = "abcabcbb" Output: 3 Explanation: The answer is "abc", with the length of 3. Example 2: Input: s = "bbbbb" Output: 1 Explanation: The answer is "b", with the length of 1. Example 3: Input: s = "pwwkew" Output: 3 Explanation: The answer is "wke", with the length of 3. Notice that the ans..