eBay Coding Interview Questions

Reported as an interview question at eBay, this grid-based pathfinding challenge adapts the movement rules of a traditional Chinese chess piece. You are tasked with determining whether a horse can successfully navigate to a target location on a restricted board while avoiding obstacles and accounting for blocked pivoting legs that restrict L-shaped jumps. The puzzle evaluates your graph traversal skills and spatial reasoning under custom movement constraints. Unlock the comprehensive problem statement and verified model solution with a subscription.

Reported as an interview question at eBay, this design challenge requires you to build a robust data structure that tracks and validates compressed word representations. You must efficiently handle a dictionary of terms and determine whether a query term's contracted form is entirely unique or ambiguous based on predefined rules. This scenario tests your proficiency in object-oriented design, hash map usage, and collision management. Gain access to the complete class design, edge case handling, and professional solutions with a paid subscription.

Reported as an eBay coding interview challenge, this problem focuses on scheduling efficiency and resource allocation by determining peak overlapping intervals. Candidates must design an optimal strategy to calculate the maximum capacity needed simultaneously across a collection of time spans. Unlock the comprehensive problem breakdown and verified code solution with a subscription.

Master pattern matching and string analysis by learning how to verify standard domestic phone number formats using a single regular expression. Reported as an interview question at eBay, this challenge evaluates your ability to handle various punctuation layouts and digit constraints concisely. Unlock the complete problem statement and a verified model solution by subscribing today.

This systems-focused programming challenge, noted from software engineering interviews at eBay, requires candidates to implement a custom memory block allocator backed by a bitmap data structure. Developers must support dynamic state management where individual bits represent the availability of sequential memory segments. Key operations include scanning the structure for contiguous free runs of specific lengths and executing allocations while maintaining state integrity. The full problem details, operational guidelines, and production-ready reference solution are restricted to our paid subscribers.

This foundational coding problem frequently appears in technical assessments and asks you to locate a pair of elements within an integer collection that add up to a specific sum. It evaluates your ability to optimize search times and utilize hash-based data structures efficiently. Reported as an interview question at eBay, this exercise tests core algorithmic thinking and array manipulation skills. Access to the complete problem description and an optimized model solution requires a subscription.

This eBay simulation question tests grid flood fill, simultaneous group removal and column gravity, repeated until the board is stable. Pinning down ambiguous rules before coding, such as the group threshold and the empty-cell marker, is part of what is evaluated.

Featured as a technical interview question at eBay, this problem evaluates your ability to model and solve prerequisite dependency graphs. Given a set of courses and their required ordering constraints, you must determine whether it is possible to complete all subjects without hitting a circular dependency, and if so, generate a valid sequential schedule. This is a classic application of topological sorting techniques in directed graphs. The full problem statement, edge cases, and optimized solution require a subscription.

In this technical interview problem reported at eBay, candidates must analyze a binary tree structure to identify specific subtrees that satisfy dual structural and numerical conditions. The task tests your proficiency with recursive tree traversals, height balancing checks, and conditional value aggregation across nodes. You will need to carefully track subtree dimensions and parity constraints simultaneously to arrive at the correct count. The full problem and model solution require a subscription.

This reported interview question from eBay focuses on designing an ad placement mechanism that maps promotional content to various page slots for a specific user while adhering to strict per-item frequency caps. The task requires tracking historical impressions and ensuring that individual limits are never exceeded during the allocation process. It tests your ability to manage state and implement clean, rule-based filtering logic in a practical web context. Unlock the complete challenge details and verified code solution with a subscription.

This eBay coding challenge asks you to implement a string matching algorithm. You are given a collection of words and a pattern that includes special characters: one for any single character and another for one or more arbitrary characters. The task is to identify all words from the provided list that completely conform to the given pattern. This problem assesses your ability to handle complex string comparisons and wildcard logic efficiently. The full problem description and a model solution are available with a subscription.

This beginner-friendly programming challenge, featured in technical rounds at eBay, requires candidates to analyze a collection of characters and compute the numerical discrepancy between upper and lower case alphabets. It serves as a practical exercise for testing string manipulation capabilities and fundamental built-in inspection utilities within your chosen programming language. You will need to write clean logic that iterates through the collection, tallies the respective character cases, and evaluates the final mathematical difference. Unlock the full problem statement, test suites, and optimal solution by upgrading to a paid subscription.

This eBay interview question asks you to analyze user browsing session data to find the most frequently co-occurring products alongside a specific target item. The puzzle evaluates your data aggregation and frequency counting skills, requiring careful session-level deduplication to identify top recommendations based on user navigation patterns. To review the comprehensive problem description, edge-case handling strategies, and fully tested model solution, a subscription is necessary.

This eBay interview coding puzzle challenges you to find the longest contiguous subarray of even length where the sum of the first half precisely equals the sum of the second half. The problem evaluates your prefix sum techniques, array manipulation, and optimization skills to achieve better than quadratic time complexity. Unlock the complete problem statement and optimized model solution with a subscription.