eBay Interview Questions — 78 DSA Problems 73 problems with full solutions in Python, Java, C++, JavaScript, Go, Rust.
Most frequently asked eBay LeetCode questions for software engineering interviews.
Partition Equal Subset Sum (MEDIUM) — Array, Dynamic Programming LRU Cache (MEDIUM) — Hash Table, Linked List, Design, Doubly-Linked List Remove One Element to Make the Array Strictly Increasing (EASY) — Array Subtree of Another Tree (EASY) — Tree, Depth-First Search, String Matching, Binary Tree, Hash Function Alternating Digit Sum (EASY) — Math Minimum Window Subsequence (HARD) — String, Dynamic Programming, Sliding Window Binary Gap (EASY) — Bit Manipulation Design Skiplist (HARD) — Linked List, Design Minimize Maximum Pair Sum in Array (MEDIUM) — Array, Two Pointers, Greedy, Sorting Number of Islands (MEDIUM) — Array, Depth-First Search, Breadth-First Search, Union Find, Matrix Word Ladder (HARD) — Hash Table, String, Breadth-First Search Move Zeroes (EASY) — Array, Two Pointers Group Anagrams (MEDIUM) — Array, Hash Table, String, Sorting Spiral Matrix (MEDIUM) — Array, Matrix, Simulation Open the Lock (MEDIUM) — Array, Hash Table, String, Breadth-First Search Reconstruct Itinerary (HARD) — Depth-First Search, Graph, Eulerian Circuit Kth Largest Element in an Array (MEDIUM) — Array, Divide and Conquer, Sorting, Heap (Priority Queue), Quickselect Set Matrix Zeroes (MEDIUM) — Array, Hash Table, Matrix Word Search II (HARD) — Array, String, Backtracking, Trie, Matrix Course Schedule II (MEDIUM) — Depth-First Search, Breadth-First Search, Graph, Topological Sort Valid Parentheses (EASY) — String, Stack Course Schedule (MEDIUM) — Depth-First Search, Breadth-First Search, Graph, Topological Sort Meeting Rooms II (MEDIUM) — Array, Two Pointers, Greedy, Sorting, Heap (Priority Queue), Prefix Sum Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit (MEDIUM) — Array, Queue, Sliding Window, Heap (Priority Queue), Ordered Set, Monotonic Queue Binary Tree Zigzag Level Order Traversal (MEDIUM) — Tree, Breadth-First Search, Binary Tree Binary Search Tree to Greater Sum Tree (MEDIUM) — Tree, Depth-First Search, Binary Search Tree, Binary Tree Concatenated Words (HARD) — Array, String, Dynamic Programming, Depth-First Search, Trie Generate Parentheses (MEDIUM) — String, Dynamic Programming, Backtracking Rotting Oranges (MEDIUM) — Array, Breadth-First Search, Matrix Pow(x, n) (MEDIUM) — Math, Recursion Longest ZigZag Path in a Binary Tree (MEDIUM) — Dynamic Programming, Tree, Depth-First Search, Binary Tree Design a Stack With Increment Operation (MEDIUM) — Array, Stack, Design Longest Substring Without Repeating Characters (MEDIUM) — Hash Table, String, Sliding Window Two Sum (EASY) — Array, Hash Table Decode String (MEDIUM) — String, Stack, Recursion Search in Rotated Sorted Array (MEDIUM) — Array, Binary Search Best Time to Buy and Sell Stock II (MEDIUM) — Array, Dynamic Programming, Greedy Meeting Rooms (EASY) — Array, Sorting Integer to English Words (HARD) — Math, String, Recursion Valid Palindrome II (EASY) — Two Pointers, String, Greedy Longest Valid Parentheses (HARD) — String, Dynamic Programming, Stack Minimum Path Sum (MEDIUM) — Array, Dynamic Programming, Matrix Merge k Sorted Lists (HARD) — Linked List, Divide and Conquer, Heap (Priority Queue), Merge Sort Binary Tree Cameras (HARD) — Dynamic Programming, Tree, Depth-First Search, Binary Tree Product of Array Except Self (MEDIUM) — Array, Prefix Sum Roman to Integer (EASY) — Hash Table, Math, String Longest Common Prefix (EASY) — String, Trie Vertical Order Traversal of a Binary Tree (HARD) — Hash Table, Tree, Depth-First Search, Breadth-First Search, Sorting, Binary Tree Matchsticks to Square (MEDIUM) — Array, Dynamic Programming, Backtracking, Bit Manipulation, Bitmask Isomorphic Strings (EASY) — Hash Table, String E
eBay 78 questions tracked 73 with solutions
📊 All Time 78 📅 Last 6 Months 9 🔥 Last 3 Months 5 ⚡ Last 30 Days 0
Sorted highest → lowest frequency ✓ Our Solution = we have a detailed walkthrough
Showing 78 of 78 questions
2 Hash Table Linked List Design Doubly-Linked List
3 Easy Remove One Element to Make the Array Strictly Increasing ✓ Our Solution Array
4 Tree Depth-First Search String Matching Binary Tree +1
6 Hard Minimum Window Subsequence
String Dynamic Programming Sliding Window
9 Array Two Pointers Greedy Sorting
10 Array Depth-First Search Breadth-First Search Union Find +1
11 Hash Table String Breadth-First Search
13 Array Hash Table String Sorting
15 Array Hash Table String Breadth-First Search
16 Depth-First Search Graph Eulerian Circuit
17 Array Divide and Conquer Sorting Heap (Priority Queue) +1
19 Array String Backtracking Trie +1
20 Depth-First Search Breadth-First Search Graph Topological Sort
22 Depth-First Search Breadth-First Search Graph Topological Sort
23 Medium Meeting Rooms II
Array Two Pointers Greedy Sorting +2
24 Medium Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit ✓ Our Solution Array Queue Sliding Window Heap (Priority Queue) +2
25 Tree Breadth-First Search Binary Tree
26 Tree Depth-First Search Binary Search Tree Binary Tree
27 Array String Dynamic Programming Depth-First Search +1
28 String Dynamic Programming Backtracking
29 Array Breadth-First Search Matrix
31 Dynamic Programming Tree Depth-First Search Binary Tree
33 Hash Table String Sliding Window
37 Array Dynamic Programming Greedy
38 Easy Meeting Rooms
Array Sorting
41 String Dynamic Programming Stack
42 Array Dynamic Programming Matrix
43 Linked List Divide and Conquer Heap (Priority Queue) Merge Sort
44 Dynamic Programming Tree Depth-First Search Binary Tree
48 Hash Table Tree Depth-First Search Breadth-First Search +2
49 Array Dynamic Programming Backtracking Bit Manipulation +1
52 Array Breadth-First Search Matrix
53 Hash Table String Binary Search Design
54 Two Pointers String Dynamic Programming
55 Array Binary Search Divide and Conquer
58 Array Divide and Conquer Dynamic Programming
60 Tree Depth-First Search Binary Search Tree Binary Tree
61 Medium Nested List Weight Sum
Depth-First Search Breadth-First Search
62 Array Hash Table Divide and Conquer Sorting +4
63 Array Dynamic Programming Matrix
64 String Rolling Hash String Matching Hash Function
65 Array Binary Search Greedy Sorting
67 Array Hash Table Divide and Conquer Sorting +1
69 Array Two Pointers Binary Search
70 Hash Table String Greedy Sorting +2
71 Medium Longest Substring with At Most Two Distinct Characters
Hash Table String Sliding Window
74 Array Hash Table String Dynamic Programming +2
76 Array Hash Table String Sorting +1
