9 Wayfair Software Engineer Intern Interview Questions (2026)

Outline

Pick ONE you know deeply. Cover problem → design → implementation → results → reflections. Wayfair interviewers ask follow-ups; have a project where you can defend every layer. Don't pick something a teammate built and you only contributed to lightly.

Outline

Reference e-commerce, the recommendations problem, the Boston tech ecosystem, or the logistics challenge. Mention if you've used Wayfair as a customer. Generic 'I want a tech internship' answers fail.

Outline

STAR. Pick a real moment — stuck on a bug, didn't know a framework concept, needed clarity on requirements. Show how you tried first before asking (so you weren't a help-vampire), how you framed your question, and what you learned. Interns who never ask for help and interns who ask too quickly both lose.

Outline

Single pass with a counter. O(N) time, O(1) space. Extension if list is pre-sorted: binary search for the threshold, return the index. O(log N). Walk through which fits the use case (sorted catalogs vs unsorted streams).

Outline

Reverse the digits and compare. Or reverse only half (build the reversed second half digit by digit, stop when reversed >= remaining first half). O(log N) time, O(1) space. Edge cases: negative numbers (typically not palindromes), trailing zeros.

Outline

BFS with a queue. For each level, count the queue size, dequeue that many, append to a level list, enqueue children. Output is list of lists. O(N) time, O(W) space.

Outline

Hash map of element → count, track max as you go. O(N) time, O(K) space where K is distinct elements. Extension: Boyer-Moore majority vote for the case where one element appears more than N/2 times (O(1) space). Walk through tradeoff.

Outline

Hash map of item_id → quantity. Methods: add(item, n), remove(item, n) (decrement, delete if 0), total(prices) (sum quantity * price across all items). Discuss the edge cases (out-of-stock, removed item still in old cart, currency precision).

Outline

Single pass. Track min-so-far. For each price, max_profit = max(max_profit, price - min_so_far). O(N) time, O(1) space. Edge cases: prices only go down (profit is 0), single price.