Weird Queries

CodeChefOpen on judge ↗

Given an $Array$ of size $N$ , where $1<= A[i] <= 10$ , You Have to Process $Q$ Queries , There are $2$ types of Queries : - $Type$ $1$ : $1$ $val1$ $val2$ $L$ $R$ $val3$ $Type$ $2$ : $2$ $pos$ $val$ $Description$ $of$ $Queries$ :- $Type$ $1$ : You have to find two values , consider that they are $dis1$ and $dis2$. $ dis1$ :- minimum distance between the $val

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