2657. Find the Prefix Common Array of Two Arrays
You are given two 0-indexed integer permutations
AandBof lengthn.A prefix common array of
AandBis an arrayCsuch thatC[i]is equal to the count of numbers that are present at or before the indexiin bothAandB.Return the prefix common array of
AandB.A sequence of
nintegers is called a permutation if it contains all integers from1tonexactly once.
2656. Maximum Sum With Exactly K Elements
You are given a 0-indexed integer array
numsand an integerk. Your task is to perform the following operation exactlyktimes in order to maximize your score:
- Select an element
mfromnums.- Remove the selected element
mfrom the array.- Add a new element with a value of
m + 1to the array.- Increase your score by
m.Return the maximum score you can achieve after performing the operation exactly
ktimes.