For next house

3 car garage !! or 2 Garage width: better have two suv cars width + one trash can width Water bibs on 4 sides of the house for easy watering if no under ground watering system One closet on the first floor need to have a plug to hang dyson charger One plug in the…

如何谈offer…

谈一家公司的offer 不要自己先给数字!!!除非我非常非常想要去这个公司, 似乎可以给一个地里research到的顶包且说如果你给我这个数字, 我就立马签offer这样 (start date此时可能也需要根据对方公司要求的来, 尽早入职这种) 谈两家公司的offer 警惕对方问问题!!!!不要透露给对方过多另外一个公司的消息!!! 对方公司给你什么级别? 大多数情况下最好别说如果在和B公司对话, A公司给的级别超级高说出来可以让B公司给更多钱的情况下是可以说的当A公司给的级别不如B公司时, 千万不要说对方公司给你哪个组? 大多数情况下最好不要说公司里面组org的不一样似乎salary level不太一样同样的,如果说了能够让当前公司给更多的钱, 就说, 不能的话就别说如果A公司是一个vanilla icecream而B公司是一个chocolate icecream, 请你说说A和B公司的看法警惕警惕!!! Recruiter在谈口风看你看中哪个公司的哪些方面也可以模糊的讲: 我两个都喜欢, 两个都是我的dream company这样吧...你会更加偏向于那个公司? 注意不要讲我偏向于你们公司!!!应该讲我两个公司都喜欢, 我要根据组和最后给的level和compensation 定!!!!

记一下

10.18.2021 骨骼: 1 BQ + 4 coding. BQ: most challenging thing/ doing things out of your way/ help college / conflict / organize an offsite event what would you do ???? count of subarrays sums up to k / multiples of k A -2 B-4 C-1 output according to its weight -> what if weight…

记一下

脸书电话 09.07.2021 valid palindrome -> return false/true -> case insensitive; will have spaces/numbers/commalongest path length across a node (path length is edge not node count) 脸书onsite 10.26.2021 Design Search for fb posts Design top 10 favorite songs within 7 days for a usercoding: parentheses validate parentheses time O(n) spaceO(1)input char[] remove invalid parentheses and return its…

注意事项

45 min interview 5 mins introduction35 min for 2 questions15 min for 1st question: time check 20 min20 min for 2nd question: time check 40 min5 mins questions time Review questions carefully! 一定要问到所有的问题to clarify questions 不要花太长时间在写thoughts上 -> 还是不够熟练的原因 用example run through thoughts的时候, 就要想清楚所有. 尽量不要miss等到写代码到那才想起来不对. Strings Alphabetic only? Numeric? Spaces? Special Characters? Case sensitive ? Case…

IntelliJ setup for LC with unit tests

Feel like it's be ages since last time I coded (just kidding!) I want to have a pretty IntelliJ project setup for my leetcode practises. install gradle: brew install gradle create a gradle project in IntelliJ, it creates main and test packages automatically for mLooks like I only have JUnit 4, I want to have…

Functional Programming (1)

I think I am going CRAZY..... two counter function： counter1：returns a FUNCTION. counter2：returns an int value. function counter1(){ let count = 70; return function(){  //function innerFunction() count ++; return count;}} function counter2(){ let count = 0; count ++; return count;} what does below console.log() print ？ console.log(counter1); -> fn definition console.log(counter2); -> fn definition console.log(counter1());…

My Bullet Journal Schema

Why I don’t like most of the daily planner notebooks? Some of them pages are already printed with dates. If you start now mid 2018, you have to buy a planner 2018 - 2019. Then the pages from 2018/01 - 2018/07 are empty. I don't like that. Some planners let you fill the specific dates…

记一下

脸书店面: decode string LC 394. 印度人. 我紧张. 模糊的想到可以用stack,但是没有好好想好思路就开始写,没写通.写到一半换DFS(大忌). 面试官问, 你为什么觉得用DFS比用stack好呢...没get到这个hint, 继续跟DFS嗑. 还问能不能在纸上画...最后没时间了依旧没写出来,说了一下还是应该用stack做, 面试官说stack是对的.囧. 电话挂了之后5分钟写出来了.嚎啕大哭=.= 优步店面: 给你两个list of intervals, find there AND list. interval的定义是a tuple with a left and right border, like [2,5] A list of intervals is non intersected set of sorted intervals. e.g. [0, 0], [2, 2], [5, 10] is a valid set of…

线段树???

Number of Longest Increasing Subsequence

System Longest File Path

如何标记level? 用原本的\t\t\t?不.应该用数字来标记. 怎么算level数? \t的个数. '\t'和'\n'是1个字符,不是2个. 怎么读入String? 指针从左到右遍历读吗?太麻烦. 用str.split()把它分成String array,按顺序读入即可 注意计算length要每个层+1 ('/'),最后一层不用. 思路1: 一个Stack放层数:1,2,3 一个ArrayList:对应的index表明该level的当前的StringLength 读入一个String, replace \t 得到一个新的string,把它与旧string相减即得当前string的level. 与stack peek的level相比,如果stack peek>=当前level, pop. push当前level到stack,更新arraylist在index=level时候的值. 如果当前string是一个文件,则计算arraylist中从0到index的sum. 更新max. 优化:stack的size其实就表明了目前遍历的level.所以stack里面可以直接放当前level的maxLength. Java : str.split("str") - 把原Str分割生成一个String[] str.replaceAll("Regex", "newStr") str.replace(char oldc, char newc) public int lengthLongestPath(String input) { if (input == null || input.length() == 0) return 0; String[] strs =…

Read Characters From File – multiple calls

The API: int read4(char *buf) reads 4characters at a time from a file. The return value is the actual number of characters read. For example, it returns 3 if there is only 3 characters left in the file. By using the read4 API, implement the function int read(char *buf, int n) that reads n characters from the file.  Notice The read function…