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?如果某天恐怖视频数量突增,怎么分析是什么原因?