For those who are in doubt and disappointed

"Choose one activity in your career that can advance your career significantly"

When I hear this sentence 4 years ago, I reminded myself that I wanted to conquer the computer algorithm so that I can do better at the interviews.

3 years passed doing nothing and making excuses like

"I am so busy in my current job."
"I have family to take care of"
"I am so tired after work."

All of sudden, I woke up and look at myself. I hated my job. I was tired of being underpaid and under estimated by stupid boss and colleagues. I really want to change jobs but there were not many options in my country.

So, I decided to do the one thing I knew will change my career. I started studying the computer algorithm. I also started this blog to collect the interview questions and keep my answers to the questions.

It wasn't easy to make the regular commitment. Watching online algorithm courses and collecting the interview questions and solving them. However, I did not want to give up this time.

That efforts paid off. I now get the better job at one of the best tech firms in U.S.

If you stumbled upon my blog, you must be in doubt and disappointment or even in fear about your career or job prospect.

I would like to advise that don't give up until you succeed. Someone said, "Winner never quit and quitter never win".

It is up to you  and you do have the power to change your life.
The questions I practice in my blogs prepared me for the interview. I believe they can help you as well.

Try to solve it as much as you can. It may takes longer than a day or week in the beginning. You might be rusty in the computer algorithm as me or did not learn this subject in the college.

It does not matter. Do it anyway and you will see the result if you don't give up.

Some of questions I uploaded are from my own interviews, which I failed or succeeded.
I also collect the questions from the interview questions sharing websites. I only collect the questions not the answers uploaded by people.

I practiced personally and add my own analysis to the answers. If you see any mistakes, please point them out so others can learn from your insight.

I will also upload the questions that I will use in the interview in my current company from now on.

Don't give up and have a faith then you will succeed.

Sincerely,

LazyLearner

Comments

Post a Comment

Popular posts from this blog

Planting flowers with no adjacent flower plots

Image
Problem Suppose you have a long flowerbed in which some of the plots are planted and some are not. However, flowers cannot be planted in adjacent plots - they would compete for water and both would die. Given a flowerbed (represented as an array containing booleans), return if a given number of new flowers can be planted in it without violating the no-adjacent-flowers rule  Sample inputs  Input: 1,0,0,0,0,0,1,0,0  3 => true  4 => false  Input: 1,0,0,1,0,0,1,0,0  1 => true  2 => false  input: 0  1 => true  2 => false  public boolean canPlaceFlowers(List flowerbed, int numberToPlace) {  // Implementation here  }
Read more
  Given an array of  intervals  where  intervals[i] = [start i , end i ] , merge all overlapping intervals, and return  an array of the non-overlapping intervals that cover all the intervals in the input . Example 1: Input: intervals = [[1,3],[2,6],[8,10],[15,18]] Output: [[1,6],[8,10],[15,18]] Explanation: Since intervals [1,3] and [2,6] overlap, merge them into [1,6]. Example 2: Input: intervals = [[1,4],[4,5]] Output: [[1,5]] Explanation: Intervals [1,4] and [4,5] are considered overlapping.   Constraints: 1 <= intervals.length <= 10 4 intervals[i].length == 2 0 <= start i <= end i <= 10 4
Read more

Find the maximum number of bomb that can be detonated

  Problem You are given a list of bombs. The range of a bomb is defined as the area where its effect can be felt. This area is in the shape of a circle with the center as the location of the bomb. The bombs are represented by a 0-indexed 2D integer array bombs where bombs[i] = [xi, yi, ri]. xi and yi denote the X-coordinate and Y-coordinate of the location of the ith bomb, whereas ri denotes the radius of its range. You may choose to detonate a single bomb. When a bomb is detonated, it will detonate all bombs that lie in its range.  These bombs will further detonate the bombs that lie in their ranges. Given the list of bombs, return the maximum number of bombs that can be detonated if you are allowed to detonate only one bomb. Input: bombs = [[2,1,3],[6,1,4]] Output: 2 Explanation: The above figure shows the positions and ranges of the 2 bombs. If we detonate the left bomb, the right bomb will not be affected. But if we detonate the right bomb, both bombs will be detonated. So...
Read more