Adding solution of weekly contest

Author: Garvit244

1200-1300q/1275.py

@@ -0,0 +1,107 @@
+'''
+Tic-tac-toe is played by two players A and B on a 3 x 3 grid.
+
+Here are the rules of Tic-Tac-Toe:
+
+Players take turns placing characters into empty squares (" ").
+The first player A always places "X" characters, while the second player B always places "O" characters.
+"X" and "O" characters are always placed into empty squares, never on filled ones.
+The game ends when there are 3 of the same (non-empty) character filling any row, column, or diagonal.
+The game also ends if all squares are non-empty.
+No more moves can be played if the game is over.
+Given an array moves where each element is another array of size 2 corresponding to the row and column of the grid where they mark their respective character in the order in which A and B play.
+
+Return the winner of the game if it exists (A or B), in case the game ends in a draw return "Draw", if there are still movements to play return "Pending".
+
+You can assume that moves is valid (It follows the rules of Tic-Tac-Toe), the grid is initially empty and A will play first.
+
+ 
+
+Example 1:
+
+Input: moves = [[0,0],[2,0],[1,1],[2,1],[2,2]]
+Output: "A"
+Explanation: "A" wins, he always plays first.
+"X  "    "X  "    "X  "    "X  "    "X  "
+"   " -> "   " -> " X " -> " X " -> " X "
+"   "    "O  "    "O  "    "OO "    "OOX"
+Example 2:
+
+Input: moves = [[0,0],[1,1],[0,1],[0,2],[1,0],[2,0]]
+Output: "B"
+Explanation: "B" wins.
+"X  "    "X  "    "XX "    "XXO"    "XXO"    "XXO"
+"   " -> " O " -> " O " -> " O " -> "XO " -> "XO " 
+"   "    "   "    "   "    "   "    "   "    "O  "
+Example 3:
+
+Input: moves = [[0,0],[1,1],[2,0],[1,0],[1,2],[2,1],[0,1],[0,2],[2,2]]
+Output: "Draw"
+Explanation: The game ends in a draw since there are no moves to make.
+"XXO"
+"OOX"
+"XOX"
+Example 4:
+
+Input: moves = [[0,0],[1,1]]
+Output: "Pending"
+Explanation: The game has not finished yet.
+"X  "
+" O "
+"   "
+ 
+
+Constraints:
+
+1 <= moves.length <= 9
+moves[i].length == 2
+0 <= moves[i][j] <= 2
+There are no repeated elements on moves.
+moves follow the rules of tic tac toe.
+'''
+
+class Solution(object):
+    def tictactoe(self, moves):
+        """
+        :type moves: List[List[int]]
+        :rtype: str
+        """
+        def check(grid):
+            for x in range(3):
+                row = set([grid[x][0],grid[x][1],grid[x][2]])
+                if len(row) == 1 and grid[x][0] != 0:
+                    return grid[x][0]
+
+            for x in range(3):
+                column = set([grid[0][x],grid[1][x],grid[2][x]])
+                if len(column) == 1 and grid[0][x] != 0:
+                    return grid[0][x]
+
+            diag1 = set([grid[0][0],grid[1][1],grid[2][2]])
+            diag2 = set([grid[0][2],grid[1][1],grid[2][0]])
+            if len(diag1) == 1 or len(diag2) == 1 and grid[1][1] != 0:
+                return grid[1][1]
+
+            return 0
+        
+        if not moves:
+            return ""
+        grid = [[0, 0, 0], [0, 0, 0], [0,0,0]]
+        user = 1
+        for move in moves:
+            grid[move[0]][move[1]] = user
+            if user == 1:
+                user = 2
+            else:
+                user = 1
+    
+        result = check(grid)
+        if result == 1:
+            return "A"
+        elif result == 2:
+            return "B"
+        else:
+            if len(moves) == 9:
+                return "Draw"
+            else:
+                return "Pending"

1200-1300q/1276.py

