Google Interview Guide

Showing 3 questions

Ranking

A question's ranking corresponds to how commonly it's asked by Google. The higher the ranking, the more likely you'll encounter it in a Google interview.

Question

Frequency

Difficulty

Two Sum

Find two numbers in a given array that add up to a specific target value, and return their indices. Essentially, you need to efficiently locate the pair that satisfies the sum requirement.

ArraysTwo Pointers

Very likely

If you have a Google interview, it's very likely that you will get this question

Easy

#1. Two Sum

Easy

Find two numbers in a given array that add up to a specific target value, and return their indices. Essentially, you need to efficiently locate the pair that satisfies the sum requirement.

ArraysTwo Pointers

This question is very likely to be asked in your Google interview

Redundant Connection II

A list of directed connections forms a tree structure, but one extra connection has been added. This results in an error, like a node with two parents or a cycle. Find the single connection that can be removed to restore the tree.

TreesGraphsRecursion

Very likely

If you have a Google interview, it's very likely that you will get this question

Hard

#2. Redundant Connection II

Hard

TreesGraphsRecursion

This question is very likely to be asked in your Google interview

Palindrome Number

Determine whether an integer is a palindrome. That is, it reads the same forwards and backward.

Bit Manipulation

Very likely