2018-12 在职刷题保持状态， 每天1题+ML insights

Day11

No proceeding with G and no surprise. Fight on and better prepared next time.

Solved 508.
Big weather in Bay Area. Take my wife to Anu Nuevo for elephant seal seeing.

Day12

Beautiful day in Bay Area.

Solved 517.


The idea is to calculate the net surplus or deficit in terms of dresses for a group of machines from 0 to i.

Note that from this group of machines, the maximum output/input throughput is 1/per move. So the minimal number of steps to make the surplus/deficit balanced is abs(surplus or deficit)

        Within that group, the minimal number of steps to make each individual machine balanced is the:
        max(machines-dress_per_machine, (dress_per_machine/machines[i])//2)
        because for machines with surplus, the max output throughput is 1/per move
                                        with deficit, the max input throughput is 2/per move
        The final answer is the max of above both[/i]
[i]Solved 221. A brutal force solution can be O(n^3). Need something smarter.[/i]

[i]Solved 658. Binary search + two pointers. O(max(k, logn)) solution.[/i]

Solved 532.
Solved 32.

Day13

Planned paper revision today and tomorrow.

Solved 45 and 55. Good to learn that BFS solves problems that are so tempting to solve with DP.
Solved 12+13 on the way to work.

Solved 71 with stack.

Day14

Unbelievably light traffic on 101.

Solved 536,537,538.
Solved 545.

Key idea is to get the leaves first and
        decide the boundary condition based on existence of left/right subtree

Day15

Headed to Vegas today and keep leeting.

Solved 617, 24, 25. Recursive method solves LinkedList problem so aptly whereas limited by the depth of recursion stack.
Solved 640 with regex. Regex is so powerful!

        给你点个赞！

Day16.

6th time in Vegas. Keep leeting.

Solved 645.
Solved 646. DP solution TLE and then I realized this is just simply the same problem as interval scheduling (very first problem in Intro 2 Algorithm) which EDF is the greedy solution to it.
Solved 716. The key idea is to push (element, maxsofar, maxidx) to stack.

Day 16.

Surprised that my previous post is gone.

Solved 645, 646 (Interval scheduling), 716 (push (cur, maxsofar, maxid)).

Day17.

Visited Page and antelop canyon. Amazing place.
Exhausting day and had a dead batter in middle of nowhere. Managed to jumpstart the car.

Solved 38.
Solved 347 with bucket sort

Day18.

Leeting before heading out.

Solved 661.

Solved 662 with BFS + pair + leftmost/rightmost index record keeping.

Solved 663 with two pass. First pass get the all sums and second pass check if a substree sums up to half of the all sums.

Leetcode down.....