Whatnot Coding Interview Questions

Build a responsive browser-based memory matching minigame using React, a front-end engineering challenge reported during Whatnot interview loops. This exercise evaluates your component state management, asynchronous event handling, click debouncing, and UI synchronization under strict interaction constraints. To access the complete functional specifications, test cases, and clean reference implementation, a paid subscription is required.

Pick the smallest set of shops that between them stock every item on a list, given thousands of shops and a list of at most sixteen items. Asked at Whatnot, the size limits are the hint: the item list fits in a machine word, which turns coverage into a search over bitmasks rather than an intractable set-cover. You will compress each shop to a mask, search over reachable coverage states, and report the impossible case honestly. The full problem and the model solution require a subscription.

This Whatnot interview question challenges you to repeatedly eliminate adjacent matching characters from a text string until no further reductions are possible. The core task involves efficiently processing character sequences to handle cascading deletions without incurring high time complexity. It evaluates your mastery of linear data structures, specifically utilizing stacks for string manipulation. Unlock the full problem details and the optimal model solution by acquiring a subscription.

Analyzing user behavior patterns through hierarchical data structures is a key competency tested in interviews at companies like Whatnot. This problem involves processing chronological activity logs to reconstruct individual user navigation paths and aggregating those journeys into an efficient prefix tree. You will be evaluated on your ability to combine sorting, grouping, and trie traversal algorithms to generate structured categorical outputs. Unlock the complete problem statement and step-by-step model implementation by subscribing today.

Highlighted in recruitment assessments at Whatnot, this exercise focuses on string processing and efficient pattern matching within user communications. Your objective is to examine incoming text streams and filter out any entries containing forbidden multi-word expressions as contiguous word sequences. Solving this efficiently demands advanced data structures like tries combined with careful text tokenization. Unlock the complete problem guide and expert-crafted solution by subscribing today.

Analyzing sequential event logs to understand user behavior patterns is a common task in modern product engineering. Featured in technical rounds at Whatnot, this coding problem asks you to process user activity logs, chronologically sort individual event histories, and aggregate these trajectories into a specialized prefix tree structure. The challenge evaluates your data structure design skills, particularly in maintaining distinct user counts across hierarchical action nodes. Discover the full problem description, edge-case analysis, and fully tested reference implementation with an active subscription.

Mastering array manipulation techniques is vital for technical interviews, as demonstrated by this common sorting challenge frequently asked at Whatnot. The task evaluates your ability to combine two ordered collections efficiently within restricted memory constraints and without utilizing extra data structures. You will discover optimal in-place pointer manipulation strategies to achieve linear time complexity while maintaining proper sequence order. The full problem breakdown, algorithmic complexity analysis, and clean model solution are available exclusively with a subscription.

This text moderation challenge, reported from recruitment loops at Whatnot, tests string manipulation and pattern-matching capabilities. You are tasked with analyzing a stream of user submissions to filter out communications containing prohibited terms or phrases under specific formatting constraints. The exercise examines your ability to handle case-insensitive comparisons and token boundaries effectively without altering unintended parts of the input. Discover the full problem statement and explore a thoroughly tested model solution with a paid subscription.

Work out which vehicle each waiting rider boards, given fixed routes with known departure times and a travel-time map. This Whatnot question is a simulation with a precise selection rule: the earliest arrival at or after the rider is ready, and only if the rider's destination is still ahead on that route. You will derive arrival times along each route, filter candidates by remaining stops, and apply the stated tie-break. Subscribers get the complete problem and the reference solution.

Decide whether a chosen set of park trails admits a single unbroken walk that covers each of them exactly once. This Whatnot question is the Eulerian-path condition applied to a filtered graph: only trails with both ends selected count, which changes the degrees you must examine. You will check connectivity over the edges that remain, count odd-degree attractions, and allow repeated visits to the same attraction. The full problem and the reference solution require a subscription.

This practical text-filtering puzzle, frequently asked in Whatnot technical interviews, challenges you to sanitize a collection of user-generated messages by removing any text containing forbidden vocabulary. The task requires careful handling of punctuation delimiters and whitespace splitting to ensure accurate word boundary matching across various message formats. It effectively examines your data cleaning techniques and string manipulation efficiency in real-world scenarios. Unlock the comprehensive problem description and verified solution with a subscription.

Process sequential telemetry records in this data aggregation challenge frequently featured in Whatnot technical rounds. You are tasked with reconstructing chronological user pathways from raw logs and subsequently organizing those trajectories into a prefix tree to compute path frequency statistics at scale. This problem tests your ability to combine sorting operations with efficient tree-based data structures for analytics. Access the complete problem description and optimal reference solution with a subscription.