OA VO support

[TikTok] AMS Intern Assessment 2025 Start-30 Nov(Generic) – Tiktok OA 11.30 – OA 代写 – 面试代面 – 面试辅助 – 一亩三分地

首先仍然是限时110分钟,7道题。

私信我的同学不要求 NG / intern 某某岗位的题了,所有岗位,所有地区的题目都是一样的,只要在这个时间段内。

Firstly, it is still limited to 110 minutes and consists of 7 questions.

The questions for all positions and regions are the same, as long as they are within this time period.

Q1- Q5的完整版本将在数日后公布,请保持对本站的关注或者联系我们

Tips: The complete version of Q1 - Q5 will be released in a few days. Please keep an eye on our website or contact us

Q6. Interesting Watch Sequence

You are given a sequence of n TikTok videos, each represented by a unique rating in the array videoRatings, reflecting the order in which the videos are presented to the user.

A sequence of videos is considered coherent if:

  • By removing at most one video from the sequence, the remaining videoRatings form an increasing order.

The TikTok algorithm aims to suggest a coherent sequence to the user by potentially removing some videos, effectively selecting a subsequence of the original sequence.

Given the array videoRatings of length n, determine the minimum number of videos that must be discarded so that the remaining sequence is coherent.

Note: A subsequence is a sequence derived from another sequence by deleting some or no elements, without changing the order of the remaining elements.

Example:

videoRatings = [1, 10, 4, 5, 3]

The given videoRatings is not coherent because removing any single video from the sequence does not result in an increasing order.

However, if we remove the video at index 1, where videoRatings = 10, the remaining sequence becomes [1, 4, 5, 3]. By removing the video with videoRatings = 3, the sequence becomes [1, 4, 5], which forms an increasing order. Thus [1, 4, 5, 3] is coherent and the minimal removal required is 1.

Alternatively, if we remove the video at index 4, where videoRatings = 3, the sequence becomes [1, 10, 4, 5], which is also coherent.
Thus, the minimum number of videos that must be removed in this case is 1.

Q7. Interaction Strength on TikTok

TikTok’s algorithm team is developing a feature to improve how videos are recommended to users based on content engagement. The team is analyzing engagement patterns to rank which video combinations create the highest overall user interaction. They represent the engagement data for each video in a sequence of numbers, where each number reflects the engagement score for a video.

The goal is to help the TikTok team determine the kᵗʰ highest engagement combination from any possible sequence of videos in the feed. The engagement score of any sequence is calculated by applying the bitwise OR on the engagement scores of all the videos in that sequence.

Your task is to implement a function that, given a list of engagement scores engagement_scores and a rank k, finds the kᵗʰ highest interaction strength that can be achieved by combining scores of any sequence of videos from the list.

The interaction strength of a sequence starting from video i to video j is given by:
engagement_scores[i] OR engagement_scores[i+1] OR ... OR engagement_scores[j]

A sequence is any contiguous segment of videos from the feed. For example, if the engagement scores are {2, 5, 7}, the possible sequences are {2}, {2, 5}, {2, 5, 7}, {5}, {5, 7}, and {7}.

Example:

Consider, n = 4, engagement_scores = [3, 2, 7, 1], and k = 5.

ijEngagement score
113
123 OR 2 = 3
133 OR 2 OR 7 = 7
143 OR 2 OR 7 OR 1 = 7
222
232 OR 7 = 7
242 OR 7 OR 1 = 7
337
347 OR 1 = 7
441

The kᵗʰ highest interaction strength is the 5ᵗʰ highest unique value, which is 3.

我们长期稳定承接各大科技公司如TikTok、Google、Amazon等的OA笔试代写服务,确保满分通过。如有需求,请随时联系我们。

We consistently provide professional online assessment services for major tech companies like TikTok, Google, and Amazon, guaranteeing perfect scores. Feel free to contact us if you're interested.

Leave a Reply

Your email address will not be published. Required fields are marked *