<p>A <code>3 x 3</code> <strong>magic square</strong> is a <code>3 x 3</code> grid filled with distinct numbers <strong>from </strong>1<strong> to </strong>9 such that each row, column, and both diagonals all have the same sum.</p>

<p>Given a <code>row x col</code> <code>grid</code> of integers, how many <code>3 x 3</code> magic square subgrids are there?</p>

<p>Note: while a magic square can only contain numbers from 1 to 9, <code>grid</code> may contain numbers up to 15.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2020/09/11/magic_main.jpg" style="width: 322px; height: 242px;" />
<pre>
<strong>Input:</strong> grid = [[4,3,8,4],[9,5,1,9],[2,7,6,2]]
<strong>Output:</strong> 1
<strong>Explanation: </strong>
The following subgrid is a 3 x 3 magic square:
<img alt="" src="https://assets.leetcode.com/uploads/2020/09/11/magic_valid.jpg" style="width: 242px; height: 242px;" />
while this one is not:
<img alt="" src="https://assets.leetcode.com/uploads/2020/09/11/magic_invalid.jpg" style="width: 242px; height: 242px;" />
In total, there is only one magic square inside the given grid.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> grid = [[8]]
<strong>Output:</strong> 0
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>row == grid.length</code></li>
	<li><code>col == grid[i].length</code></li>
	<li><code>1 &lt;= row, col &lt;= 10</code></li>
	<li><code>0 &lt;= grid[i][j] &lt;= 15</code></li>
</ul>

#include <unordered_map>
#include<iostream>
class Solution {
public:
    int numMagicSquaresInside(vector<vector<int>>& grid) {
        int tRows = grid.size() - 1, tCols = grid[0].size() - 1, result = 0;
        if (tRows < 2 || tCols < 2)
            return result;
        // specifying  square
        for (int row = 0; row <= tRows - 2; row++) {
            std::cout<<"Row:"<<row<<std::endl;
            for (int col = 0; col <= tCols - 2; col++) {
                // checking square if magic square
                std::cout<<"--Sub Square-- "<<std::endl;
                std::unordered_map<int, int> myMap;
                bool bFlag = false;
                for (int a = 0; a <= 2; a++) {
                    for (int b = 0; b <= 2; b++) {
                        int no = grid[row+a][col+b];
                        if (no < 1 || no > 9) {
                            std::cout<<"bFlag-1: "<<std::endl;
                            bFlag = true;
                            break;
                        }
                        if (myMap[no] == 1) {
                            std::cout<<"->no: "<<no<<std::endl;
                            std::cout<<"bFlag-2: "<<std::endl;
                            bFlag = true;
                            break;
                        } else
                            std::cout<<"no: "<<no<<std::endl;
                            myMap[no] = 1;
                    }
                }
                if (bFlag == true) {
                } else {
                    for (int i = 0; i <= 0; i++) {
                        int diagonal1 = grid[row][col] +
                                        grid[row + 1][col + 1] +
                                        grid[row + 2][col + 2];
                        int diagonal2 = grid[row][col + 2] +
                                        grid[row + 1][col + 1] +
                                        grid[row + 2][col];
                        if (diagonal1 != diagonal2)
                            break;
                        int row1 = grid[row][col] + grid[row][col + 1] +
                                   grid[row][col + 2];
                        int row2 = grid[row + 1][col] + grid[row + 1][col + 1] +
                                   grid[row + 1][col + 2];
                        int row3 = grid[row + 2][col] + grid[row + 2][col + 1] +
                                   grid[row + 2][col + 2];
                        if (!(row1 == row2 && row2 == row3 &&
                              row3 == diagonal1))
                            break;
                        int col1 = grid[row][col] + grid[row + 1][col] +
                                   grid[row + 2][col];
                        int col2 = grid[row][col + 1] + grid[row + 1][col + 1] +
                                   grid[row + 2][col + 1];
                        int col3 = grid[row][col + 2] + grid[row + 1][col + 2] +
                                   grid[row + 2][col + 2];
                        if (!(col1 == col2 && col2 == col3 &&
                              col3 == diagonal1))
                            break;
                        result = result + 1;
                    }
                }
            }
        }
        return result;
    }
};
12600