3 Sorted Arrays

CodeChefOpen on judge ↗

This time Laltu wanted the question to be staightforward. So, given 3 1-indexed sorted arrays (A[], B[], C[]), find the number of triplets 1 ≤ i ≤ j ≤ k, such that: A[i] ≤ B[j] ≤ C[k]. Note that i, j and k don't exceed the size of respective arrays. Input First line contains T, the number of test cases. Each test case consists of: - P, the length of first array. The next line will consist of

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