Solution of Rotten Oranges and Coursin in Binary Tree

Author: Garvit244

900-1000q/993.py

@@ -0,0 +1,55 @@
+'''
+In a binary tree, the root node is at depth 0, and children of each depth k node are at depth k+1.
+
+Two nodes of a binary tree are cousins if they have the same depth, but have different parents.
+
+We are given the root of a binary tree with unique values, and the values x and y of two different nodes in the tree.
+
+Return true if and only if the nodes corresponding to the values x and y are cousins.
+
+Input: root = [1,2,3,4], x = 4, y = 3
+Output: false
+'''
+
+# Definition for a binary tree node.
+# class TreeNode(object):
+# def __init__(self, x):
+# self.val = x
+# self.left = None
+# self.right = None
+
+class Solution(object):
+ def adjacent(self, root, node1, node2):
+ if not root:
+ return False
+ 
+ value = False
+ if (root.right and root.left):
+ value = ((root.left.val == node1 and root.right.val == node2) or 
+ (root.left.val == node2 and root.right.val == node1))
+ 
+ return (value or
+ self.adjacent(root.left, node1, node2) or
+ self.adjacent(root.right, node1, node2))
+ 
+ def _level(self, root, node, level):
+ if not root:
+ return 0
+ if root.val == node:
+ return level
+ 
+ left_level = self._level(root.left, node, level+1)
+ if left_level != 0:
+ return left_level
+ return self._level(root.right, node, level+1)
+ 
+ def isCousins(self, root, x, y):
+ """
+ :type root: TreeNode
+ :type x: int
+ :type y: int
+ :rtype: bool
+ """
+ if ((self._level(root, x, 1) == self._level(root, y, 1)) and not self.adjacent(root, x, y)):
+ return True
+ return False

900-1000q/994.py

@@ -0,0 +1,74 @@
+'''
+In a given grid, each cell can have one of three values:
+
+the value 0 representing an empty cell;
+the value 1 representing a fresh orange;
+the value 2 representing a rotten orange.
+Every minute, any fresh orange that is adjacent (4-directionally) to a rotten orange becomes rotten.
+
+Return the minimum number of minutes that must elapse until no cell has a fresh orange. If this is impossible, return -1 instead.
+'''
+
+class Solution(object):
+ def valid(self, row, col, row_size, col_size):
+ return row >= 0 and col >= 0 and row < row_size and col < col_size
+ 
+ def orangesRotting(self, grid):
+ """
+ :type grid: List[List[int]]
+ :rtype: int
+ """
+ queue = []
+ for row_index in range(len(grid)):
+ for col_index in range(len(grid[0])):
+ if grid[row_index][col_index] == 2:
+ queue.append((row_index, col_index))
+
+ result = 0
+ queue.append((-1, -1))
+ while queue:
+ flag = False
+ print queue
+ while(queue[0][0] != -1 and queue[0][1] != -1):
+	(row, col) = queue[0]
+ if self.valid(row+1, col, len(grid), len(grid[0])) and grid[row+1][col] == 1 :
+ if not flag:
+ result += 1
+ flag =True
+ grid[row+1][col] = 2
+ row += 1
+ queue.append((row, col))
+ row -= 1
+ if self.valid(row-1, col, len(grid), len(grid[0])) and grid[row-1][col] == 1 :
+ if not flag:
+ result += 1
+ flag =True
+ grid[row-1][col] = 2
+ row -= 1
+ queue.append((row, col))
+ row += 1
+ if self.valid(row, col+1, len(grid), len(grid[0])) and grid[row][col+1] == 1 :
+ if not flag:
+ result += 1
+ flag =True
+ grid[row][col+1] = 2
+ col += 1
+ queue.append((row, col))
+ col -= 1
+ if self.valid(row, col-1, len(grid), len(grid[0])) and grid[row][col-1] == 1 :
+ if not flag:
+ result += 1
+ flag =True
+ grid[row][col-1] = 2
+ col -= 1
+ queue.append((row, col))
+ col += 1
+ queue.pop(0)
+ queue.pop(0)
+ if queue:
+ queue.append((-1, -1))
+ for row_index in range(len(grid)):
+ for col_index in range(len(grid[0])):
+ if grid[row_index][col_index] == 1:
+ return -1
+ return result

README.md

@@ -7,6 +7,8 @@ Python solution of problems from [LeetCode](https://leetcode.com/).
 ##### [Problems 900-1000](./900-1000q/)
 | # | Title | Solution | Difficulty |
 |---| ----- | -------- | ---------- |
+|994|[Rotting Oranges](https://leetcode.com/problems/rotting-oranges/) | [Python] | (./900-1000q/994.py)|Easy|
+|993|[Cousins in Binary Tree](https://leetcode.com/problems/cousins-in-binary-tree/) | [Python]|(./900-1000q/993.py)|Easy|
 |991|[Broken Calculator](https://leetcode.com/problems/broken-calculator/) | [Python](./900-1000q/991.py)|Medium|
 |990|[Satisfiability of Equality Equations](https://leetcode.com/problems/satisfiability-of-equality-equations/) | [Python](./900-1000q/990.py)|Medium|
 |989|[Add to Array-Form of Integer](https://leetcode.com/problems/add-to-array-form-of-integer/)|[Python](./900-1000q/989.py)|Easy|