[Solution] Good Indices CodeChef Solution 2022

Problem

Chef has an array $A$ of length $N$.

He calls an index $i$ $(1 \leq i \leq N)$ good if there exists some $j \neq i$ such that $A_i = A_j$.

Chef can perform the following operation at most once:

• Choose any subsequence of the array $A$ and add any positive integer to all the elements of the chosen subsequence.

Solution Click Below:-  👉CLICK HERE👈

👇👇👇👇👇

Determine the maximum number of good indices Chef can get.

Input Format

• The first line of input will contain a single integer $T$, denoting the number of test cases.

Is it hot or cold CodeChef Solution

Maximise the Tastiness CodeChef Solution

N Buttons 1 Bulb CodeChef Solution

Valid Minimum CodeChef Solution

High Frequency CodeChef Solution

Split The String CodeChef Solution

Monks CodeChef Solution

Good Indices CodeChef Solution

• Each test case consists of two lines of input.
  • The first line of each test case contains a single integer $N$ denoting the length of the array $A$.
  • The second line contains $N$ space-separated integers denoting the array $A$.

Output Format

For each test case, output the maximum number of good indices Chef can get after performing the given operation at most once.