7月缺米的来刷题/Mock interview活动

日期: 7/29/2020
题目: [5]
300. Longest Increasing Subsequence
309. Best Time to Buy and Sell Stock with Cooldown
334. Increasing Triplet Subsequence
354. Russian Doll Envelopes
1526. Minimum Number of Increments on Subarrays to Form a Target Array

7/29
array can be sorted in one swap
count all valid pick up and delivery options
leftmost  column with at leasst a one

練習金人OA 還有幾題heap

感觉有些题目很刁钻古怪，只有知道了某些特定技巧才会，
例如258 add digit
不知道这类题目要考察什么

每日一题。今天完成了reorder data in log files.

July 29号。。七月第25天打卡了
Sliding Window 两题，需要审题然后转化成sliding window的题
Fruit Into Baskets         --》Maximum length of subarray containing at most 2 type of fruits
Replace the Substring for Balanced String         ->Minimum Length of Substring contains "all the required extra characters"

State DP 一题
Best Time to Buy and Sell Stock with Cooldown        看了花花酱的解释也是云里雾里。。DP真是绕晕

0729打卡，leetcode刷了3题

7.29
stack 三道题：
856. Score of Parentheses
84. Largest Rectangle in Histogram
42. Trapping Rain Water

打卡打卡zszs

Day 29!因为面试的关系，再回顾一下之前刷的题。
Basic calculator I，II：可以用stack做比较standard，但其实不用stack存个tmp也能做，而且时间更快也节省空间
Basic calculator III：加上括号和乘除就要recursively的compute。可以写一个dfs。
Boundary of binary tree：第一次写的非常复杂，后来发现还是用dfs做更简洁。dfs函数加上两个boolean variable，keep track of是否在左boundary和右boundary，在递归加入answer中。