Long Distance First

CodeChefOpen on judge ↗

The chef is playing a game of long distance. Chef has a number K and he wants to find the longest distance between the index of the first and the last occurrence of K in a given array of N numbers. ###Input: - First-line will contain $T$, the number of test cases. Then the test cases follow. - Each test case contains two lines of input. - Next line with Two integers in one line $K, N$. -

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI