<iframe src="https://www.googletagmanager.com/ns.html?id=GTM-KVGHS6G" height="0" width="0" style="display:none;visibility:hidden"></iframe>

Ebay面试真题

职位分类
全部
数据相关
计算机科学
人工智能
产品经理
BQ
全部(0)
1.Coin Change Problem
2.Relationship between eigenvector and invertible matrix
3.Item平均价格
4.Course Schedule II
5.Grouping Anagrams from a List of Strings
6.Unique Binary Search Trees Count
7.Validating Binary Search Tree
8."Finding Maximum Depth of a Binary Tree"
9.HasPathSum in Binary Tree
10.Search 2D Matrix
11.Finding the Lowest Common Ancestor of Two Nodes in a Binary Tree
12.Binary Tree Level Order Traversal
13.Finding the Lowest Common Ancestor in a Binary Search Tree
14.Search in Rotated Sorted Array
15.Wildcard Pattern Matching Algorithm
16.Matrix
17.Interval overlapping
18.Best Time to Buy and Sell Stock
19.‌‌‌‌‍‍‍‍‍‌‌‌‌‍‍‌‍Event Emitter
20.Fit With Cell Replacement
21.Reduce The Number
22.三角形水杯乘酒的问题
23.Rotating a Box and Simulating Gravity
24.Matrix Queries
25.New Text Editor
26."Remove Anagrams and Convert Binary Search Tree to Sorted Doubly Linked List"
27.Remove Duplicates from Sorted Array
28.光线覆盖问题
29.Distinct Pairs with Digits Differing by 1
30.Implement Matrix Operations
31.Placing Obstacles on an Infinite Line
32.Sum of Lists and Return Most Frequent
33.Word Transformation Based on Length
34.Asteroid Collision Problem
35.Building a Functional Ads Platform
36.Designing an Ads Platform
37.Browser URL Processing
38.Implementing 'classList' functionality using ES6
39.Design a Ticket Selling System
40.Department Top Three Salaries
41.Calculate Average Monthly Revenue by Country
42.R Language Proficiency
43.Linear Regression Fundamentals
44.Understanding Decision Trees
45.Fibonacci Number Optimization
46.Optimizing Search Engine Relevance
47.Serialize and Deserialize Binary Tree
48.C++ Profiling Tools
49.System Design for Finding Top K Similar Vectors
50.Write SQL queries for business-related calculations
51.Write a SQL query for a Hard level problem
52.Discuss revenue & loss and fraud detection related to Product BQs
53.SQL Query for Airline Seat Reservation and Purchase System
54.Simple Coding with Binary Search Follow-up
55.System Design - WebSocket vs Long Polling
56.Math Problem Related to Finding Common Multiples
57.Optimization of String Transformation
58.Pattern Matching in a Dictionary of Words
59.Handling Stream Input for a Coding Problem
60.Calendar Meeting Scheduling
61.System Design for a TinyURL Service
62.Longest Substring Without Repeating Characters
63.Topological Sorting of Course Schedule
64.Difference between Key-Value Databases and Document Databases
65.Managerial Behavioral Questions
66.Reverse Words in a Sentence
67.Find the Kth Largest Element
68.Count Islands in a Grid
69.Object-Oriented Design of a Shopping Cart
70.Design a Hash Map
71.Behavioral Interview Question
72.Algorithm and Complexity Analysis Interview Question
73.Inheritance and Encapsulation Interview Question
74.Multithread and OOD Interview Question
75.Minimum Dial Turns to Reach New Time
76.Generate All Substrings of a String
77.System Design for an eBay Notification System
78.Climbing Stairs Problem
79.Behavioral Questions - Deep Dive into Resume
80.Convert a Linked List to a Binary Tree
81.Merge K Sorted Lists
82.Merge Intervals
83.Array Value Reduction and Summation
84.Sorting Submatrices by Minimum Element
85.Subarray Matching a Pattern
86.Count Even Number of Digits
87.String Skeleton Match
88.Game Winner Prediction
89.Matrix Value Search
90.Boolean Expression Evaluation
91.Binary String Operations
92.Convert Snake Case to Camel Case
93.Ranking Players Based on Points and Score Differences
94.Find the Index of the First Local Minimum in an Array
95.Stone Game Variant
96.Array Transformation Algorithm
97.Circular Storage Operations
98.Street Light Coverage Problem
99.String Addition and Concatenation
100.Longest Subarray with Absolute Difference Constraint
101.Matrix Division to Minimize Max-Min Value Difference
102.Cyclic X-Shift Array to Reverse-Sorted Array
103.Longest Subarray with Limited Difference
104.Matrix Division to Minimize Maximal and Minimal Value Difference
105.Cyclic X-Shift Array
106.Rectangles Fit in a Large Rectangle
107.Building Houses at Specific Indices with Constraints
108.Circular Storage with a Starting Index
109.Word Formation from Characters with Hyphens
110.Find Elements Greater Than Neighbors in an Array
111.Binary String Operations
112.Convert Snake Case to Camel Case in Quoted Strings
113.Sum of First Positive Numbers and Subsequent Operations
114.Find Elements Greater Than Neighbors
115.Rectangle Fit Operations
116.Binary String Analysis
117.Memory Allocation and Release System Simulation
118.Minimum Circular Shifts to Match Arrays
119.Addition and Subtraction Validation
120.Rectangle Box Fit
121.Array Sign Check
1. Coin Change Problem
You are given an integer array coins representing coins of different denominations and an integer amount representing a total amount of money.

