Question 2

Problem Description

A palindrome is a string that reads the same forwards and backwards, such as 121 or tacocat.
A substring is a continuous sequence of characters within a string.

Given a string s, how many unique substrings of s are palindromes?

Example

s = "mokokori"

Some of its substrings are {m, o, k, o, k, r, i, mo, ok, mok, okk, kk, okko}.
There are 7 distinct palindromes {m, o, k, r, i, kk, okko}.

Function Description

Complete the function palindrome in the editor below.

palindrome has the following parameter(s):
    string s: a string

Returns:
    int: the number of distinct palindromes

Constraints

• 1 ≤ |s| ≤ 5000
• Each character s[i] is in the range ascii[a-z]

Sample Case 0

Sample Input 0

aabaa → s = "aabaa"

Sample Output 0

5

Explanation 0

Palindromic substrings are ['a', 'aa', 'aabaa', 'aba', 'b'].

• The substring 'a' occurs 4 times, but is counted only once.
• Similarly, the substring 'aa' occurs twice but counts as one distinct palindrome.

The number of distinct palindromes is 5.

---

Question 3

There are n jobs that can be executed in parallel on a processor, where the execution time of the ith job is executionTime[i]. To speed up execution, the following strategy is used:

In one operation, a job is chosen, the major job, and is executed for x seconds. All other jobs are executed for y seconds where y < x.

A job is complete when it has been executed for at least executionTime[i] seconds, then it exits the pool. Find the minimum number of operations in which the processor can completely execute all the jobs if run optimally.

Example

Consider n = 5, executionTime = [3, 4, 1, 7, 6], x = 4 and y = 2.

The following strategy is optimal using 1-based indexing.

• Choose job 4 as the major job and reduce the execution times of job 4 by x = 4 and other jobs by y = 2
  Now executionTime = [1, 2, 0, 3, 4]. Job 3 is complete, so it is removed.
• Choose job 4, executionTime = [1, 0, -, -1, 2]. So, jobs 1, 2 and 4 are now complete.
• Choose job 5, executionTime = [-1, -, -, -, 0]. Job 5 is complete.

It takes 3 operations to execute all the jobs so the answer is 3.

Function Description

Complete the function getMinimumOperations in the editor below.

getMinimumOperations has the following parameters:
int executionTime[n]: the execution times of each job
int x: the time for which the major job is executed
int y: the time for which all other jobs are executed

Returns

int: the minimum number of operations in which the processor can complete the jobs

Constraints

• 1 ≤ n ≤ 10⁵
• 1 ≤ executionTime[i] ≤ 10⁹
• 1 ≤ y < x ≤ 10⁹

Sample Case 0

Sample Input For Custom Testing

STDIN                         FUNCTION
-----                         --------
5                             → executionTime[] size, n = 5
3 4 1 7 6                     → executionTime = [3, 4, 1, 7, 6]
3                             → x = 3
2                             → y = 2

Sample Output

3

Explanation

• Choose job 5, then executionTime = [1, 1, -1, 4, 6]. All jobs are still in the pool.
• Choose job 5, then executionTime = [-1, -1, -, 2, 3]. So, jobs 1, 2, and 4 are complete.
• Choose job 5, then executionTime = [-3, -, -, -, 0]. Jobs 3 and 5 are complete.

Sample Case 1

(Continued in next image if available)

---

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