Create Readme.md

Author: Sahil280599

Daily Coding Problem/00526/Readme.md

@@ -0,0 +1,29 @@
+# Policemen catch thieves
+
+Given an array of size n that has the following specifications: 
+
+Each element in the array contains either a policeman or a thief.
+Each policeman can catch only one thief.
+A policeman cannot catch a thief who is more than K units away from the policeman.
+We need to find the maximum number of thieves that can be caught.
+Examples: 
+ 
+```bash
+Input : arr[] = {'P', 'T', 'T', 'P', 'T'},
+            k = 1.
+Output : 2.
+```
+Here maximum 2 thieves can be caught, first
+policeman catches first thief and second police-
+man can catch either second or third thief.
+
+```
+Input : arr[] = {'T', 'T', 'P', 'P', 'T', 'P'}, 
+            k = 2.
+Output : 3.
+```
+```
+Input : arr[] = {'P', 'T', 'P', 'T', 'T', 'P'},
+            k = 3.
+Output : 3.
+```