TikTok数据相关面试真题

职位分类
全部
数据相关
计算机科学
人工智能
产品经理
BQ
面试题
全部(59)
SQL(5)
Coding(7)
ML basics(1)
Stats(1)
Product Case(45)
高频题(1)
Other(0)
全部(59)
SQL(5)
Coding(7)
ML basics(1)
Stats(1)
Product Case(45)
高频题(1)
Other(0)
1.Fraud report
2.Minimum Increment to Make Array Unique
3.Unique Paths
4.leetcode323
5.恐怖视频异常
6.上传用户排名
7.视频申诉
8.推荐系统
9.视频长度
10.国家segment
11.Number of Squareful Arrays
12.report功能
13.整体表现
14.静止相片
15.Fraud Content
16.violated content
17.国家segment
18.retweet
19.Causal Analysis
20.逻辑回归
21.推荐区别
22.长视频
23.TikTok怎么增加user
24.用户粘性
25.新Metric
26.Rank Violated Content
27.广告投放
28.广告投放
29.使用时长
30.数字转字母
31.计算所有组合
32.spark问题
33.Proudest project
34.Impressive features
35.Similar products
36.Analyse products
37.Ranking mechanics
38.Commercial Product Pricing Logic
39.Feature to be improved
40.current affairs
41.Content appealing
42. Product orientation
43.Success Factors for Tiktok e-commerce
44. Internationalization
45. Integrated marketing
46.Special situatio
47. Product improvement
48. Related fieldwork
49. Comprehension
50.three non technical products
51.Redesign a washer and dryer to increase sales and profit
52.足够的视频
53.Process success and sql
54.SQL aggregation functions
55.Data type
56.SQL query Cities with more customers than average
57.Experiment design
58.Experiment design
59.SQL functions
1. Fraud report
如果发现fraud report 变多了 或者突然fraud 视频review 变多了 怎么办?
2. Minimum Increment to Make Array Unique
You are given an integer array nums. In one move, you can pick an index i where 0 <= i < nums.length and increment nums[i] by 1.
Return the minimum number of moves to make every value in nums unique.
The test cases are generated so that the answer fits in a 32-bit integer.
3. Unique Paths
There is a robot on an m x n grid. The robot is initially located at the top-left corner (i.e., grid[0][0]). The robot tries to move to the bottom-right corner (i.e., grid[m - 1][n - 1]). The robot can only move either down or right at any point in time.
Given the two integers m and n, return the number of possible unique paths that the robot can take to reach the bottom-right corner.
The test cases are generated so that the answer will be less than or equal to 2 * 109.
4. leetcode323
https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph/
5. 恐怖视频异常
现在系统有user report和ML detect两种途径flag恐怖视频,被flag的视频会送给reviewer审查,再决定是否删除视频。问怎么判断这个系统是否success?需要用哪些metrics?如果某天恐怖视频数量突增,怎么分析是什么原因?