def cavityMap(n,grid):
    modified=list(grid)
    for r in range(1,n-1):
        for c in range(1,n-1):
            if all([grid[r][c] > adj for adj in[grid[r+1][c],grid[r-1][c],grid[r][c+1],grid[r][c-1]]]):
                ss=list(modified[r])
                ss[c]="X"
                modified[r]="".join(ss)
    return modified

def cavityMap(a):
    for i in range(1,len(a)-1):
        for j in range(1,len(a[i])-1):
            if a[i-1][j]<a[i][j] and a[i+1][j]<a[i][j] and a[i][j-1]<a[i][j] and a[i][j+1]<a[i][j]:
                a[i]=a[i][:j]+"X"+a[i][j+1:]
    return a

public static List<String> cavityMap(List<String> grid) {
    // Write your code here

for(int i=1;i<grid.size()-1;i++)
{
    int len=grid.get(i).length()-1;
    for(int j=1;j<len;j++)
    {
        int cellUp=grid.get(i-1).charAt(j)-48;
        int cellDown=grid.get(i+1).charAt(j)-48;
        int cellLeft=grid.get(i).charAt(j-1)-48;
        int cellRight=grid.get(i).charAt(j+1)-48;
        int cell = grid.get(i).charAt(j)-48;

        if(cell>cellUp && cell>cellDown && cell>cellLeft && cell>cellRight)
            {
                char[] ch=grid.get(i).toCharArray();
                ch[j]='X';
                grid.remove(i);
                grid.add(i,String.valueOf(ch));
            }
    }
}
return grid;
    }

def cavityMap(grid):
    # Write your code here
    for i in range(1, len(grid)-1):
        for j in range(1, len(grid[i])-1):
            if grid[i][j] > max(grid[i-1][j], grid[i][j-1], grid[i+1][j], grid[i][j+1]):
                grid[i] = grid[i][:j] + 'X' + grid[i][j+1:]
    return grid

def cavityMap(grid):
    # Write your code here
    for i in range(1, len(grid)-1):
        for j in range(1, len(grid[i])-1):
            if grid[i][j-1] < grid[i][j] and grid[i-1][j] < grid[i][j] and grid[i][j+1] < grid[i][j] and grid[i+1][j] < grid[i][j]:
                grid[i] = ''.join(['X' if a == j else d for a, d in enumerate(grid[i])])
    return grid

def cavityMap(grid):
    arrlen = len(grid)
    cellidupdate = list()
    for i in range(1, arrlen-1):
        currentrow = list(grid[i])
        for j in range(1, arrlen-1):
            #print(grid[i])
            currcell = currentrow[j]
            _n = int(grid[i-1][j])
            _e = int(grid[i][j+1])
            _s = int(grid[i+1][j])
            _w = int(grid[i][j-1])
            if int(currcell) > max(_n, _e, _s, _w):
                cellidupdate.append([i,j])
    #print(cellidupdate)
    for i in cellidupdate:
        newrow = list(grid[i[0]])
        newrow[i[1]] = "X"
 
        grid[i[0]] = "".join( newrow)
 
    result = grid
    return result