← All problemsSign in

COVID Search

Due to the current COVID situation, the programmers decided to help volunteers search for houses for performing door to door tests. But, they need to find if the door number is present in a particular area in the least possible time so that the volunteers can maximize the number of tests taken on that day. You are given an array $A[]$ of $N$ numbers of door numbers and another number $M$ which

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