Parking Grid Coverage

Problem Statement

Parking Grid Coverage Problem Description A grid of size N * M is given to you. The grid represents a parking lot where vehicles are denoted by 'S' and empty cell denoted by 'E'. Also, you are given K charging points that can be placed on empty cells 'E'. Each charging point cover all the vehicles in its row and column. Determine if it is possible to cover all the vehicle cell using at-most K charging points. Overlapping coverage from multiple charging points is allowed. However, no two charging points can be placed on the same cell. Return true if it is possible to cover all vehicle cells within K charging points; otherwise, output false. Note: Matrix contains only 'S' and 'E'. Input Format The first line of input contains 3 space separated integer N, M and K representing row size, column size and number of charging point available. Line Two to line rows + 1 contains String of length cols: representing rows of grid. Output Format Output contains a Boolean value true if it is possible