Thanks a lot...Your solution helped

Thanks man it helped.

Thanks

thanx alot

Can you do it in C++ without using C commands?

That works, but it's easier to do using string (or char array) because you can easily assign a cell to 'X' if it's a cavity, which would be a better approach (in my opinion). Moreover, comparing characters works fine as well since ascii value '9' > '8' > '7' > ...

how to store X in int array

There's also no need to interpret the input as digits. '9' is strictly larger than '8' as well, etc.

how do i print the array

how do i print the array

If you're dong this in C there's no point in doing the ascii to number conversion, use scanf(" %c",&array[x][y]);

You can take advantage of the fact that ascii 'X' > ascii'9' > ascii '1' and just compare the chars directly.

C# read as string

static string[] cavityMap(string[] grid)
{
    for (int i = 1; i < grid.Length - 1; i++)
    {
        for (int j = 1; j < grid[i].Length - 1; j++)
        {
            int middleUpper = (int)char.GetNumericValue(grid[i - 1][j]);
            int left = (int)char.GetNumericValue(grid[i][j - 1]);
            int right = (int)char.GetNumericValue(grid[i][j + 1]);
            int middleUnder = (int)char.GetNumericValue(grid[i + 1][j]);

            var adjacent = new int[4]
            {
                        middleUpper,
                left,                   right,
                        middleUnder
            };

            if (adjacent.Any(a => a < 0)) continue;//smaller than 0 if X in adjacent cell


            int ij = (int)char.GetNumericValue(grid[i][j]);

            if (adjacent.All(a => a < ij))//Can use StringBuilder instead(faster?)
                grid[i] = grid[i].Remove(j, 1).Insert(j, "X");

        }
    }

    return grid;
}

Thanks man!!! I was confused how to take the input

For the Java people wondering how to accept the String matrix, here is a way,

` char c[][]=new char[n][n]; String s[]=new String[n];

     for(int i=0;i<n;i++){
         s[i]=sc.next();
                     }

     for(int i=0;i<n;i++){ 
         int k=0;

         for(int j=0;j<n;j++){

           c[i][j]=s[i].charAt(k);

           k++;
                         }}       

I also had the same issue, there is also the same issue in one of test cases when you submit but I still got full points even though that case failed.

strictly smaller depth

->

1) is right or left of the current value a value that is greater or equals

2) is above or below of the current value a value that is greater or equals

Should be

1) is right or left of the current value a value that is greater

2) is above or below of the current value a value that is greater

Conditions: right,left,top,down < center

Thanks that was my mistake

Not always. You can still read it as numbers. I used Java's BigInteger.

thnX..

Use Python. You don't have to worry about the type. :P

Thanks!

if we replace %1d with %d... why the input contains extra zeros?? what is the significance of 1? can you please explain..

Nifty!

yeah..!! Thanks.....

Thanks! Very helpful

coool!

nice

thank you for the code

I had also gone with the same logic..but the problem is that some test cases contain spaces whereas some test cases don't have spaces.. Please help me on that..

I did it almost like you. I just didnt use StringBuilder, only System.out.print(char) everytime you deal with one of them into the deepest for loop, and System.out.println() everytime that loop ends, so you can keep some memory space and also the last for loop for printing the grid is not necessary.

I dont know if there's a better solution in Java, but I bet this one could be =)

no need to use stringbuilder

grid[i] = grid[i].substring(0,j) + "X" + grid[i].substring(j+1);

I'll add my voice in favor of using a StringBuilder, although I admit not in the way that maxinshen chose to use it.

The problem with SergioGM's suggestion is that writing to the output buffer one character at a time can really slow things down, because it will get flushed after each of those write operations. There's challenges on HR where trying that will result in a TE.

With yli131's suggestion, you'd be slowing things down, because ironically the compiler will use a StringBuilder to perform those concatinations. It's slower overally because it will need the substrings first, so it produces wholly new String objects for each one, and then throws them away.

My own suggest is to move the sb instantiation outside of the for(int j ...) loop, modify sb as needed, and then after the inner loop finishes write the new value back to grid[i].

One other thing...

Instead of doing a somewhat expensive and unnecessary function call with .getNumericValue(), you can convert the digits yourself. To do that, you take advantage of the fact that chars are just numbers under the hood, and that the input format for this challenge uses simple ASCII. That means the digits 0 to 9 have sequential integer values, and so '3' - '0' == 3. If you're curious, you can click through the source here.

Hope some of that was interesting and useful!

Thanx

this is how I did it, 2 dimension array then compared in for loop against adjacent arrays, using key of current char and replaced current value with X if conditions are met. No tests took longer than .02s.

You are assigning a line of string into a 1D array. Then how does it automatically become a 2D array?

I did the same thing. My second test case is failing.

Yes absolutely! Even Sample test case 1 has ' ' in it, while 0 clearly does not. pfft!