Freaks City

Problem A Solution Direct implemantation yields the solution. Problem B: Maximizing Odd Frequency Counts Given a sequence of length 2n with elements from [1,2n], define f(a) as the count of distinct elements appearing an odd number of times in sequence a. Partition the sequence into two subsequences p and q, each of length n. The goal is to max ...