Catch Me If You Can
CodeChefOpen on judge ↗
Sherlock and Watson are about to uncover the true identity of the most dangerous serial killer in the city . The last step in completing their mission is solving the puzzle given by the killer . They will be given an array of integers(1 based indexing) containg $N$ elements and $Q$ queries. Each query is of the form '$l$ $r$ $x$ $y$' and they need to find the number of elements in the range $l$ t
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.
Sign in to chat with the tutor and save your progress.
Sign in to start