## Bug-oriented Programming

### Status

Recently my task is refactoring some code to a new engine, and my OKR is guaranteeing the identical results with the old one, the entire process is just like bug-oriented programming…

# Verily Phone Screen Interview

Just several days ago, I received an email from Verily, an Alphabet company which delicates in life science. Their HR passed my application and going to move me to the phone interview. However, I messed it up…

I have to say that interview is not a difficult one. The question is like a medium level question at Leetcode:

Given a 1-dimensional axis, a man can move left or right in each time unit. How many possibilities that the man stands on x point after t time units?

I stupidly tried DP at first and struggled in how to implement the state transform formula, that wastes a lot of time.

Today, I reviewed this question and found a fairly easy solution. We do not even need Dynamic Programming.

```l + r = t   (1)
r - l = x   (2)```

Once we solve this equation, we can directly calculate the number of combinations. For example, the total possibilities of that man stand on point 5 after 9 time units is C72 = 21.

### Quote

Some people can read War and Peace and come away thinking it’s a simple adventure story. Others can read the ingredients on a chewing gum wrapper and unlock the secrets of the universe.

Lex Luthor

# Levithan

Leviathan, or The Matter, Forme and Power of a Common Wealth Ecclesiastical and Civil

# In me the tiger sniffs the rose

I wanted you to see what real courage is, instead of getting the idea that courage is a man with a gun in his hand. It’s when you know you’re licked before you begin anyway and you see it through no matter what. You rarely win, but sometimes you do.