19/12/2020

Author: jameszu

Daily-challenge/Dec/18/README.md

@@ -34,16 +34,20 @@ Just do while loop and convert to decimal
 ## Code
 ```python
 class Solution:
-    def merge(self, intervals: List[List[int]]) -> List[List[int]]:
-        if len(intervals) <=1:
-            return intervals
-        intervals.sort(key=lambda key: key[0])
-        i = 0
-        while i < len(intervals)-1:
-            if intervals[i][-1] >= intervals[i+1][0]:
-                intervals[i][-1] = max(intervals[i][-1], intervals[i+1][-1])
-                intervals.pop(i+1)
+    def increasingTriplet(self, nums: List[int]) -> bool:
+        idx = 0
+        lenz = len(nums)
+        temp = temp2 = float('inf')
+        count = 0
+        for idx in range(lenz):
+            if nums[idx] <= temp:
+                temp = nums[idx]
+            elif nums[idx] <= temp2:
+                temp2 = nums[idx]
+                
+            
             else:
-                i += 1
-        return intervals
+                return True
+            
+        return False
 ```

Daily-challenge/Dec/18/sol.py

@@ -1,13 +1,17 @@
 class Solution:
-    def merge(self, intervals: List[List[int]]) -> List[List[int]]:
-        if len(intervals) <=1:
-            return intervals
-        intervals.sort(key=lambda key: key[0])
-        i = 0
-        while i < len(intervals)-1:
-            if intervals[i][-1] >= intervals[i+1][0]:
-                intervals[i][-1] = max(intervals[i][-1], intervals[i+1][-1])
-                intervals.pop(i+1)
+    def increasingTriplet(self, nums: List[int]) -> bool:
+        idx = 0
+        lenz = len(nums)
+        temp = temp2 = float('inf')
+        count = 0
+        for idx in range(lenz):
+            if nums[idx] <= temp:
+                temp = nums[idx]
+            elif nums[idx] <= temp2:
+                temp2 = nums[idx]
+                
+            
             else:
-                i += 1
-        return intervals
+                return True
+            
+        return False

Daily-challenge/Dec/19/README.md

@@ -1,38 +1,53 @@
-# Decode String
-Given an encoded string, return its decoded string.
+# Cherry Pickup II
+Given a rows x cols matrix grid representing a field of cherries. Each cell in grid represents the number of cherries that you can collect.
 
-The encoding rule is: k[encoded_string], where the encoded_string inside the square brackets is being repeated exactly k times. Note that k is guaranteed to be a positive integer.
+You have two robots that can collect cherries for you, Robot #1 is located at the top-left corner (0,0) , and Robot #2 is located at the top-right corner (0, cols-1) of the grid.
 
-You may assume that the input string is always valid; No extra white spaces, square brackets are well-formed, etc.
-
-Furthermore, you may assume that the original data does not contain any digits and that digits are only for those repeat numbers, k. For example, there won't be input like 3a or 2[4].
+Return the maximum number of cherries collection using both robots  by following the rules below:
 
+From a cell (i,j), robots can move to cell (i+1, j-1) , (i+1, j) or (i+1, j+1).
+When any robot is passing through a cell, It picks it up all cherries, and the cell becomes an empty cell (0).
+When both robots stay on the same cell, only one of them takes the cherries.
+Both robots cannot move outside of the grid at any moment.
+Both robots should reach the bottom row in the grid.
 
 
 Example 1:
 
-Input: s = "3[a]2[bc]"
-Output: "aaabcbc"
+
+
+Input: grid = [[3,1,1],[2,5,1],[1,5,5],[2,1,1]]
+Output: 24
+Explanation: Path of robot #1 and #2 are described in color green and blue respectively.
+Cherries taken by Robot #1, (3 + 2 + 5 + 2) = 12.
+Cherries taken by Robot #2, (1 + 5 + 5 + 1) = 12.
+Total of cherries: 12 + 12 = 24.
 Example 2:
 
-Input: s = "3[a2[c]]"
-Output: "accaccacc"
+
+
+Input: grid = [[1,0,0,0,0,0,1],[2,0,0,0,0,3,0],[2,0,9,0,0,0,0],[0,3,0,5,4,0,0],[1,0,2,3,0,0,6]]
+Output: 28
+Explanation: Path of robot #1 and #2 are described in color green and blue respectively.
+Cherries taken by Robot #1, (1 + 9 + 5 + 2) = 17.
+Cherries taken by Robot #2, (1 + 3 + 4 + 3) = 11.
+Total of cherries: 17 + 11 = 28.
 Example 3:
 
-Input: s = "2[abc]3[cd]ef"
-Output: "abcabccdcdcdef"
+Input: grid = [[1,0,0,3],[0,0,0,3],[0,0,3,3],[9,0,3,3]]
+Output: 22
 Example 4:
 
-Input: s = "abc3[cd]xyz"
-Output: "abccdcdcdxyz"
+Input: grid = [[1,1],[1,1]]
+Output: 4
 
 
 Constraints:
 
-1 <= s.length <= 30
-s consists of lowercase English letters, digits, and square brackets '[]'.
-s is guaranteed to be a valid input.
-All the integers in s are in the range [1, 300].<br>
+rows == grid.length
+cols == grid[i].length
+2 <= rows, cols <= 70
+0 <= grid[i][j] <= 100 <br>
 
 ## Idea
 Just do while loop and convert to decimal