PayPal数据相关面试真题

职位分类
全部
数据相关
计算机科学
人工智能
产品经理
BQ
面试题
全部(35)
SQL(3)
Coding(15)
ML basics(7)
Stats(0)
Product Case(2)
高频题(0)
Other(8)
全部(35)
SQL(3)
Coding(15)
ML basics(7)
Stats(0)
Product Case(2)
高频题(0)
Other(8)
1.Calculating Rolling Sum for the Last 30 Days
2.Enhancing Fraud Detection: Efficient Challenge Authentication Methods
3.Detecting Fraudulent Transactions: Strategies and Techniques
4.Finding the First Missing Value in a Consecutive List.
5.Vowel Prefix Count in Queries
6.Max Positive Prefix Sum
7.Closest Numbers
8.Playlist Song Pairing
9.First Unique Character Function
10.Vowels Query Function
11.Maximize Positive Prefixes
12.Closest Numbers
13.Playlist Pairing
14.Whole Minute Dilemma
15.Maximize Positive Prefix Sums
16.Vowels Prefix Sum
17.Minute Dilemma
18.Vowels
19.Positive Prefixes
20.First Unique Character
21.Closest Number
22.Whole Minute Dilemma
23.SQL and coding interview round
24.SQL-focused interview round
25.Find the Xth Largest Element in an Array
26.How do you evaluate a model?
27.How do you deal with imbalanced data?
28.What is TFIDF and how is it used?
29.Difference between Bias and Variance?
30.What is the difference between Boosting and Bagging?
31.Explain the difference between a decision tree and RandomForest/LightGBM.
32.Sanity Check for Campaign Results
33.Designing an Experiment
34.SQL Window Functions
35.Implement a Transaction Filter Function
1. Calculating Rolling Sum for the Last 30 Days
求每天的前30天的rollling sum.
2. Enhancing Fraud Detection: Efficient Challenge Authentication Methods
detect fraud以后,需要给user send challenges:sms, email, ivr。brainstorm一下其他更好的challenge authentication的方法,从cost,effective考虑。.
3. Detecting Fraudulent Transactions: Strategies and Techniques
给一些transactional的信息,怎么判断是不是fraud
4. Finding the First Missing Value in a Consecutive List.
find 1st missing value in a consecutive list, like [1,2,4,5] --->3
5. Vowel Prefix Count in Queries
Given a string array and a query array, return the count of elements in each query where the first and last letters are vowels. Use prefix sums to solve this efficiently. Store the count of elements with first and last vowels from 0 to i in a prefix array, and calculate the range i to j as range 0 to j minus range 0 to i.