Return the fewest number of coins that you need to make up that amount. If that amount of money cannot be made up by any combination of the coins, return -1.

You may assume that you have an infinite number of each kind of coin.

 

Example 1:

Input: coins = [1,2,5], amount = 11
Output: 3
Explanation: 11 = 5 + 5 + 1

Example 2:

Input: coins = [2], amount = 3
Output: -1

Example 3:

Input: coins = [1], amount = 0
Output: 0

 

Constraints:

  • 1 <= coins.length <= 12
  • 1 <= coins[i] <= 231 - 1
  • 0 <= amount <= 104
2. Relationship between eigenvector and invertible matrix
特征根和可逆矩阵之间的关系
3. Item平均价格
一个item list有item id,item categories(即一个item可以属于多个category)和 price,计算某个category的item的平均价格。
4. Course Schedule II
There are a total of numCourses courses you have to take, labeled from 0 to numCourses - 1. You are given an array prerequisites where prerequisites[i] = [ai, bi] indicates that you must take course bi first if you want to take course ai.

  • For example, the pair [0, 1], indicates that to take course 0 you have to first take course 1.
Return the ordering of courses you should take to finish all courses. If there are many valid answers, return any of them. If it is impossible to finish all courses, return an empty array.

 

Example 1:

Input: numCourses = 2, prerequisites = [[1,0]]
Output: [0,1]
Explanation: There are a total of 2 courses to take. 
To take course 1 you should have finished course 0. So the correct course order is [0,1].

Example 2:

Input: numCourses = 4, prerequisites = [[1,0],[2,0],[3,1],[3,2]]
Output: [0,2,1,3]
Explanation: There are a total of 4 courses to take. To take course 3 you should have finished both courses 1 and 2.
Both courses 1 and 2 should be taken after you finished course 0.
So one correct course order is [0,1,2,3]. Another correct ordering is [0,2,1,3].

Example 3:

Input: numCourses = 1, prerequisites = []
Output: [0]

 

Constraints:

  • 1 <= numCourses <= 2000
  • 0 <= prerequisites.length <= numCourses * (numCourses - 1)
  • prerequisites[i].length == 2
  • 0 <= ai, bi < numCourses
  • ai != bi
  • All the pairs [ai, bi] are distinct.
5. Grouping Anagrams from a List of Strings
Given an array of strings strs, group the anagrams together. You can return the answer in any order.

An Anagram is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once.

 

Example 1:

Input: strs = ["eat","tea","tan","ate","nat","bat"]
Output: [["bat"],["nat","tan"],["ate","eat","tea"]]

Example 2:

Input: strs = [""]
Output: [[""]]

Example 3:

Input: strs = ["a"]
Output: [["a"]]

 

Constraints:

  • 1 <= strs.length <= 104
  • 0 <= strs[i].length <= 100
  • strs[i] consists of lowercase English letters.