eBay Coding Interview Questions
We track 58 coding questions asked at eBay, tagged with the algorithms and concepts they test. The most common: Array, String, Hash Table, Sorting, Dynamic Programming.
Browse all 58 eBay questions →Concept mix
Each question's weight is split evenly across its concepts, so the shares sum to 100%.
- Array18.5%
- String9.0%
- Hash Table6.7%
- Sorting5.9%
- Dynamic Programming5.9%
- Two Pointers4.5%
- Matrix4.1%
- Depth-First Search3.6%
- Breadth-First Search3.5%
- Greedy2.8%
- Other (35)35.6%
How many questions involve each concept
Share of all 58 tracked eBay questions that touch each concept. Questions usually involve several, so these overlap.
- Array56.9%
- String29.3%
- Hash Table24.1%
- Sorting24.1%
- Dynamic Programming17.2%
- Depth-First Search15.5%
- Two Pointers15.5%
- Heap (Priority Queue)13.8%
- Matrix13.8%
- Breadth-First Search12.1%
- Greedy10.3%
- Design8.6%
Where eBay differs from the average company
Concept weight at eBay relative to the average across all companies we track. Green means eBay leans on it harder than most.
- Merge Sort7.0×
- Quickselect6.0×
- Bucket Sort4.0×
- String Matching4.0×
- Sliding Window0.60×
- Binary Search0.53×
- Tree0.53×
- Math0.48×
eBay specialties
Concepts that show up at eBay but are rarely asked elsewhere. They are easy to get blindsided by.
Difficulty mix
Level split of the 58 tracked eBay questions.
- Junior17% (10)
- Mid/Senior67% (39)
- Staff16% (9)
Every concept in eBay interviews
| Concept | Questions | % of questions | Share of mix |
|---|---|---|---|
| Array | 33 | 56.9% | 18.5% |
| String | 17 | 29.3% | 9.0% |
| Hash Table | 14 | 24.1% | 6.7% |
| Sorting | 14 | 24.1% | 5.9% |
| Dynamic Programming | 10 | 17.2% | 5.9% |
| Depth-First Search | 9 | 15.5% | 3.6% |
| Two Pointers | 9 | 15.5% | 4.5% |
| Heap (Priority Queue) | 8 | 13.8% | 2.5% |
| Matrix | 8 | 13.8% | 4.1% |
| Breadth-First Search | 7 | 12.1% | 3.5% |
| Greedy | 6 | 10.3% | 2.8% |
| Design | 5 | 8.6% | 2.7% |
| Stack | 5 | 8.6% | 2.8% |
| Backtracking | 4 | 6.9% | 1.8% |
| Divide and Conquer | 4 | 6.9% | 1.3% |
| Linked List | 4 | 6.9% | 2.2% |
| Binary Search | 3 | 5.2% | 1.6% |
| Counting | 3 | 5.2% | 0.7% |
| Graph Theory | 3 | 5.2% | 1.1% |
| Recursion | 3 | 5.2% | 1.9% |
| Binary Tree | 2 | 3.4% | 0.8% |
| Bit Manipulation | 2 | 3.4% | 2.1% |
| Bucket Sort | 2 | 3.4% | 0.4% |
| Math | 2 | 3.4% | 2.7% |
| Merge Sort | 2 | 3.4% | 0.7% |
| Ordered Set | 2 | 3.4% | 0.6% |
| Quickselect | 2 | 3.4% | 0.6% |
| Sliding Window | 2 | 3.4% | 0.9% |
| String Matching | 2 | 3.4% | 1.2% |
| Tree | 2 | 3.4% | 0.8% |
| Trie | 2 | 3.4% | 0.5% |
| Binary Indexed Tree | 1 | 1.7% | 0.3% |
| Bitmask | 1 | 1.7% | 0.4% |
| Data Stream | 1 | 1.7% | 0.4% |
| Doubly-Linked List | 1 | 1.7% | 0.4% |
| Eulerian Circuit | 1 | 1.7% | 0.3% |
| Hash Function | 1 | 1.7% | 0.4% |
| Monotonic Queue | 1 | 1.7% | 0.3% |
| Monotonic Stack | 1 | 1.7% | 0.3% |
| Prefix Sum | 1 | 1.7% | 0.9% |
| Queue | 1 | 1.7% | 0.3% |
| Segment Tree | 1 | 1.7% | 0.3% |
| Simulation | 1 | 1.7% | 0.6% |
| Topological Sort | 1 | 1.7% | 0.4% |
| Union-Find | 1 | 1.7% | 0.4% |
Practice a eBay interview
Take a realistic AI-led mock interview with questions eBay actually asks, with live voice and real feedback.
Start a mock interviewYour first interview is free · no credit card required