← OYO questions

Policemen catch thieves

Filed under OYO · Also reported at National Instruments

Given an array representing positions of policemen ('P') and thieves ('T'), and an integer k, find the maximum number of thieves that can be caught. Each policeman can catch at most one thief who is…

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related OYO questions

Collected from public candidate posts and coding forums. Updated Nov 2026.