Given a string containing only dots and asterisk. A dot represents free spaces and represents lamps. A lamp at position can spread its light at locations i-1, i and i+1. Determine the minimum number of lamps needed to illuminate the whole string.
Input: str = “……”
There are initially no lamps so the whole string is in dark.We will install lamps at position 2 and 5.The lamp at position 2 will illuminate 1, 2, 3 and lamp at position 5 will illuminate 4, 5, 6 thus the whole string is illuminated.
Input: str = “*.*”
Approach: If we don’t have any asterisk then for each 3 dots we need one lamp, so the answer is ceil(D/3) where D is the number of dots. The problem can be solved by creating a copy of the given string, and for each asterisk in the first string we place an asterisk at it’s adjacent indices in the second string.
So if the given string is “…**..” then the second string will be “..****.”.
After that, we count the number of dots in each block of consecutive dots and find the number of needed lamps for that block, For each block the answer will be ceil(D/3) and the total sum of these lamps will be the answer for the complete string.
Below is the implementation of the above approach:
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.