Wayfair Interview Guide

Showing 3 of 21 questions

Ranking

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

Question

Frequency

Difficulty

Maximum Product Subarray

Find the contiguous subarray within a given array of numbers which has the largest product. The array can contain negative numbers, so you need to account for both maximum and minimum values.

ArraysDynamic Programming

Very likely

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

Medium

#1. Maximum Product Subarray

Medium

Find the contiguous subarray within a given array of numbers which has the largest product. The array can contain negative numbers, so you need to account for both maximum and minimum values.

ArraysDynamic Programming

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

Minimum Moves to Reach Target Score

You're given a starting score and a target score. Determine the minimum number of moves (either incrementing or doubling your score) to reach the target.

Greedy Algorithms

Very likely

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

Medium

#2. Minimum Moves to Reach Target Score

Medium

You're given a starting score and a target score. Determine the minimum number of moves (either incrementing or doubling your score) to reach the target.

Greedy Algorithms

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

Largest Magic Square

Find the largest magic square within a given matrix. A magic square has equal sums across rows, columns, and both diagonals.

Arrays

Very likely

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

Medium

#3. Largest Magic Square

Medium

Find the largest magic square within a given matrix. A magic square has equal sums across rows, columns, and both diagonals.

Arrays