14/12/2020 v2

Author: jameszu

Daily-challenge/Dec/13/README.md

@@ -1,37 +1,18 @@
-# Populating Next Right Pointers in Each Node
-You are given a perfect binary tree where all leaves are on the same level, and every parent has two children. The binary tree has the following definition:
+# Burst Balloons
+Given n balloons, indexed from 0 to n-1. Each balloon is painted with a number on it represented by array nums. You are asked to burst all the balloons. If the you burst balloon i you will get nums[left] * nums[i] * nums[right] coins. Here left and right are adjacent indices of i. After the burst, the left and right then becomes adjacent.
 
-struct Node {
-  int val;
-  Node *left;
-  Node *right;
-  Node *next;
-}
-Populate each next pointer to point to its next right node. If there is no next right node, the next pointer should be set to NULL.
+Find the maximum coins you can collect by bursting the balloons wisely.
 
-Initially, all next pointers are set to NULL.
+Note:
 
- 
+You may imagine nums[-1] = nums[n] = 1. They are not real therefore you can not burst them.
+0 ≤ n ≤ 500, 0 ≤ nums[i] ≤ 100
+Example:
 
-Follow up:
-
-You may only use constant extra space.
-Recursive approach is fine, you may assume implicit stack space does not count as extra space for this problem.
- 
-
-Example 1:
-
-
-
-Input: root = [1,2,3,4,5,6,7]
-Output: [1,#,2,3,#,4,5,6,7,#]
-Explanation: Given the above perfect binary tree (Figure A), your function should populate each next pointer to point to its next right node, just like in Figure B. The serialized output is in level order as connected by the next pointers, with '#' signifying the end of each level.
- 
-
-Constraints:
-
-The number of nodes in the given tree is less than 4096.
--1000 <= node.val <= 1000<br>
+Input: [3,1,5,8]
+Output: 167 
+Explanation: nums = [3,1,5,8] --> [3,5,8] -->   [3,8]   -->  [8]  --> []
+             coins =  3*1*5      +  3*5*8    +  1*3*8      + 1*8*1   = 167<br>
 
 ## Idea
 

Daily-challenge/Dec/14/README.md

@@ -1,23 +1,24 @@
-# Poor Pigs
+# Palindrome Partitioning
+Given a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome partitioning of s.
 
-Solution
-There are 1000 buckets, one and only one of them is poisonous, while the rest are filled with water. They all look identical. If a pig drinks the poison it will die within 15 minutes. What is the minimum amount of pigs you need to figure out which bucket is poisonous within one hour?
-
-Answer this question, and write an algorithm for the general case.
+A palindrome string is a string that reads the same backward as forward.
 
 
 
-General case:
+Example 1:
 
-If there are n buckets and a pig drinking poison will die within m minutes, how many pigs (x) you need to figure out the poisonous bucket within p minutes? There is exactly one bucket with poison.
+Input: s = "aab"
+Output: [["a","a","b"],["aa","b"]]
+Example 2:
 
+Input: s = "a"
+Output: [["a"]]
 
 
-Note:
+Constraints:
 
-A pig can be allowed to drink simultaneously on as many buckets as one would like, and the feeding takes no time.
-After a pig has instantly finished drinking buckets, there has to be a cool down time of m minutes. During this time, only observation is allowed and no feedings at all.
-Any given bucket can be sampled an infinite number of times (by an unlimited number of pigs).<br>
+1 <= s.length <= 16
+s contains only lowercase English letters.<br>
 
 ## Idea