8月刷题/Mock interview接龙活动（缺米刷题的来）

8/15 3题
435. Non-overlapping Intervals 贪心，对intervals进行排序
452. Minimum Number of Arrows to Burst Balloons 贪心，跟435有点像
484. Find Permutation 要搞清楚1,2,3....n是最小的，那么结果一定是最接近这个min的，每个位置上一定是满足pattern的最小数，可以用栈做

做了5题：
Magnetic Force Between Two Balls
Minimum Operations to Make Array Equal
Three Consecutive Odds
Non-overlapping Intervals
Find Permutation

8/15打卡第二天
4.Median of Two Sorted Arrays
const findMedianSortedArrays = (nums1, nums2) => {
    const union = [...nums1, ...nums2].sort((a, b) => a - b);
   
    if (union.length % 2 !== 0) {
        return union[Math.floor(union.length / 2)]
    }
   
    else{
        const lBound = union[(union.length / 2)];
        const uBound = union[(union.length / 2) - 1];
        return (lBound + uBound) / 2;
    }
};
5.Longest Palindromic Substring       
var longestPalindrome = function(s) {
    let res = "", i = 0;

    while(i < s.length) {
        let
        isInt = i.toString().indexOf('.'),
        start = isInt == -1 ? i : Math.floor(i),
        end = isInt == -1 ? i : Math.ceil(i),
        len = res.length;

        while(start >= 0 && end < s.length && s[start] === s[end]) {
            if(end - start + 1 > len) {
                res = s.substring(start, end+1);
            }
            start--;
            end++;
        }
        i+=0.5;
        }
    return res;
};
6.ZigZag Conversion   
var convert = function(s, numRows) {
// Edge Case: check if string do not need to change order
if(s.length < numRows || numRows < 2 || s.length < 2) {
    return s;
}
let returnS = '';
// Loop for each rows
for (let j = 0; j < numRows; j++) {
    //2 * (numRows - 1) is the range for each row
    for (let i = j; i < s.length; i += 2 * (numRows - 1)) {
        returnS += s[i];
        //the middle row(s) have extra numbers
        if (j !== 0 && j < numRows - 1) {
            const intermediateIndex = i + 2 * (numRows - j - 1);
            if (s[intermediateIndex]) {
                returnS += s[intermediateIndex];
            }
        }
    }
}
return returnS;
};

打卡第五天 继续复习亚麻常见题

打卡第三天
Kth Smallest Element in a Sorted Matrix
game of life 特别是 infinite board 的followup
longest consecutive sequence

【8.16打卡】 144，94，145，102，100，101

binary search tree

日期: 8/16/2020
题目: [4]
123. Best Time to Buy and Sell Stock III
1541. Minimum Insertions to Balance a Parentheses String
1550. Three Consecutive Odds
1553. Minimum Number of Days to Eat N Oranges

昨天每日挑战加周赛，这次周赛的题目我感觉相对简单，就是第三道题没想到可以用binary search来做。前两道题都比之前想的时间要少。希望下次能够成为3题选手

8.16 Sorting+PQ 总结+ Q75, 136, 234,394