Whatnot Software Engineer Interview Questions

Each question gives you 30 seconds to prepare and one opportunity to record a video, with a maximum length of 1 minute. According to Reddit, this seems to be automatically posted? It's so frustrating;

Newbie asking for points 🥹 Hirevue 15min 6 questions 1. Why this company? 2. Have you used their products? Any suggestions? 3. Internship, what was your favorite part? 4. How to learn programming lang

I interviewed for a senior fullstck position in Seattle Recruiter Screen: Typical stuff. Make sure you have a good answer for "why do you want to work here" Coding Round: Part 1) write a function to d

Received a Whatnot 26ng video interview. It seems everyone who applied received one. There were 6 questions in total. Prepare 30 seconds for each question and record 1 minute. Why Whatnot? If you use

Five days after the one-way video, I received an email with the Karat interview schedule, which consisted of approximately 15 minutes for my resume, 40 minutes for coding, and 5 minutes for follow-up

I applied on October 7th and received a video interview invitation on October 9th. The platform was Hireflix. There were 6 questions in total, with 15 minutes allotted. Each question had 30 seconds of

TLDR: First time being asked about my current company's performance by a Chinese recruiter First time experiencing an HR call via Zoom with my webcam on The Chinese recruiter greeted me warmly, asked

LeetCode #680: Valid Palindrome II. Difficulty: Easy. Topics: Two Pointers, String, Greedy. Asked at Whatnot in the last 6 months.

LeetCode #1047: Remove All Adjacent Duplicates In String. Difficulty: Easy. Topics: String, Stack. Asked at Whatnot in the last 6 months.

LeetCode #935: Knight Dialer. Difficulty: Medium. Topics: Dynamic Programming. Asked at Whatnot in the last 6 months.

LeetCode #977: Squares of a Sorted Array. Difficulty: Easy. Topics: Array, Two Pointers, Sorting. Asked at Whatnot in the last 6 months.

LeetCode #200: Number of Islands. Difficulty: Medium. Topics: Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix. Asked at Whatnot in the last 6 months.

## Problem Determine whether a string can become a palindrome by removing at most one character. ## Likely LeetCode equivalent Directly matches Valid Palindrome II (LC 680). ## Tags strings, two_pointers, whatnot

## Problem Given n versions where the first bad version causes all subsequent ones to be bad, find the first bad version using binary search. ## Likely LeetCode equivalent Directly matches First Bad Version (LC 278). ## Tags binary_search, whatnot

## Problem Group a list of strings into anagram clusters, where each cluster contains strings that are anagrams of each other. ## Likely LeetCode equivalent Directly matches Group Anagrams (LC 49). ## Tags hash_table, strings, sorting, whatnot

## Problem Find the K points closest to the origin from a list of 2D coordinates using Euclidean distance. ## Likely LeetCode equivalent Directly matches K Closest Points to Origin (LC 973). ## Tags heap, math, sorting, whatnot

## Problem Search for a target value in a 2D matrix with sorted rows and columns using an efficient traversal. ## Likely LeetCode equivalent Similar to Search a 2D Matrix II (LC 240). ## Tags matrix, binary_search, whatnot

## Problem Find the minimum length substring of a source string that contains all characters of a target string. ## Likely LeetCode equivalent Directly matches Minimum Window Substring (LC 76). ## Tags sliding_window, strings, hash_table, whatnot

## Problem Rate-limit notification delivery, ensuring no more than N notifications are sent within a sliding time window. ## Likely LeetCode equivalent Similar to Design Hit Counter (LC 362) or sliding window rate limiter. ## Tags sliding_window, queue, whatnot, rate_limit

## Problem Count the number of islands (connected groups of 1s) in a 2D binary grid using DFS or BFS. ## Likely LeetCode equivalent Directly matches Number of Islands (LC 200). ## Tags graph, matrix, bfs, dfs, whatnot