This is an online programming test.

The algorithmic problems of Bytedance are much more difficult than those of other companies.

There are a lot of dynamic programming questions, with two dynamic programming questions out of the four total.

The time limit is two hours.

1. LeetCode simple level questions.

2. The pass rate is 44.4%. A simulation question is given for an array. If the current element is the smallest in the queue, dequeue it; if not, move it to the end of the queue.

3. Find the longest descending subsequence for an array consisting of letters, and return the length and the sequence. If the lengths are equal, the sequence should be returned in lexicographical order.

4. Find the number of subsequences where the maximum value minus the minimum value is less than k for an array.