@@ -0,0 +1,56 @@
+'''
+Given two integers tomatoSlices and cheeseSlices. The ingredients of different burgers are as follows:
+
+Jumbo Burger: 4 tomato slices and 1 cheese slice.
+Small Burger: 2 Tomato slices and 1 cheese slice.
+Return [total_jumbo, total_small] so that the number of remaining tomatoSlices equal to 0 and the number of remaining cheeseSlices equal to 0. If it is not possible to make the remaining tomatoSlices and cheeseSlices equal to 0 return [].
+
+ 
+
+Example 1:
+
+Input: tomatoSlices = 16, cheeseSlices = 7
+Output: [1,6]
+Explantion: To make one jumbo burger and 6 small burgers we need 4*1 + 2*6 = 16 tomato and 1 + 6 = 7 cheese. There will be no remaining ingredients.
+Example 2:
+
+Input: tomatoSlices = 17, cheeseSlices = 4
+Output: []
+Explantion: There will be no way to use all ingredients to make small and jumbo burgers.
+Example 3:
+
+Input: tomatoSlices = 4, cheeseSlices = 17
+Output: []
+Explantion: Making 1 jumbo burger there will be 16 cheese remaining and making 2 small burgers there will be 15 cheese remaining.
+Example 4:
+
+Input: tomatoSlices = 0, cheeseSlices = 0
+Output: [0,0]
+Example 5:
+
+Input: tomatoSlices = 2, cheeseSlices = 1
+Output: [0,1]
+ 
+
+Constraints:
+
+0 <= tomatoSlices <= 10^7
+0 <= cheeseSlices <= 10^7
+'''
+class Solution(object):
+    def numOfBurgers(self, tomatoSlices, cheeseSlices):
+        """
+        :type tomatoSlices: int
+        :type cheeseSlices: int
+        :rtype: List[int]
+        """
+        jumbo = tomatoSlices - 2*cheeseSlices
+        if jumbo >= 0 and jumbo%2 == 0:
+            x = jumbo/2
+            y = cheeseSlices-(jumbo/2)
+            if x >= 0 and y >= 0:
+                return [x, y]
+            else:
+                return []
+        return []
+        

1200-1300q/1277.py

@@ -0,0 +1,56 @@
+'''
+Given a m * n matrix of ones and zeros, return how many square submatrices have all ones.
+
+ 
+
+Example 1:
+
+Input: matrix =
+[
+  [0,1,1,1],
+  [1,1,1,1],
+  [0,1,1,1]
+]
+Output: 15
+Explanation: 
+There are 10 squares of side 1.
+There are 4 squares of side 2.
+There is  1 square of side 3.
+Total number of squares = 10 + 4 + 1 = 15.
+Example 2:
+
+Input: matrix = 
+[
+  [1,0,1],
+  [1,1,0],
+  [1,1,0]
+]
+Output: 7
+Explanation: 
+There are 6 squares of side 1.  
+There is 1 square of side 2. 
+Total number of squares = 6 + 1 = 7.
+ 
+
+Constraints:
+
+1 <= arr.length <= 300
+1 <= arr[0].length <= 300
+0 <= arr[i][j] <= 1
+'''
+class Solution(object):
+    def countSquares(self, matrix):
+        """
+        :type matrix: List[List[int]]
+        :rtype: int
+        """  
+    
+        p_arr = [[0 for i in range(len(matrix[0]))] for j in range(len(matrix))]  
+        result = 0
+
+        for index_i in range(1, len(matrix)):
+            for index_j in range(1, len(matrix[0])):
+                if matrix[index_i][index_j] == 1:
+                    matrix[index_i][index_j] = min(matrix[index_i-1][index_j-1], min(matrix[index_i-1][index_j], matrix[index_i][index_j-1]))+1
+        # print p_arr
+        return sum([ sum(x) for x in matrix])  

README.md

@@ -14,6 +14,9 @@ Python solution of problems from [LeetCode](https://leetcode.com/).
 ##### [Problems 1100-1200](./1200-1300q/)
 | # | Title | Solution | Difficulty |
 |---| ----- | -------- | ---------- |
+|1277|[Count Square Submatrices with All Ones](https://leetcode.com/problems/count-square-submatrices-with-all-ones/)|[Python](./1200-1300q/1277.py)|Medium|
+|1276|[Number of Burgers with No Waste of Ingredients](https://leetcode.com/problems/number-of-burgers-with-no-waste-of-ingredients/)|[Python](./1200-1300q/1276.py)|Medium|
+|1275|[Find Winner on a Tic Tac Toe Game](https://leetcode.com/problems/find-winner-on-a-tic-tac-toe-game/)|[Python](./1200-1300q/1275.py)|Easy|
 |1268|[Search Suggestions System](https://leetcode.com/problems/search-suggestions-system/)|[Python](./1200-1300q/1268.py)|Medium|
 |1267|[Count Servers that Communicate](https://leetcode.com/problems/count-servers-that-communicate/)|[Python](./1200-1300q/1267.py)|Medium|
 |1266|[Minimum Time Visiting All Points](https://leetcode.com/problems/minimum-time-visiting-all-points/)|[Python](./1200-1300q/1266.py)|Easy|