← All problemsSign in

kaalu and work

Kaalu has given work by his grandfather. he has given two array $A$rr1 and $A$rr2 of length $M$ and $N$ respectively . Kaalu has given one number $K$ and he has to count a number of element less than $K$in $A$rr1 and $A$rr2 , then he has to print the max number of count which is less than $K$. ###Input: - First line will contain $T$ , number of testcases. - Each testcase contains of a si

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

Sign in to chat with the tutor and save your progress.

Sign in to start