summer-office-student-work

Chapter 4: Experienced Engineers, New Grads, and Interns – The Complete Guide to Google Interview Preparation

This is the fourth chapter of our The Complete Guide to Google Interview Preparation series.

Our readers have completely different backgrounds. Some have been in the industry for a while, some are international students and some are looking for Google internship.

The preparation process may differ a lot depending on your background and target. That’s why in this chapter, I’d like to provide more specific tips for each type of interviewees.

Basically, I put interviewees into three categories: experienced engineers, new grads, and interns. If you are looking for a management position, this post is not for you. Also, if you haven’t read previous chapters, I highly recommend you take a look at them.
(more…)

Share on FacebookTweet about this on TwitterShare on LinkedInShare on Reddit

Read More

StockSnap_7ULJ7GRFDB small

Chapter 3: Practice Coding Questions – The Complete Guide to Google Interview Preparation

This is the third chapter for our The Complete Guide to Google Interview Preparation series. When it comes to Google interview preparation, most people will think about practicing as many coding questions as possible.

It’s partially right because you certainly need to practice. However, very few people did it correctly. With the right approach, you can definitely practice smartly and get improved in less time.

In this chapter, I’ll explain in detail how to practice coding questions with practical tips as before. More specifically, you’ll know more about the following questions:

  • Why we need to practice coding questions
  • When to practice coding questions
  • How to practice smartly (the post is mainly focused on this)
  • Recommended resources

(more…)

Share on FacebookTweet about this on TwitterShare on LinkedInShare on Reddit

Read More

875671ac11fbbc2548e3b8d64475de24

Chapter 2: Build a Solid Foundation – The Complete Guide to Google Interview Preparation

This is the second chapter for our The Complete Guide to Google Interview Preparation series. If you pay attention to a lot of job requirements, you usually see things like “have a solid computer science foundation”. What does that actually mean?

Apparently, it doesn’t mean you have a computer science degree, nor does it mean you have written a lot of code. in reality, a solid computer science foundation means having a clear understanding of basic knowledge.

In this chapter, I’d like to delve into this topic and give you practical tips on how to build a solid foundation. I would say this is the entry point to Google interview preparation, but at the same time, it’s the most important step.

(more…)

Share on FacebookTweet about this on TwitterShare on LinkedInShare on Reddit

Read More

StockSnap_MJZPCHLERD

Chapter 1: Get an Interview with Google – The Complete Guide to Google Interview Preparation

Google receives over 1 million resumes a year and only a few people got the chance to take an interview. In other words, most people didn’t fail Google interviews but failed to get an interview.

When talking about Google interview preparation, most people will focus on coding questions and try to practice every single question on Leetcode. However, more than 90% of them didn’t get a chance to test it.

Even if you are not fully prepared, taking the interview means you still have a chance. In this chapter, I’d like to give a lot of practical suggestions on how to get an interview with Google. Most techniques also work for other companies.

(more…)

Share on FacebookTweet about this on TwitterShare on LinkedInShare on Reddit

Read More

highway-at-night-picjumbo-com small

Uber Interview Questions – Longest Increasing Subarray

This week, I’m going to talk about the longest increasing subarray problem. You can find more posts like this at Uber Interview Questions.

Also, this question is similar to Subarray With Given Sum. If you have read our previous post, I hope you can solve this problem easily.

In this post, I’m going to cover topics like “sliding window”, dynamic programming, time/space complexity and so on.

(more…)

Share on FacebookTweet about this on TwitterShare on LinkedInShare on Reddit

Read More

Screenshot 2017-01-19 11.36.44

Uber Interview Questions – Arrange Given Numbers To Form The Biggest Number Possible

This week, I’m going to discuss the question – arrange given numbers to form the biggest number possible. Like our previous posts about Uber interview questions, I’m focusing more about the analysis process than the final solution.

The idea is not to give our readers the answer/code immediately. Instead, I’d like to guide you through the whole analysis process. At the end, I hope you can be equipped everything you need to solve similar questions.

Here we go.
(more…)

Share on FacebookTweet about this on TwitterShare on LinkedInShare on Reddit

Read More

Screen Shot 2017-01-12 at 8.38.31 AM

Uber Interview Questions – Search an Element in a Sorted and Rotated Array

In this post, we will talk about rotated array binary search problem. Three major things are discussed: First of all, instead of providing the solution, we’ll cover how to analyze the question and how to come up with the right idea. Second, it’s not easy to write the bug-free solution for this problem and we’ll talk about some tips and hacks. Last, like our other posts, common techniques are summarized at the end of the post so that you can use similar tools to solve other coding interview questions.

(more…)

Share on FacebookTweet about this on TwitterShare on LinkedInShare on Reddit

Read More

old-letters-436501_640

Uber Interview Questions – Permutations of Parentheses

We’ve received a lot of feedback from our previous posts. Some readers pointed out bugs in the code and hopefully we’ve fixed all of them. Also, a lot of people are asking for more posts about dynamic programming/recursion. That’s why this week we’d like to talk about the question – permutations of parentheses.

Many people are afraid of this topic because it can be hard to come up with the solution if you haven’t practiced enough. On the flip side, the good news is that just because this topic is relatively difficult, the question cannot be too hard in a coding interview (otherwise, no one could solve it).

This week, we’ll continue to discuss this topic with a Uber interview question, but the analysis/solution is slightly different.

(more…)

Share on FacebookTweet about this on TwitterShare on LinkedInShare on Reddit

Read More

letters-801755_640

Uber Interview Questions – Maximum Sum of Non-adjacent Elements

As you may know, one of our blog’s current focuses is on Uber interview questions. Their questions are usually representative and you can expect exactly the same kind of questions from other top companies like Google, Facebook, Airbnb, etc.. In addition, we only cover questions that were asked recently. This week, the question is maximum sum of non-adjacent elements. It’s of medium difficulty, you may expect to have it as the second question in an on-site interview. We are going to cover topics including array, recursion/dynamic programming, algorithm efficiency and so on so forth.

(more…)

Share on FacebookTweet about this on TwitterShare on LinkedInShare on Reddit

Read More