Verily Interview Guide

Showing 3 of 12 questions

Ranking

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

Question

Frequency

Difficulty

Happy Number

Determine if a number is a 'happy number'. A happy number eventually reaches 1 when replaced by the sum of the squares of its digits, repeating the process until it does.

RecursionTwo Pointers

Very likely

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

Easy

#1. Happy Number

Easy

Determine if a number is a 'happy number'. A happy number eventually reaches 1 when replaced by the sum of the squares of its digits, repeating the process until it does.

RecursionTwo Pointers

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

Jump Game

You are given an array where each element represents your maximum jump length at that position. Determine if you can reach the last index starting from the first index.

ArraysGreedy AlgorithmsDynamic Programming

Very likely

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

Medium

#2. Jump Game

Medium

You are given an array where each element represents your maximum jump length at that position. Determine if you can reach the last index starting from the first index.

ArraysGreedy AlgorithmsDynamic Programming

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

Longest String Chain

You are given a list of words. Find the longest possible chain of words where each word is formed by adding exactly one letter to its predecessor.

ArraysStringsDynamic Programming

Somewhat likely

If you have a Verily interview, you might get this question

Medium

#3. Longest String Chain

Medium

You are given a list of words. Find the longest possible chain of words where each word is formed by adding exactly one letter to its predecessor.

ArraysStringsDynamic Programming