Question 1

Given a String array, return the output array in form where each word is first letter of that word with last letter of next (i+1)th index word.

Example

Input: ["cat", "dog", "flower", "bed"]
Output: ["cg", "dr", "fd", "bt"]

---

Question 2

Given a string, you can reverse part of it from any index towards left or right.

Example

Input: "dbaacca"
From index 1, reverse db -> append with rest of original -> bdaacca  
From index 2, reverse dba -> append with rest of original -> abadcca  
From index 5, reverse ca towards right -> append with rest of original -> dbaacac  
Output all possible list of strings

---

Question 3

Given 4 arrays wins, draws, scored, conceded of size N these arrays represent the stat of N teams:

• wins[i] represent the number of wins of i-th team
• draws[i] represent the number of draws of i-th team
• scored[i] represent the score of i-th team
• conceded[i] represent the conceded of i-th team

Now for every win a team is rewarded 3 points and for every draw team is rewarded 1 point. Now we want to find the highest and second highest scoring team and if there is a tie between the points it will be resolved by taking the difference between scored[i] - conceded[i].

Return the indexes of the team.

Example

Input:
wins = [1, 2, 3]
draw = [1, 1, 1]
scored = [10, 20, 30]
conceded = [12, 23, 12]

points for team 0 = 1 * 3 + 1 = 4  
points for team 1 = 2 * 3 + 1 = 7  
points for team 2 = 3 * 3 + 1 = 10

return (2, 1)

Note:
If there is a tie between teams, points it will be resolved by taking the difference between scored[i] - conceded[i].

---

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