Problem 1

Given two strings s and t, where t is a subsequence of s. This means that the words in t appear in s in the same order but not necessarily consecutively.

Your task is to find the words in s that are not in t, and output them in their original order.

Example:

s = "I like cheese"
t = "like"

Output: ["I", "cheese"]

Explanation:

These words are in s but not part of t.

---

Problem 2

Given two strings x and y, find the longest subsequence of x that is also a substring of y. Return the maximum length of such a subsequence.

Example:

x = "hackerranks"
y = "hackers"

Output: 7

Explanation:

The entire string "hackers" is a substring of y and also a subsequence of x (characters appear in order). The maximum length is 7.

---

Split Array Largest Sum

Function Description

Complete the function splitArray in the editor.

splitArray has the following parameters:

• int[] nums: an integer array
• int k: the number of subarrays to split into

Returns

int: the minimum sum of the maximum values of the k subarrays

Example 1:

Input: nums = [1, 2, 3, 4, 5], k = 2
Output: 6

Explanation:

The optimal split is [1], [2, 3, 4, 5]. The sum of the maximum values of each subarray is max([1]) + max([2, 3, 4, 5]) = 1 + 5 = 6.

Constraints:

• 0 <= k <= 300
• 0 <= n <= 300
• 0 <= nums[i] <= 10^5

---

我们长期稳定承接各大科技公司如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.