Equal Beauty CodeChef SnackDown 2021 Round 1A Question The beauty of an (non-empty) array of integers is defined as the difference between its largest and smallest element. For example, the beauty of the array [2,3,4,4,6] is 6−2=4. An array A is said to be good if it is possible to partition the elements of A into two non-empty arrays B1 and B2 such that B1 and B2 have the same beauty. Each element of array A should be in exactly one array: either in B1 or in B2. For example, the array [6,2,4,4,4] is good because its elements can be partitioned into two arrays B1=[6,4,4] and B2=[2,4], where both B1 and B2 have the same beauty (6−4=4−2=2). You are given an array A of length N. In one move you can: Select an index i (1≤i≤N) and either increase Ai by 1 or decrease Ai by 1. Find the minimum number of moves required to make the array A good. Input Format The first line of input contains a single integer T, denoting the number of test cases. The description of T test cases follow. Each ...
HackerEarth October Easy 2021 Editorial Solutions Likeable Arrays Bob and Alice are two friends, they have an array A consisting of N integers, A 1 , A 2 , A 3 . . . , A N . Alice likes the arrays in which if element X is present it must have exactly X or zero occurrences. So, Bob has decided to convert this array to an array which Alice likes. To do that, he can perform the following two operations: Add an element of any value to array A . Remove an element from array A . Find the minimum number of operations Bob has to perform so that array is liked by Alice. Input format The first line contains an integer T denoting the number of test cases. The first line of each test case contains an integer N denoting the number of elements in array A . The second line of each test case contains...