Given an array of integers arr, return true if the number of occurrences of each value in the array is unique or false otherwise.

Example 1:

Input: arr = [1,2,2,1,1,3] Output: true Explanation: The value 1 has 3 occurrences, 2 has 2 and 3 has 1. No two values have the same number of occurrences. Example 2:

Input: arr = [1,2] Output: false Example 3:

Input: arr = [-3,0,1,-3,1,1,1,-3,10,0] Output: true

D. Balanced Round time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output You are the author of a Codeforces round and have prepared n problems you are going to set, problem i having difficulty ai . You will do the following process:

remove some (possibly zero) problems from the list; rearrange the remaining problems in any order you wish. A round is considered balanced if and only if the absolute difference between the difficulty of any two consecutive problems is at most k (less or equal than k ).

What is the minimum number of problems you have to remove so that an arrangement of problems is balanced?

Input The first line contains a single integer t — the number of test cases.

The first line of each test case contains two positive integers n and k — the number of problems, and the maximum allowed absolute difference between consecutive problems.

The second line of each test case contains n space-separated integers a[i] — the difficulty of each problem.

Note that the sum of n over all test cases doesn't exceed 2⋅105 .

Output For each test case, output a single integer — the minimum number of problems you have to remove so that an arrangement of problems is balanced. Example Input: 7 5 1 1 2 4 5 6 1 2 10 8 3 17 3 1 20 12 5 17 12 4 2 2 4 6 8 5 3 2 3 19 10 8 3 4 1 10 5 8 1 8 3 1 4 5 10 7 3

Output: 2 0 5 0 3 1 4

It is supposed to do this:

input:

3

4

1 1 1 1

5

8 7 1 3 4

1

5

output:

NO

YES

YES

my code:

https://codeforces.me/contest/1742/submission/203843549

can you send me the correct code?

Given 2 strings ,determine if they are anagrams of each other.

example :

input:

listen silent

output:

True

C. Word Game time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output Three guys play a game: first, each person writes down n distinct words of length 3 . Then, they total up the number of points as follows:

if a word was written by one person — that person gets 3 points, if a word was written by two people — each of the two gets 1 point, if a word was written by all — nobody gets any points. In the end, how many points does each player have? Input The input consists of multiple test cases. The first line contains an integer t (1≤t≤100 ) — the number of test cases. The description of the test cases follows.

The first line of each test case contains an integer n (1≤n≤1000 ) — the number of words written by each person.

The following three lines each contain n distinct strings — the words written by each person. Each string consists of 3 lowercase English characters.

Output For each test case, output three space-separated integers — the number of points each of the three guys earned. You should output the answers in the same order as the input; the i -th integer should be the number of points earned by the i -th guy.

Example inputCopy 3 1 abc def abc 3 orz for qaq qaq orz for cod for ces 5 iat roc hem ica lly bac ter iol ogi sts bac roc lly iol iat outputCopy 1 3 1 2 2 6 9 11 5 Note In the first test case:

The word abc was written by the first and third guys — they each get 1 point. The word def was written by the second guy only — he gets 3 points.

D. Odd Queries time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output You have an array a1,a2,…,an . Answer q queries of the following form:

If we change all elements in the range al,al+1,…,ar of the array to k , will the sum of the entire array be odd? Note that queries are independent and do not affect future queries. Input Each test contains multiple test cases. The first line contains the number of test cases t (1≤t≤104 ). The description of the test cases follows.

The first line of each test case consists of 2 integers n and q (1≤n≤2⋅105 ; 1≤q≤2⋅105 ) — the length of the array and the number of queries.

The second line of each test case consists of n integers ai (1≤ai≤109 ) — the array a .

The next q lines of each test case consists of 3 integers l,r,k (1≤l≤r≤n ; 1≤k≤109 ) — the queries.

It is guaranteed that the sum of n over all test cases doesn't exceed 2⋅105 , and the sum of q doesn't exceed 2⋅105 .

Output For each query, output "YES" if the sum of the entire array becomes odd, and "NO" otherwise.

You can output the answer in any case (upper or lower). For example, the strings "yEs", "yes", "Yes", and "YES" will be recognized as positive responses.

Example inputCopy 2 5 5 2 2 1 3 2 2 3 3 2 3 4 1 5 5 1 4 9 2 4 3 10 5 1 1 1 1 1 1 1 1 1 1 3 8 13 2 5 10 3 8 10 1 10 2 1 9 100 outputCopy YES YES YES NO YES NO NO NO NO YES Note For the first test case:

If the elements in the range (2,3) would get set to 3 the array would become {2,3,3,3,2} , the sum would be 2+3+3+3+2=13 which is odd, so the answer is "YES". If the elements in the range (2,3) would get set to 4 the array would become {2,4,4,3,2} , the sum would be 2+4+4+3+2=15 which is odd, so the answer is "YES". If the elements in the range (1,5) would get set to 5 the array would become {5,5,5,5,5} , the sum would be 5+5+5+5+5=25 which is odd, so the answer is "YES". If the elements in the range (1,4) would get set to 9 the array would become {9,9,9,9,2} , the sum would be 9+9+9+9+2=38 which is even, so the answer is "NO". If the elements in the range (2,4) would get set to 3 the array would become {2,3,3,3,2} , the sum would be 2+3+3+3+2=13 which is odd, so the answer is