YoungForest's blog

Today I participated in LeetCode weekly contest 117 and used a different strategy: writing the blog summary while solving the problems. I hoped this would record my real thoughts more faithfully and improve my blogging efficiency. The previous two times, writing the blog afterward always delayed thi

It is time for the weekend LeetCode weekly contest again. This time the result was not good. The main reason was that I wanted to solve both the second and third problems, and ended up solving neither. If I had focused all my time on the second problem, I probably could still have ACed it. 961. N-R

I have not participated in LeetCode weekly contests for a while. Recently, because I am preparing for Google’s phone interview at the end of January, I need to pick algorithms back up again. Reviewing algorithm books is one part; the other part is preparing by solving problems. Since time is limited

Merry Christmas! There are still five days before 2019, and 2018 is about to end. A year passes so quickly. I wonder how your 2018 was. How many of the New Year’s plans you made a year ago did you accomplish? In my 2017 New Year’s plan, I once wrote this passage: I recently read Cai Dongfan’s His

Last week I sent my resume to a classmate interning at SenseTime and scheduled an interview with HR for this Thursday. On Friday I received another call from HR to discuss the offer. I have to say, SenseTime’s recruiting efficiency is really high. From another angle, this also reflects the fact that

Recently, because of English study needs, I often download large files from Baidu Cloud. As everyone knows, Baidu Cloud limits download speed. Without their membership, the download speed is only a few dozen KB/s. I really could not tolerate it, so I searched for speed-limit bypass tools and got the

Copyright belongs to the author. For any form of reposting, please contact the author. Author: YoungForest (from Douban) Source: https://www.douban.com/note/694767558/ Recently I have kept feeling that I cannot control my own life. First, which is more important: living happily, or working hard to

The key point of this problem is understanding “average O(1) time”, which is also an important concept in time-complexity analysis: “amortized”. In Algorithms, Fourth Edition, the analysis of many data-structure operations uses this method. So “amortized time complexity” is often associated with ope

I happened to encounter this classic problem during my interview at JingChi. It was asked by Eric in the second round. I had not done this problem before, but I had done the related 2Sum problem, after all it is the first LeetCode problem and probably many people have done it. Also, when Algorithms,

I have not practiced LeetCode for four weeks. On one hand, the sense of urgency decreased; on the other, I lacked execution. Recently I have another interview to prepare for: an algorithm intern interview for the video team at Xiaohongshu. On one side, I need to look at machine learning knowledge to