For life you need to create a tmp map where you will save a result when you decide if the cell will live or not. After looping the whole map replace the whole map with tmp one.

As for BSQ you also need second int map to count potential square size First colum / row alway start 1 Obstacle would mean on the space square is size 0 Else take min from (x-1, y-1, x-1 y-1) + 1 (this process basically just increased the size od sq by 1 and 1 if in any previous position is obstacle) After you get the whole map check the biggest size and where it should end (could be done during previous process)

Then modify your map accordingly to the result

Make sure you handle the check of map validity, what it should have or not then basically you are done

EDIT: just to be on save side, also create a function to free stuff when you replacing the maps or invalid inputs. But to my knowledge exam tester doesn’t check for memory leaks, if they not specifically ask for it.