@@ -0,0 +1,958 @@
+package com.fishercoder.solutions;%0A%0A/**%0A * 1277. Count Square Submatrices with All Ones%0A *%0A * Given a m * n matrix of ones and zeros, return how many square submatrices have all ones.%0A *%0A * Example 1:%0A * Input: matrix =%0A * %5B%0A *   %5B0,1,1,1%5D,%0A *   %5B1,1,1,1%5D,%0A *   %5B0,1,1,1%5D%0A * %5D%0A * Output: 15%0A * Explanation:%0A * There are 10 squares of side 1.%0A * There are 4 squares of side 2.%0A * There is  1 square of side 3.%0A * Total number of squares = 10 + 4 + 1 = 15.%0A *%0A * Example 2:%0A * Input: matrix =%0A * %5B%0A *   %5B1,0,1%5D,%0A *   %5B1,1,0%5D,%0A *   %5B1,1,0%5D%0A * %5D%0A * Output: 7%0A * Explanation:%0A * There are 6 squares of side 1.%0A * There is 1 square of side 2.%0A * Total number of squares = 6 + 1 = 7.%0A *%0A * Constraints:%0A * 1 %3C= arr.length %3C= 300%0A * 1 %3C= arr%5B0%5D.length %3C= 300%0A * 0 %3C= arr%5Bi%5D%5Bj%5D %3C= 1%0A * */%0Apublic class _1277 %7B%0A    public static class Solution1 %7B%0A        public int countSquares(int%5B%5D%5B%5D matrix) %7B%0A            int count = 0;%0A            return count;%0A        %7D%0A    %7D%0A%7D%0A

add skeleton for 1277