Question 1

Partition Equal Subset Sum — eBay Interview Question

Accepted Answer

"Partition Equal Subset Sum" is a medium difficulty problem asked at eBay interviews. It covers the following topics: Array, Dynamic Programming. You can practice it on LeetCode: https://leetcode.com/problems/partition-equal-subset-sum

Question 2

LRU Cache — eBay Interview Question

Accepted Answer

"LRU Cache" is a medium difficulty problem asked at eBay interviews. It covers the following topics: Hash Table, Linked List, Design, Doubly-Linked List. You can practice it on LeetCode: https://leetcode.com/problems/lru-cache

Question 3

Remove One Element to Make the Array Strictly Increasing — eBay Interview Question

Accepted Answer

"Remove One Element to Make the Array Strictly Increasing" is a easy difficulty problem asked at eBay interviews. It covers the following topics: Array. You can practice it on LeetCode: https://leetcode.com/problems/remove-one-element-to-make-the-array-strictly-increasing

Question 4

Subtree of Another Tree — eBay Interview Question

Accepted Answer

"Subtree of Another Tree" is a easy difficulty problem asked at eBay interviews. It covers the following topics: Tree, Depth-First Search, String Matching, Binary Tree, Hash Function. You can practice it on LeetCode: https://leetcode.com/problems/subtree-of-another-tree

Question 5

Alternating Digit Sum — eBay Interview Question

Accepted Answer

"Alternating Digit Sum" is a easy difficulty problem asked at eBay interviews. It covers the following topics: Math. You can practice it on LeetCode: https://leetcode.com/problems/alternating-digit-sum

Question 6

Minimum Window Subsequence — eBay Interview Question

Accepted Answer

"Minimum Window Subsequence" is a hard difficulty problem asked at eBay interviews. It covers the following topics: String, Dynamic Programming, Sliding Window. You can practice it on LeetCode: https://leetcode.com/problems/minimum-window-subsequence

#	Question Title	Difficulty	Frequency	Topics
1	Partition Equal Subset Sum	MEDIUM	100.0	ArrayDynamic Programming
2	LRU Cache	MEDIUM	97.7	Hash TableLinked ListDesign+1
3	Remove One Element to Make the Array Strictly Increasing	EASY	95.1	Array
4	Subtree of Another Tree	EASY	95.1	TreeDepth-First SearchString Matching+2
5	Alternating Digit Sum	EASY	95.1	Math
6	Minimum Window Subsequence	HARD	95.1	StringDynamic ProgrammingSliding Window
7	Binary Gap	EASY	95.1	Bit Manipulation
8	Design Skiplist	HARD	95.1	Linked ListDesign
9	Minimize Maximum Pair Sum in Array	MEDIUM	95.1	ArrayTwo PointersGreedy+1
10	Number of Islands	MEDIUM	89.2	ArrayDepth-First SearchBreadth-First Search+2

Explore 450+ Companies

Companies

eBay

Want to see more?

eBay Interview Questions

Ai Assistant Kas

Explore 450+ Companies

Companies

AA CompaniesBrowse companies

BB CompaniesBrowse companies

CC CompaniesBrowse companies

DD CompaniesBrowse companies

EE CompaniesBrowse companies

FF CompaniesBrowse companies

GG CompaniesBrowse companies

HH CompaniesBrowse companies

II CompaniesBrowse companies

JJ CompaniesBrowse companies

KK CompaniesBrowse companies

LL CompaniesBrowse companies

MM CompaniesBrowse companies

NN CompaniesBrowse companies

OO CompaniesBrowse companies

PP CompaniesBrowse companies

QQ CompaniesBrowse companies

RR CompaniesBrowse companies

SS CompaniesBrowse companies

TT CompaniesBrowse companies

UU CompaniesBrowse companies

VV CompaniesBrowse companies

WW CompaniesBrowse companies

XX CompaniesBrowse companies

YY CompaniesBrowse companies

ZZ CompaniesBrowse companies

eBay

Want to see more?

eBay Interview Questions

Ai Assistant Kas